Testing planarity of partially embedded graphs P Angelini, GD Battista, F Frati, V Jelínek, J Kratochvíl, M Patrignani, ... Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 65 | 2010 |

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph P Angelini, G Di Battista, F Frati, M Patrignani, I Rutter Journal of Discrete Algorithms 14, 150-172, 2012 | 53 | 2012 |

Testing planarity of partially embedded graphs P Angelini, G Di Battista, F Frati, V Jelínek, J Kratochvíl, M Patrignani, ... ACM Transactions on Algorithms (TALG) 11 (4), 1-42, 2015 | 52 | 2015 |

Monotone drawings of graphs P Angelini, E Colasante, G Di Battista, F Frati, M Patrignani International Symposium on Graph Drawing, 13-24, 2010 | 47 | 2010 |

An Algorithm to Construct Greedy Drawings of Triangulations. P Angelini, F Frati, L Grilli J. Graph Algorithms Appl. 14 (1), 19-51, 2010 | 45 | 2010 |

On a tree and a path with no geometric simultaneous embedding P Angelini, M Geyer, M Kaufmann, D Neuwirth International Symposium on Graph Drawing, 38-49, 2010 | 44 | 2010 |

An algorithm to construct greedy drawings of triangulations P Angelini, F Frati, L Grilli International Symposium on Graph Drawing, 26-37, 2008 | 43 | 2008 |

How to morph planar graph drawings S Alamdari, P Angelini, F Barrera-Cruz, TM Chan, GD Lozzo, GD Battista, ... SIAM Journal on Computing 46 (2), 824-852, 2017 | 37 | 2017 |

Morphing planar graph drawings with a polynomial number of steps S Alamdari, P Angelini, TM Chan, G Di Battista, F Frati, A Lubiw, ... Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013 | 34 | 2013 |

Advancements on SEFE and partitioned book embedding problems P Angelini, G Da Lozzo, D Neuwirth Theoretical Computer Science 575, 71-89, 2015 | 32* | 2015 |

Strip planarity testing for embedded planar graphs P Angelini, G Da Lozzo, G Di Battista, F Frati Algorithmica 77 (4), 1022-1059, 2017 | 31* | 2017 |

On the Perspectives Opened by Right Angle Crossing Drawings. P Angelini, L Cittadini, W Didimo, F Frati, G Di Battista, M Kaufmann, ... J. Graph Algorithms Appl. 15 (1), 53-78, 2011 | 31 | 2011 |

Morphing planar graph drawings optimally P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli International Colloquium on Automata, Languages, and Programming, 126-137, 2014 | 28 | 2014 |

The importance of being proper:(in clustered-level planarity and T-level planarity) P Angelini, G Da Lozzo, G Di Battista, F Frati, V Roselli Theoretical Computer Science 571, 1-9, 2015 | 27 | 2015 |

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 | 27 | 2015 |

Succinct greedy drawings do not always exist P Angelini, G Di Battista, F Frati Networks 59 (3), 267-274, 2012 | 27 | 2012 |

On the perspectives opened by right angle crossing drawings P Angelini, L Cittadini, G Di Battista, W Didimo, F Frati, M Kaufmann, ... International Symposium on Graph Drawing, 21-32, 2009 | 25 | 2009 |

Intersection-Link Representations of Graphs. P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, I Rutter J. Graph Algorithms Appl. 21 (4), 731-755, 2017 | 22 | 2017 |

Relaxing the constraints of clustered planarity P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, V Roselli Computational Geometry 48 (2), 42-75, 2015 | 22 | 2015 |

Morphing planar graph drawings efficiently P Angelini, F Frati, M Patrignani, V Roselli International Symposium on Graph Drawing, 49-60, 2013 | 22 | 2013 |