Drawing graphs with right angle crossings W Didimo, P Eades, G Liotta Theoretical Computer Science 412 (39), 5156-5166, 2011 | 146 | 2011 |

A survey on graph drawing beyond planarity W Didimo, G Liotta, F Montecchiani ACM Computing Surveys (CSUR) 52 (1), 1-37, 2019 | 135 | 2019 |

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 | 106 | 2007 |

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 | 94 | 2010 |

Network and Parallel Computing W DIDIMO, M PATRIGNANI vol 5013, 19, 2008 | 89 | 2008 |

Computing orthogonal drawings with the minimum number of bends P Bertolazzi, G Di Battista, W Didimo IEEE Transactions on Computers 49 (8), 826-840, 2000 | 86 | 2000 |

Curve-constrained drawings of planar graphs E Di Giacomo, W Didimo, G Liotta, SK Wismath Computational Geometry 30 (1), 1-23, 2005 | 76 | 2005 |

Orthogonal and quasi-upward drawings with vertices of prescribed size G Di Battista, W Didimo, M Patrignani, M Pizzonia Graph Drawing: 7th International Symposium, GD’99 Štiřín Castle, Czech …, 1999 | 74 | 1999 |

Upward spirality and upward planarity testing W Didimo, F Giordano, G Liotta SIAM Journal on Discrete Mathematics 23 (4), 1842-1899, 2010 | 70* | 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 | 68 | 2011 |

Recognizing and drawing IC-planar graphs FJ Brandenburg, W Didimo, WS Evans, P Kindermann, G Liotta, ... Theoretical Computer Science 636, 1-16, 2016 | 67 | 2016 |

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 | 64 | 2000 |

Density of straight-line 1-planar graph drawings W Didimo Information Processing Letters 113 (7), 236-240, 2013 | 62 | 2013 |

Quasi-upward planarity Bertolazzi, D Battista, Didimo Algorithmica 32, 474-506, 2002 | 62 | 2002 |

Planarization of clustered graphs G Di Battista, W Didimo, A Marcandalli Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria …, 2002 | 61 | 2002 |

The crossing-angle resolution in graph drawing W Didimo, G Liotta Thirty Essays on Geometric Graph Theory, 167-184, 2013 | 59 | 2013 |

Drawing graphs with right angle crossings W Didimo, P Eades, G Liotta Algorithms and Data Structures: 11th International Symposium, WADS 2009 …, 2009 | 59 | 2009 |

Fast layout computation of clustered networks: Algorithmic advances and experimental analysis W Didimo, F Montecchiani Information Sciences 260, 185-199, 2014 | 54 | 2014 |

Network visualization for financial crime detection W Didimo, G Liotta, F Montecchiani Journal of Visual Languages & Computing 25 (4), 433-451, 2014 | 53 | 2014 |

Fan-planarity: Properties and complexity C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ... Theoretical Computer Science 589, 76-86, 2015 | 52 | 2015 |