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

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

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

Orthogonal and quasi-upward drawings with vertices of prescribed size G Di Battista, W Didimo, M Patrignani, M Pizzonia International Symposium on Graph Drawing, 297-310, 1999 | 64 | 1999 |

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

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

Quasi-upward planarity P Bertolazzi, G Di Battista, W Didimo Algorithmica 32 (3), 474-506, 2002 | 52 | 2002 |

Network and Parallel Computing W DIDIMO, M PATRIGNANI vol 5727, 24, 2009 | 50 | 2009 |

Planarization of clustered graphs G Di Battista, W Didimo, A Marcandalli International Symposium on Graph Drawing, 60-74, 2001 | 50 | 2001 |

Drawing graphs with right angle crossings W Didimo, P Eades, G Liotta Workshop on Algorithms and Data Structures, 206-217, 2009 | 49 | 2009 |

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

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

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

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

Computing orthogonal drawings with the minimum number of bends P Bertolazzi, G Di Battista, W Didimo Workshop on Algorithms and Data Structures, 331-344, 1997 | 40 | 1997 |

Upward spirality and upward planarity testing W Didimo, F Giordano, G Liotta SIAM Journal on Discrete Mathematics 23 (4), 1842-1899, 2009 | 38* | 2009 |

Topology-driven force-directed algorithms W Didimo, G Liotta, SA Romeo International Symposium on Graph Drawing, 165-176, 2010 | 32 | 2010 |

A characterization of complete bipartite RAC graphs W Didimo, P Eades, G Liotta Information Processing Letters 110 (16), 687-691, 2010 | 32 | 2010 |

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 | 31* | 2015 |

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 | 30 | 2011 |