| 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 | 258 | 1997 |
| Upward drawings of triconnected digraphs P Bertolazzi, GD Battista, G Liotta, C Mannino Algorithmica 12, 476-497, 1994 | 188 | 1994 |
| Straight-line drawings on restricted integer grids in two and three dimensions S Felsner, G Liotta, S Wismath Journal of Graph Algorithms and Applications 7 (4), 363-398, 2003 | 175 | 2003 |
| A survey on graph drawing beyond planarity W Didimo, G Liotta, F Montecchiani ACM Computing Surveys (CSUR) 52 (1), 1-37, 2019 | 156 | 2019 |
| An annotated bibliography on 1-planarity SG Kobourov, G Liotta, F Montecchiani Computer Science Review 25, 49-67, 2017 | 153 | 2017 |
| Drawing graphs with right angle crossings W Didimo, P Eades, G Liotta Theoretical Computer Science 412 (39), 5156-5166, 2011 | 153 | 2011 |
| On the parameterized complexity of layered graph drawing V Dujmović, MR Fellows, M Kitching, G Liotta, C McCartin, N Nishimura, ... Algorithmica 52, 267-292, 2008 | 132* | 2008 |
| Spirality and optimal orthogonal drawings G Di Battista, G Liotta, F Vargiu SIAM Journal on Computing 27 (6), 1764-1811, 1998 | 119 | 1998 |
| 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 | 107 | 2007 |
| Right angle crossing graphs and 1-planarity P Eades, G Liotta Discrete Applied Mathematics 161 (7-8), 961-969, 2013 | 106 | 2013 |
| Robust proximity queries: An illustration of degree-driven algorithm design G Liotta, FP Preparata, R Tamassia Proceedings of the thirteenth annual symposium on Computational geometry …, 1997 | 103 | 1997 |
| 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 | 96 | 2010 |
| Fáry’s theorem for 1-planar graphs SH Hong, P Eades, G Liotta, SH Poon Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012 | 94 | 2012 |
| Selected open problems in graph drawing F Brandenburg, D Eppstein, MT Goodrich, S Kobourov, G Liotta, P Mutzel Graph Drawing: 11th International Symposium, GD 2003 Perugia, Italy …, 2004 | 86 | 2004 |
| Characterizing proximity trees P Bose, W Lenhart, G Liotta Algorithmica 16, 83-110, 1996 | 81 | 1996 |
| Curve-constrained drawings of planar graphs E Di Giacomo, W Didimo, G Liotta, SK Wismath Computational Geometry 30 (1), 1-23, 2005 | 76 | 2005 |
| Proximity drawability: a survey extended abstract G Di Battista, W Lenhart, G Liotta International Symposium on Graph Drawing, 328-339, 1994 | 76 | 1994 |
| Upward spirality and upward planarity testing W Didimo, F Giordano, G Liotta SIAM Journal on Discrete Mathematics 23 (4), 1842-1899, 2010 | 73* | 2010 |
| An advanced network visualization system for financial crime detection W Didimo, G Liotta, F Montecchiani, P Palladino 2011 IEEE Pacific visualization symposium, 203-210, 2011 | 71 | 2011 |
| Drawing directed acyclic graphs: An experimental study G Di Battista, A Garg, G Liotta, A Parise, R Tamassia, E Tassinari, ... International Journal of Computational Geometry & Applications 10 (06), 623-648, 2000 | 69 | 2000 |
Walter DidimoProfessor, University of Perugiaبريد إلكتروني تم التحقق منه على unipg.it
