| An experimental comparison of four graph drawing algorithms G Di Battista, A Garg, G Liotta, R Tamassia, E Tassinari, F Vargiu Computational Geometry 7 (5-6), 303-325, 1997 | 233 | 1997 |
| Straight-Line Drawings on Restricted Integer S Felsmer, G Liotta, S Wismath Graph Algorithms and Applications 4 4, 363, 2006 | 165* | 2006 |
| Upward drawings of triconnected digraphs P Bertolazzi, GD Battista, G Liotta, C Mannino Algorithmica 12 (6), 476-497, 1994 | 163 | 1994 |
| Drawing graphs with right angle crossings W Didimo, P Eades, G Liotta Theoretical Computer Science 412 (39), 5156-5166, 2011 | 122 | 2011 |
| On the parameterized complexity of layered graph drawing V Dujmović, M Fellows, M Hallett, M Kitching, G Liotta, C McCartin, ... European Symposium on Algorithms, 488-499, 2001 | 110* | 2001 |
| An annotated bibliography on 1-planarity SG Kobourov, G Liotta, F Montecchiani Computer Science Review 25, 49-67, 2017 | 108 | 2017 |
| Graph visualization techniques for web clustering engines E Di Giacomo, W Didimo, L Grilli, G Liotta IEEE Transactions on Visualization and Computer Graphics 13 (2), 294-304, 2007 | 102 | 2007 |
| Robust proximity queries: An illustration of degree-driven algorithm design G Liotta, FP Preparata, R Tamassia SIAM Journal on Computing 28 (3), 864-889, 1998 | 99 | 1998 |
| Right angle crossing graphs and 1-planarity P Eades, G Liotta Discrete Applied Mathematics 161 (7-8), 961-969, 2013 | 94 | 2013 |
| Fáry’s theorem for 1-planar graphs SH Hong, P Eades, G Liotta, SH Poon International Computing and Combinatorics Conference, 335-346, 2012 | 89 | 2012 |
| Spirality and optimal orthogonal drawings G Di Battista, G Liotta, F Vargiu SIAM Journal on Computing 27 (6), 1764-1811, 1998 | 86 | 1998 |
| Visual analysis of large graphs using (x, y)-clustering and hybrid visualizations V Batagelj, FJ Brandenburg, W Didimo, G Liotta, P Palladino, ... IEEE transactions on visualization and computer graphics 17 (11), 1587-1598, 2010 | 82 | 2010 |
| A survey on graph drawing beyond planarity W Didimo, G Liotta, F Montecchiani ACM Computing Surveys (CSUR) 52 (1), 1-37, 2019 | 81 | 2019 |
| Proximity drawability: A survey extended abstract GD Battista, W Lenhart, G Liotta International Symposium on Graph Drawing, 328-339, 1994 | 74 | 1994 |
| Selected open problems in graph drawing F Brandenburg, D Eppstein, MT Goodrich, S Kobourov, G Liotta, P Mutzel International Symposium on Graph Drawing, 515-539, 2003 | 73 | 2003 |
| Characterizing proximity trees P Bose, W Lenhart, G Liotta Algorithmica 16 (1), 83-110, 1996 | 73 | 1996 |
| Curve-constrained drawings of planar graphs E Di Giacomo, W Didimo, G Liotta, SK Wismath Computational Geometry 30 (1), 1-23, 2005 | 69 | 2005 |
| Recognizing and drawing IC-planar graphs FJ Brandenburg, W Didimo, WS Evans, P Kindermann, G Liotta, ... Theoretical Computer Science 636, 1-16, 2016 | 61 | 2016 |
| An experimental comparison of three graph drawing algorithms G Di Battista, A Garg, G Liotta Proceedings of the eleventh annual symposium on Computational geometry, 306-315, 1995 | 61 | 1995 |
| Turn-regularity and optimal area drawings of orthogonal representations SS Bridgeman, G Di Battista, W Didimo, G Liotta, R Tamassia, L Vismara Computational Geometry 16 (1), 53-93, 2000 | 57 | 2000 |
Walter DidimoAssociate Professor, University of PerugiaVerified email at unipg.it
