Folgen
Dr. Tamara Mchedlidze
Titel
Zitiert von
Zitiert von
Jahr
Gestalt principles in graph drawing
SG Kobourov, T Mchedlidze, L Vonessen
Graph Drawing and Network Visualization: 23rd International Symposium, GD …, 2015
362015
Monotone drawings of graphs with fixed embedding
P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ...
Algorithmica 71, 233-257, 2015
35*2015
Bar 1-visibility graphs and their relation to other nearly planar graphs
W Evans, M Kaufmann, W Lenhart, T Mchedlidze, S Wismath
Journal of Graph Algorithms and Applications 18 (5), 721-739, 2014
342014
Computing upward topological book embeddings of upward planar digraphs
F Giordano, G Liotta, T Mchedlidze, A Symvonis
Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai …, 2007
322007
Extending convex partial drawings of graphs
T Mchedlidze, M Nöllenburg, I Rutter
Algorithmica 76 (1), 47-67, 2016
29*2016
Lower and upper bounds for long induced paths in 3-connected planar graphs
E Di Giacomo, G Liotta, T Mchedlidze
Theoretical Computer Science 636, 47–55, 2016
252016
Upward book embeddings of st-graphs
C Binucci, G Da Lozzo, E Di Giacomo, W Didimo, T Mchedlidze, ...
arXiv preprint arXiv:1903.07966, 2019
232019
The power of shape: How shape of node-link diagrams impacts aesthetic appreciation and triggers interest
CC Carbon, T Mchedlidze, MH Raab, H Wächter
i-Perception 9 (5), 2041669518796851, 2018
232018
Small point sets for simply-nested planar graphs
P Angelini, G Di Battista, M Kaufmann, T Mchedlidze, V Roselli, ...
International Symposium on Graph Drawing, 75-85, 2011
222011
Minimum tree supports for hypergraphs and low-concurrency Euler diagrams
B Klemz, T Mchedlidze, M Nöllenburg
Algorithm Theory–SWAT 2014: 14th Scandinavian Symposium and Workshops …, 2014
212014
Drawing planar graphs with many collinear vertices
G Da Lozzo, V Dujmović, F Frati, T Mchedlidze, V Roselli
Journal of Computational Geometry 9 (1), 94–130-94–130, 2018
202018
Aesthetic discrimination of graph layouts
M Klammler, T Mchedlidze, A Pak
Graph Drawing and Network Visualization: 26th International Symposium, GD …, 2018
182018
Computing upward topological book embeddings of upward planar digraphs
F Giordano, G Liotta, T Mchedlidze, A Symvonis, SH Whitesides
Journal of Discrete Algorithms 30, 45-69, 2015
18*2015
Universal point sets for planar graph drawings with circular arcs
P Angelini, D Eppstein, F Frati, M Kaufmann, S Lazard, T Mchedlidze, ...
Canadian Conference on Computational Geometry, 117-122, 2013
18*2013
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
T Mchedlidze, A Symvonis
International Symposium on Algorithms and Computation, 882-891, 2009
182009
Planar graphs of bounded degree have bounded queue number
M Bekos, H Förster, M Gronemann, T Mchedlidze, F Montecchiani, ...
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
172019
Strongly monotone drawings of planar graphs
S Felsner, A Igamberdiev, P Kindermann, BorisKlemz, T Mchedlidze, ...
32nd International Symposium on Computational Geometry (SoCG 2016) 51, 1-15, 2016
172016
Upward geometric graph embeddings into point sets
P Angelini, F Frati, M Geyer, M Kaufmann, T Mchedlidze, A Symvonis
International Symposium on Graph Drawing, 25-37, 2010
162010
Experimental evaluation of book drawing algorithms
J Klawitter, T Mchedlidze, M Nöllenburg
International Symposium on Graph Drawing and Network Visualization, 224-238, 2017
152017
Universal point subsets for planar graphs
P Angelini, C Binucci, W Evans, F Hurtado, G Liotta, T Mchedlidze, ...
International Symposium on Algorithms and Computation, 423-432, 2012
152012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20