Follow
Dr. Tamara Mchedlidze
Title
Cited by
Cited by
Year
Monotone drawings of graphs with fixed embedding
P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ...
Algorithmica 71 (2), 233-257, 2015
33*2015
Bar 1-visibility graphs and their relation to other nearly planar graphs
W Evans, M Kaufmann, W Lenhart, T Mchedlidze, S Wismath
J. Graph Algorithms Appl 18 (5), 721-739, 2014
332014
Computing upward topological book embeddings of upward planar digraphs
F Giordano, G Liotta, T Mchedlidze, A Symvonis
International Symposium on Algorithms and Computation, 172-183, 2007
282007
Extending convex partial drawings of graphs
T Mchedlidze, M Nöllenburg, I Rutter
Algorithmica 76 (1), 47-67, 2016
22*2016
Gestalt principles in graph drawing
SG Kobourov, T Mchedlidze, L Vonessen
International Symposium on Graph Drawing, 558-560, 2015
212015
Minimum tree supports for hypergraphs and low-concurrency Euler diagrams
B Klemz, T Mchedlidze, M Nöllenburg
Scandinavian Workshop on Algorithm Theory, 265-276, 2014
192014
Small point sets for simply-nested planar graphs
P Angelini, GD Battista, M Kaufmann, T Mchedlidze, V Roselli, ...
International Symposium on Graph Drawing, 75-85, 2011
192011
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
152018
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
152013
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
142016
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
142016
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
13*2015
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
132012
Crossing-optimal acyclic hamiltonian path completion and its application to upward topological book embeddings
T Mchedlidze, A Symvonis
International Workshop on Algorithms and Computation, 250-261, 2009
13*2009
Planar graphs of bounded degree have bounded queue number
MA Bekos, H Förster, M Gronemann, T Mchedlidze, F Montecchiani, ...
SIAM Journal on Computing 48 (5), 1487-1502, 2019
122019
Experimental evaluation of book drawing algorithms
J Klawitter, T Mchedlidze, M Nöllenburg
International Symposium on Graph Drawing and Network Visualization, 224-238, 2017
122017
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
122010
Upward book embeddings of st-graphs
C Binucci, G Da Lozzo, E Di Giacomo, W Didimo, T Mchedlidze, ...
arXiv preprint arXiv:1903.07966, 2019
112019
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
T Mchedlidze, A Symvonis
International Symposium on Algorithms and Computation, 882-891, 2009
112009
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
102018
The system can't perform the operation now. Try again later.
Articles 1–20