| 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 | 83 | 2015 |
| 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 | 68 | 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 | 64 | 2012 |
| 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 | 53 | 2017 |
| An Algorithm to Construct Greedy Drawings of Triangulations. P Angelini, F Frati, L Grilli J. Graph Algorithms Appl. 14 (1), 19-51, 2010 | 50 | 2010 |
| Advancements on SEFE and partitioned book embedding problems P Angelini, G Da Lozzo, D Neuwirth Theoretical Computer Science 575, 71-89, 2015 | 49* | 2015 |
| An algorithm to construct greedy drawings of triangulations P Angelini, F Frati, L Grilli International Symposium on Graph Drawing, 26-37, 2008 | 45 | 2008 |
| Monotone drawings of graphs P Angelini, E Colasante, G Di Battista, F Frati, M Patrignani Journal of Graph Algorithms and Applications 16 (1), 5-35, 2012 | 43 | 2012 |
| On the perspectives opened by right angle crossing drawings P Angelini, L Cittadini, W Didimo, F Frati, G Di Battista, M Kaufmann, ... Journal of Graph Algorithms and Applications 15 (1), 53-78, 2011 | 42 | 2011 |
| Intersection-link representations of graphs P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, I Rutter Journal of Graph Algorithms and Applications 21 (4), 731-755, 2017 | 38 | 2017 |
| Strip planarity testing for embedded planar graphs P Angelini, G Da Lozzo, G Di Battista, F Frati Algorithmica 77 (4), 1022-1059, 2017 | 37* | 2017 |
| 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 | 37 | 2015 |
| 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 | 37 | 2013 |
| Multi-level Steiner trees R Ahmed, P Angelini, FD Sahneh, A Efrat, D Glickenstein, M Gronemann, ... Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019 | 35 | 2019 |
| On a tree and a path with no geometric simultaneous embedding P Angelini, M Geyer, M Kaufmann, D Neuwirth Journal of Graph Algorithms and Applications 16 (1), 37-83, 2012 | 32 | 2012 |
| Beyond-planarity: Turán-type results for non-planar bipartite graphs P Angelini, MA Bekos, M Kaufmann, M Pfister, T Ueckerdt 29th International Symposium on Algorithms and Computation (ISAAC 2018), 28 …, 2018 | 30 | 2018 |
| 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 | 30 | 2014 |
| Simple k-planar graphs are simple (k+ 1)-quasiplanar P Angelini, MA Bekos, FJ Brandenburg, G Da Lozzo, G Di Battista, ... Journal of Combinatorial Theory, Series B 142, 1-35, 2020 | 29 | 2020 |
| 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 | 29 | 2015 |
| Succinct greedy drawings do not always exist P Angelini, G Di Battista, F Frati Networks 59 (3), 267-274, 2012 | 29 | 2012 |
Fabrizio FratiFull Professor, Roma Tre UniversityVerified email at dia.uniroma3.it
