| Monotone drawings of graphs with fixed embedding P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ... Algorithmica 71, 233-257, 2015 | 34* | 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 | 33 | 2014 |
| Gestalt principles in graph drawing SG Kobourov, T Mchedlidze, L Vonessen Graph Drawing and Network Visualization: 23rd International Symposium, GD …, 2015 | 30 | 2015 |
| 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 | 30 | 2007 |
| Extending convex partial drawings of graphs T Mchedlidze, M Nöllenburg, I Rutter Algorithmica 76 (1), 47-67, 2016 | 27* | 2016 |
| Upward book embeddings of st-graphs C Binucci, G Da Lozzo, E Di Giacomo, W Didimo, T Mchedlidze, ... arXiv preprint arXiv:1903.07966, 2019 | 22 | 2019 |
| 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 | 21 | 2018 |
| 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 | 21 | 2016 |
| 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 | 21 | 2014 |
| 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 | 20 | 2011 |
| 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 | 19 | 2018 |
| 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 |
| Aesthetic discrimination of graph layouts M Klammler, T Mchedlidze, A Pak Graph Drawing and Network Visualization: 26th International Symposium, GD …, 2018 | 16 | 2018 |
| 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 | 16* | 2015 |
| Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs T Mchedlidze, A Symvonis International Symposium on Algorithms and Computation, 882-891, 2009 | 16 | 2009 |
| 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 | 15 | 2016 |
| 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 | 15 | 2012 |
| 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 | 15 | 2010 |
| 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 | 14 | 2019 |
| Experimental evaluation of book drawing algorithms J Klawitter, T Mchedlidze, M Nöllenburg International Symposium on Graph Drawing and Network Visualization, 224-238, 2017 | 14 | 2017 |
Antonios SymvonisNational Technical U. of Athens在 math.ntua.gr 的电子邮件经过验证
