Patrizio Angelini's Publications

Patrizio Angelini

Home

Research groups:
  Graph Drawing

Publications:
  By type
  By year
  By topic

Teaching:
  Courses (Italian)
  Theses & Labs


Best Paper Award


42nd International Conference on Current Trends in Theory and Practice of Computer Science.
Harrachov, Czech Republic
Jan 23-28, 2016

We will be at


12nd Bertinoro Workshop on Graph Drawing

March 05-10, 2017

Show all news

Patrizio Angelini's Publications

Morphing Graph Drawings

  1. Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson. How to morph planar graph drawings. SIAM Journal on Computing. 46(2):824-852. 2017. [arXiv version]

  2. Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson. How to morph planar graph drawings. Technical Report arXiv:1606.00425, Cornell University, 2016.

  3. Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli. Optimal Morphs of Convex Drawings. In, Lars Arge, J\'anos Pach, editors, Proc. 31st Symposium on Computational Geometry (SoCG '15), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, volume 34 of LIPIcs, pages 126-140, 2015.

  4. Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani and Vincenzo Roselli. Optimal Morphs of Convex Drawings. Technical Report arXiv:1503.09021, Cornell University, 2015.

  5. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani and Vincenzo Roselli. Morphing Planar Graph Drawings Optimally. In Proc. 41st International Colloquium on Automata, Languages and Programming (ICALP '14), Springer Verlag, volume 8572 of Lecture Notes in Computer Science, pages 126-137, 2014.

  6. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani and Vincenzo Roselli. Morphing Planar Graph Drawings Optimally. Technical Report arXiv:1402.4364, Cornell University, 2014.

  7. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. Topological Morphing of Planar Graphs. Theor. Computer Science. 514:2-20. 2013.

  8. Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Morphing Planar Graph Drawings Efficiently. In, Stephen Wismath, Alexander Wolff, editors, Proc. 21st International Symposium on Graph Drawing (GD '13), Springer-Verlag, volume 8242 of Lecture Notes in Computer Science, pages 49-60, 2013. [ presentation at GD'13]

  9. Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Morphing Planar Graph Drawings Efficiently. Technical Report arXiv:1308.4291, Cornell University, 2013.

  10. Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson. Morphing Planar Graph Drawings with a Polynomial Number of Steps. In 24th ACM-SIAM Symposium on Discrete Algorithms (SODA '13), pages 1656-1667, 2013. [ presentation at SODA'13]

  11. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. Topological Morphing of Planar Graphs. Technical Report RT-DIA-134-2008, Dept. of Computer Science and Automation, Roma Tre University, 2008. [conference version]

  12. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. Topological Morphing of Planar Graphs. In, Ioannis G. Tollis, Maurizio Patrignani, editors, 16th International Symposium on Graph Drawing (GD '08), Springer-Verlag, volume 5417 of Lecture Notes in Computer Science, pages 145-156, 2009. [see TR]

Clustered Graphs

  1. Patrizio Angelini, Giordano Da Lozzo. Clustered Planarity with Pipes. In, Seok-Hee Hong, Peter Eades, Amyra Meidiana, editors, Proc. 27th International Symposium on Algorithms and Computation (ISAAC '16), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, volume 64 of LIPIcs, pages 13:1-13:13, 2016.

  2. Patrizio Angelini, Giordano Da Lozzo. Clustered Planarity with Pipes. Technical Report arXiv:1609.09679, Cornell University, 2016.

  3. Patrizio Angelini, Giordano Da Lozzo. SEFE = C-Planarity?. The Computer Journal. 59(12):1831-1838. 2016.

  4. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing for Embedded Planar Graphs. Algorithmica. 77(4):1022-1059. 2017.

  5. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Intersection-Link Representations of Graphs. Technical Report arXiv:1508.07557, Cornell University, 2015.

  6. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity. Theoretical Computer Science. 571:1-9. 2015.

  7. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity). In, Christian Duncan, Antonios Symvonis, editors, Proc. 22nd International Symposium on Graph Drawing (GD '14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 246-258, 2014. [ presentation at GD'14]

  8. Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli. Anchored Drawings of Planar Graphs. In, Christian Duncan, Antonios Symvonis, editors, Proc. 22nd International Symposium on Graph Drawing (GD '14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 404-415, 2014. [ presentation at GD'14]

  9. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Relaxing the Constraints of Clustered Planarity. Computational Geometry: Theory and Applications. 48(2):42-75. 2015.

  10. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. On the Complexity of Clustered-Level Planarity and T-Level Planarity. Technical Report arXiv:1406.6533, Cornell University, 2014.

  11. Patrizio Angelini, Giordano Da Lozzo. SEFE = C-Planarity?. 9th International Colloquium on Graph Theory and Combinatorics (ICGT '14). 2014.

  12. Patrizio Angelini, Giordano Da Lozzo. Deepening the Relationship between SEFE and C-Planarity. Technical Report arXiv:1404.6175, Cornell University, 2014.

  13. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing. In, Stephen Wismath, Alexander Wolff, editors, Proc. 21st International Symposium on Graph Drawing (GD '13), Springer-Verlag, volume 8242 of Lecture Notes in Computer Science, pages 37-48, 2013.

  14. Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista. Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. In, Walter Didimo, Maurizio Patrignani, editors, 20th International Symposium on Graph Drawing (GD '12), Springer-Verlag, volume 7704 of Lecture Notes in Computer Science, pages 79-89, 2013.

  15. Patrizio Angelini, Giordano Da Lozzo and Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Relaxing the Constraints of Clustered Planarity . Technical Report arXiv:1207.3934, Cornell University, 2012.

  16. Patrizio Angelini, Fabrizio Frati, Michael Kaufmann. Straight-line Rectangular Drawings of Clustered Graphs. Discrete and Computational Geometry. 45(1):88-140. 2011.

  17. Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani. Splitting Clusters To Get C-Planarity. In, David Eppstein, Emden R. Gansner, editors, 17th International Symposium on Graph Drawing (GD '09), Springer-Verlag, volume 5849 of Lecture Notes in Computer Science, pages 57-68, 2010.

  18. Patrizio Angelini, Fabrizio Frati, Michael Kaufmann. Straight-line Rectangular Drawings of Clustered Graphs. In, F. K. H. A. Dehne, M. L. Gavrilova, J.-R. Sack, C. Toth, editors, 11th Algorithms and Data Structures Symposium (WADS '09), Springer-Verlag, volume 5664 of Lecture Notes in Computer Science, pages 25-36, 2009.

  19. Patrizio Angelini, Fabrizio Frati, Michael Kaufmann. Straight-line Rectangular Drawings of Clustered Graphs. Technical Report RT-DIA-144-2009, Dept. of Computer Science and Automation, Roma Tre University, 2009.

Orthogonal Drawings

  1. Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvìl, Fabian Lipp, Ignaz Rutter. Simultaneous Orthogonal Planarity. In, Martin Nöllenburg, Yifan Hu, editors, Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), Springer-Verlag, volume 9801 of Lecture Notes in Computer Science, pages 532-545, 2016.

  2. Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvìl, Fabian Lipp, Ignaz Rutter. Simultaneous Orthogonal Planarity. Technical Report arXiv:1608.08427, Cornell University, 2016.

Clustered Planarity

  1. Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli. Anchored Drawings of Planar Graphs. In, Christian Duncan, Antonios Symvonis, editors, Proc. 22nd International Symposium on Graph Drawing (GD '14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 404-415, 2014. [ presentation at GD'14]

  2. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Relaxing the Constraints of Clustered Planarity. Computational Geometry: Theory and Applications. 48(2):42-75. 2015.

  3. Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista. Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. In, Walter Didimo, Maurizio Patrignani, editors, 20th International Symposium on Graph Drawing (GD '12), Springer-Verlag, volume 7704 of Lecture Notes in Computer Science, pages 79-89, 2013.

  4. Patrizio Angelini, Giordano Da Lozzo and Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Relaxing the Constraints of Clustered Planarity . Technical Report arXiv:1207.3934, Cornell University, 2012.

  5. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected or a Connected Graph. Journal of Discrete Algorithms. 14:150-172. 2012.

  6. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Simultaneous Embedding of Embedded Planar Graphs. In, T. Asano, Y. Okamoto, O. Watanabe, editors, 22nd International Symposium on Algorithms and Computation (ISAAC '11), Springer-Verlag, volume 7074 of Lecture Notes in Computer Science, pages 271-280, 2011.

  7. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings Do Not Always Exist. Networks. 59(3):267-274. 2012.

  8. Patrizio Angelini, Fabrizio Frati, Michael Kaufmann. Straight-line Rectangular Drawings of Clustered Graphs. Discrete and Computational Geometry. 45(1):88-140. 2011.

Planarity and Planar Graphs

  1. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Intersection-Link Representations of Graphs. Journal of Graph Algorithms and Applications. 21(4):731-755. 2017.

  2. Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter. On the Relationship between k-Planar and k-Quasi Planar Graphs. In 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Eindhoven, The Netherlands, June 21-23, 2017, 2017. To appear.

  3. Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter. On the Relationship between k-Planar and k-Quasi Planar Graphs. In (Informal) Proceedings of the 33rd European Workshop on Computational Geometry, Malmo, Sweden, April 5-7, 2017, 2017. To appear.

  4. Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson. How to morph planar graph drawings. SIAM Journal on Computing. 46(2):824-852. 2017. [arXiv version]

  5. Patrizio Angelini, Giordano Da Lozzo. Clustered Planarity with Pipes. In, Seok-Hee Hong, Peter Eades, Amyra Meidiana, editors, Proc. 27th International Symposium on Algorithms and Computation (ISAAC '16), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, volume 64 of LIPIcs, pages 13:1-13:13, 2016.

  6. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Beyond Level Planarity. In, Martin Nöllenburg, Yifan Hu, editors, Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), Springer International Publishing, volume 9801 of Lecture Notes in Computer Science, pages 482-495, 2016.

  7. Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvìl, Fabian Lipp, Ignaz Rutter. Simultaneous Orthogonal Planarity. In, Martin Nöllenburg, Yifan Hu, editors, Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), Springer-Verlag, volume 9801 of Lecture Notes in Computer Science, pages 532-545, 2016.

  8. Patrizio Angelini, Giordano Da Lozzo. Clustered Planarity with Pipes. Technical Report arXiv:1609.09679, Cornell University, 2016.

  9. Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvìl, Fabian Lipp, Ignaz Rutter. Simultaneous Orthogonal Planarity. Technical Report arXiv:1608.08427, Cornell University, 2016.

  10. Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson. How to morph planar graph drawings. Technical Report arXiv:1606.00425, Cornell University, 2016.

  11. Patrizio Angelini, Giordano Da Lozzo. SEFE = C-Planarity?. The Computer Journal. 59(12):1831-1838. 2016.

  12. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing for Embedded Planar Graphs. Algorithmica. 77(4):1022-1059. 2017.

  13. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Beyond Level Planarity. Technical Report arXiv:1510.08274, Cornell University, 2015.

  14. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Guenter Rote, Ignaz Rutter. Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. Technical Report arXiv:1510.02659, Cornell University, 2015.

  15. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Gunter Rote, Ignaz Rutter. Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. In, Robert Krauthgamer, editor, Proc. 27th ACM-SIAM Symposium on Discrete Algorithms (SODA '16), ACM-SIAM, pages 985-996, 2016.

  16. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Intersection-Link Representations of Graphs. In, Emilio Di Giacomo, Anna Lubiw, editors, Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD '15), Springer-Verlag, volume 9411 of Lecture Notes in Computer Science, pages 217-230, 2015. [ presentation at GD'15]


  17. book coverPatrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
    On the Relationship between Map Graphs and Clique Planar Graphs
    In, Emilio Di Giacomo, Anna Lubiw, editors
    Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD '15)
    Springer-Verlag
    volume 9411 of Lecture Notes in Computer Science
    pages 548-550, 2015. Poster. [ presentation at GD'15] [best poster award at GD'15]

  18. Patrizio Angelini. Monotone Drawings of Graphs with Few Directions. In Proc. 6th International Conference on Information, Intelligence, Systems, and Applications (IISA '15), 2015. Special session on Graph and Network Visualization. To appear.

  19. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Intersection-Link Representations of Graphs. Technical Report arXiv:1508.07557, Cornell University, 2015.

  20. Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis. L-Drawings of Directed Graphs. Technical Report arXiv:1509.00684, Cornell University, 2015.

  21. Patrizio Angelini, Thomas Blasius, Ignaz Rutter. Testing Mutual Duality of Planar Graphs. International Journal on Computational Geometry and Applications. 24(4):325-346. 2015. Special Issue on selected papers from ISAAC 2013.

  22. Patrizio Angelini, Walter Didimo, Stephen Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen Wismath. Monotone Drawings of Graphs with Fixed Embedding. Algorithmica. 71(2):233-257. 2015.

  23. Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson. SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. Journal of Graph Theory. 2015. In print.

  24. Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli. Optimal Morphs of Convex Drawings. In, Lars Arge, J\'anos Pach, editors, Proc. 31st Symposium on Computational Geometry (SoCG '15), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, volume 34 of LIPIcs, pages 126-140, 2015.

  25. Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani and Vincenzo Roselli. Optimal Morphs of Convex Drawings. Technical Report arXiv:1503.09021, Cornell University, 2015.

  26. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity. Theoretical Computer Science. 571:1-9. 2015.

  27. Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth. Advancements on SEFE and Partitioned Book Embedding Problems. Theoretical Computer Science. 575:71-89. 2014. Special Issue on Selected Papers from WALCOM '14.

  28. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity). In, Christian Duncan, Antonios Symvonis, editors, Proc. 22nd International Symposium on Graph Drawing (GD '14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 246-258, 2014. [ presentation at GD'14]

  29. Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli. Anchored Drawings of Planar Graphs. In, Christian Duncan, Antonios Symvonis, editors, Proc. 22nd International Symposium on Graph Drawing (GD '14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 404-415, 2014. [ presentation at GD'14]

  30. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Relaxing the Constraints of Clustered Planarity. Computational Geometry: Theory and Applications. 48(2):42-75. 2015.

  31. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. On the Complexity of Clustered-Level Planarity and T-Level Planarity. Technical Report arXiv:1406.6533, Cornell University, 2014.

  32. Patrizio Angelini, Giordano Da Lozzo. SEFE = C-Planarity?. 9th International Colloquium on Graph Theory and Combinatorics (ICGT '14). 2014.

  33. Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff. Universal Point Sets for Planar Graph Drawings with Circular Arcs. Journal of Graph Algorithms and Applications. 18(3):313-324. 2014.

  34. Patrizio Angelini, Giordano Da Lozzo. Deepening the Relationship between SEFE and C-Planarity. Technical Report arXiv:1404.6175, Cornell University, 2014.

  35. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vìt Jelìnek, Jan Kratochvìl, Maurizio Patrignani, Ignaz Rutter. Testing Planarity of Partially Embedded Graphs. ACM Transactions on Algorithms. 11(4). 2015. Article No. 32.

  36. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani and Vincenzo Roselli. Morphing Planar Graph Drawings Optimally. In Proc. 41st International Colloquium on Automata, Languages and Programming (ICALP '14), Springer Verlag, volume 8572 of Lecture Notes in Computer Science, pages 126-137, 2014.

  37. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani and Vincenzo Roselli. Morphing Planar Graph Drawings Optimally. Technical Report arXiv:1402.4364, Cornell University, 2014.

  38. Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth. Advancements on SEFE and Partitioned Book Embedding Problems. Technical Report arXiv:1311.3607, Cornell University, 2014.

  39. Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth. On some NP-complete SEFE Problems. In, Sudebkumar Pal, Kunihiko Sadakane, editors, Workshop on Algorithms and Computation (WALCOM'14), Springer-Verlag, volume 8344 of Lecture Notes in Computer Science, pages 193-205, 2014.

  40. Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson. SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. In, L. Cai, S. Cheng, T. Lam, editors, Proc. 24th International Symposium on Algorithms and Computation (ISAAC 2013), Springer-Verlag, volume 8283 of Lecture Notes in Computer Science, pages 185-195, 2013.

  41. Patrizio Angelini, Thomas Blasius, Ignaz Rutter. Testing Mutual Duality of Planar Graphs. In, L. Cai, S. Cheng, T. Lam, editors, Proc. 24th International Symposium on Algorithms and Computation (ISAAC 2013), Springer-Verlag, volume 8283 of Lecture Notes in Computer Science, pages 350-360, 2013.

  42. Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani and Maurizio Patrignani, Ioannis Tollis. Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs. Technical Report arXiv:1308.6706, Cornell University, 2013.

  43. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. Topological Morphing of Planar Graphs. Theor. Computer Science. 514:2-20. 2013.

  44. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing. In, Stephen Wismath, Alexander Wolff, editors, Proc. 21st International Symposium on Graph Drawing (GD '13), Springer-Verlag, volume 8242 of Lecture Notes in Computer Science, pages 37-48, 2013.

  45. Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis Tollis. Drawing Non-planar Graphs with Crossing-free Subgraphs. In, Stephen Wismath, Alexander Wolff, editors, Proc. 21st International Symposium on Graph Drawing (GD '13), Springer-Verlag, volume 8242 of Lecture Notes in Computer Science, pages 295-307, 2013. [ presentation at GD'13]

  46. Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Morphing Planar Graph Drawings Efficiently. In, Stephen Wismath, Alexander Wolff, editors, Proc. 21st International Symposium on Graph Drawing (GD '13), Springer-Verlag, volume 8242 of Lecture Notes in Computer Science, pages 49-60, 2013. [ presentation at GD'13]

  47. Patrizio Angelini, Giordano Da Lozzo and Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing of Embedded Planar Graphs. Technical Report arXiv:1309.0683, Cornell University, 2013.

  48. Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. Morphing Planar Graph Drawings Efficiently. Technical Report arXiv:1308.4291, Cornell University, 2013.

  49. Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson. Morphing Planar Graph Drawings with a Polynomial Number of Steps. In 24th ACM-SIAM Symposium on Discrete Algorithms (SODA '13), pages 1656-1667, 2013. [ presentation at SODA'13]

  50. Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto. Universal Point Subsets for Planar Graphs. In, K.M. Chao, T. s. Hsu, D.T. Lee, editors, Proc. 23rd International Symposium on Algorithms and Computation (ISAAC 2012), Springer-Verlag, volume 7676 of Lecture Notes in Computer Science, pages 423-432, 2012.

  51. Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista. Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. In, Walter Didimo, Maurizio Patrignani, editors, 20th International Symposium on Graph Drawing (GD '12), Springer-Verlag, volume 7704 of Lecture Notes in Computer Science, pages 79-89, 2013.

  52. Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Monotone Drawings of Graphs. Journal of Graph Algorithms and Applications. 16(1):5-35. 2012. Special Issue on Selected Papers from GD '10. [ download pdf]

  53. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected or a Connected Graph. Journal of Discrete Algorithms. 14:150-172. 2012.

  54. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Simultaneous Embedding of Embedded Planar Graphs. In, T. Asano, Y. Okamoto, O. Watanabe, editors, 22nd International Symposium on Algorithms and Computation (ISAAC '11), Springer-Verlag, volume 7074 of Lecture Notes in Computer Science, pages 271-280, 2011.

  55. Patrizio Angelini, Walter Didimo, Stephen Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen Wismath. Monotone Drawings of Graphs with Fixed Embedding. In 19th International Symposium on Graph Drawing (GD '11), Springer-Verlag, Lecture Notes in Computer Science, pages 379-390, 2012.

  56. Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella. Small Point Sets for Simply-Nested Planar Graphs. In 19th International Symposium on Graph Drawing (GD '11), Springer-Verlag, Lecture Notes in Computer Science, pages 75-85, 2012.

  57. Patrizio Angelini, Fabrizio Frati, Michael Kaufmann. Straight-line Rectangular Drawings of Clustered Graphs. Discrete and Computational Geometry. 45(1):88-140. 2011.

  58. Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Monotone Drawings of Graphs. In, U. Brandes, S. Cornelsen, editors, 18th International Symposium on Graph Drawing (GD '10), Springer-Verlag, volume 6502 of Lecture Notes in Computer Science, pages 13-24, 2011. [ Slides (PPT)]

  59. Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth. On a Tree and a Path with no Geometric Simultaneous Embedding. In, U. Brandes, S. Cornelsen, editors, 18th International Symposium on Graph Drawing (GD '10), Springer-Verlag, volume 6502 of Lecture Notes in Computer Science, pages 38-49, 2011.

  60. Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis. Upward Geometric Graph Embeddings into Point Sets. In, U. Brandes, S. Cornelsen, editors, 18th International Symposium on Graph Drawing (GD '10), Springer-Verlag, volume 6502 of Lecture Notes in Computer Science, pages 25-37, 2011.

  61. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree. In Workshop on Combinatorial Algorithms (IWOCA '10), Springer-Verlag, volume 6460 of Lecture Notes in Computer Science, pages 212-225, 2011.

  62. Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Monotone Drawings of Graphs. Technical Report RT-DIA-178-2010, Dept. of Computer Science and Automation, Roma Tre University, 2010.

  63. Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth. On a Tree and a Path with no Geometric Simultaneous Embedding. Technical Report RT-DIA-176-2010, Dept. of Computer Science and Automation, Roma Tre University, 2010.

  64. Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis. Upward Geometric Graph Embeddings into Point Sets. Technical Report RT-DIA-177-2010, Dept. of Computer Science and Automation, Roma Tre University, 2010.

  65. Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani. Finding a Minimum-Depth Embedding of a Planar Graph in O(n^4) Time. Algorithmica. 60(4):890-937. 2011.

  66. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vìt Jelìnek, Jan Kratochvìl, Maurizio Patrignani, Ignaz Rutter. Testing Planarity of Partially Embedded Graphs. In, M. Charikar, editor, Symposium On Discrete Algorithms (SODA '10), ACM-SIAM, pages 202-221, 2010.

  67. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings May Be Unfeasible. Technical Report RT-DIA-148-2009, Dept. of Computer Science and Automation, University of Roma Tre, 2009.

  68. Patrizio Angelini, Fabrizio Frati. Acyclically 3-Colorable Planar Graphs. Technical Report RT-DIA-147-2009, Dept. of Computer Science and Automation, University of Roma Tre, 2009.

  69. Patrizio Angelini, Fabrizio Frati, Michael Kaufmann. Straight-line Rectangular Drawings of Clustered Graphs. In, F. K. H. A. Dehne, M. L. Gavrilova, J.-R. Sack, C. Toth, editors, 11th Algorithms and Data Structures Symposium (WADS '09), Springer-Verlag, volume 5664 of Lecture Notes in Computer Science, pages 25-36, 2009.

  70. Patrizio Angelini, Fabrizio Frati, Michael Kaufmann. Straight-line Rectangular Drawings of Clustered Graphs. Technical Report RT-DIA-144-2009, Dept. of Computer Science and Automation, Roma Tre University, 2009.

  71. Patrizio Angelini, Fabrizio Frati, Luca Grilli. An Algorithm to Construct Greedy Drawings of Triangulations. Technical Report RT-DIA-140-2009, Dept. of Computer Science and Automation, Roma Tre University, 2009.

  72. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. Topological Morphing of Planar Graphs. Technical Report RT-DIA-134-2008, Dept. of Computer Science and Automation, Roma Tre University, 2008. [conference version]

  73. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. Topological Morphing of Planar Graphs. In, Ioannis G. Tollis, Maurizio Patrignani, editors, 16th International Symposium on Graph Drawing (GD '08), Springer-Verlag, volume 5417 of Lecture Notes in Computer Science, pages 145-156, 2009. [see TR]

  74. Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani. Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time. In, Frank Dehne, Joerg-Ruediger Sack, Norbert Zeh, editors, 10th Workshop on Algorithms and Data Structures (WADS '07), Springer-Verlag, volume 4619 of Lecture Notes in Computer Science, pages 287-299, 2007. [see TR]

  75. Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani. Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time. Technical Report RT-DIA-116-2007, Dept. of Computer Science and Automation, University of Roma Tre, 2007. [conference version]

Minimum Size Representations of Graphs

  1. Patrizio Angelini, Walter Didimo, Stephen Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen Wismath. Monotone Drawings of Graphs with Fixed Embedding. Algorithmica. 71(2):233-257. 2015.

  2. Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff. Universal Point Sets for Planar Graph Drawings with Circular Arcs. Journal of Graph Algorithms and Applications. 18(3):313-324. 2014.

  3. Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff. Universal Point Sets for Planar Graph Drawings with Circular Arcs. In 25st Canadian Conference on Computational Geometry (CCCG '13), 2013.

  4. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Computational Geometry: Theory and Applications. 47(2):200-213. 2014. Special Issue on Selected Papers from WADS '11.

  5. Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw. Large angle crossing drawings of planar graphs in subquadratic area. In, A. Marquez, P. Ramos, J. Urrutia, editors, Special Festschrift, volume 7579 of Lecture Notes in Computer Science, Springer-Verlag, pages 200-209, 2012.

  6. Patrizio Angelini, Walter Didimo, Stephen Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen Wismath. Monotone Drawings of Graphs with Fixed Embedding. In 19th International Symposium on Graph Drawing (GD '11), Springer-Verlag, Lecture Notes in Computer Science, pages 379-390, 2012.

  7. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings Do Not Always Exist. Networks. 59(3):267-274. 2012.

  8. Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw. RAC and LAC drawings of planar graphs in subquadratic area. In, P. Ramos, V. Sacristan, editors, 14th Spanish Meeting on Computational Geometry (EGC '11), Centre de Recerca Matematica, volume 8 of Documents, pages 125-128, 2011.

  9. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. In, F. K. H. A. Dehne, J. Iacono, J.-R. Sack, editors, 12th Algorithms and Data Structures Symposium (WADS '11), Springer, volume 6844 of Lecture Notes in Computer Science, pages 25-36, 2011.

  10. Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Monotone Drawings of Graphs. In, U. Brandes, S. Cornelsen, editors, 18th International Symposium on Graph Drawing (GD '10), Springer-Verlag, volume 6502 of Lecture Notes in Computer Science, pages 13-24, 2011. [ Slides (PPT)]

  11. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Technical Report RT-DIA-183-2011, Dept. of Computer Science and Automation, Roma Tre University, 2011.

  12. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings Do Not Always Exist. In, David Eppstein, Emden R. Gansner, editors, 17th International Symposium on Graph Drawing (GD '09), Springer-Verlag, volume 5849 of Lecture Notes in Computer Science, pages 171-182, 2010.

  13. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings May Be Unfeasible. Technical Report RT-DIA-148-2009, Dept. of Computer Science and Automation, University of Roma Tre, 2009.

Proximity Drawings

  1. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Computational Geometry: Theory and Applications. 47(2):200-213. 2014. Special Issue on Selected Papers from WADS '11.

  2. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings Do Not Always Exist. Networks. 59(3):267-274. 2012.

  3. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. In, F. K. H. A. Dehne, J. Iacono, J.-R. Sack, editors, 12th Algorithms and Data Structures Symposium (WADS '11), Springer, volume 6844 of Lecture Notes in Computer Science, pages 25-36, 2011.

  4. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Technical Report RT-DIA-183-2011, Dept. of Computer Science and Automation, Roma Tre University, 2011.

  5. Patrizio Angelini, Fabrizio Frati, Luca Grilli. An Algorithm to Construct Greedy Drawings of Triangulations. Journal of Graph Algorithms and Applications. 14(1):19-51. 2010. Special Issue on Selected Papers from GD '08. [ download pdf]

  6. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings Do Not Always Exist. In, David Eppstein, Emden R. Gansner, editors, 17th International Symposium on Graph Drawing (GD '09), Springer-Verlag, volume 5849 of Lecture Notes in Computer Science, pages 171-182, 2010.

  7. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings May Be Unfeasible. Technical Report RT-DIA-148-2009, Dept. of Computer Science and Automation, University of Roma Tre, 2009.

  8. Patrizio Angelini, Fabrizio Frati, Luca Grilli. An Algorithm to Construct Greedy Drawings of Triangulations. Technical Report RT-DIA-140-2009, Dept. of Computer Science and Automation, Roma Tre University, 2009.

  9. Patrizio Angelini, Fabrizio Frati, Luca Grilli. An Algorithm to Construct Greedy Drawings of Triangulations. In, I. G. Tollis, M. Patrignani, editors, 16th International Symposium on Graph Drawing (GD '08), Springer-Verlag, volume 5417 of Lecture Notes in Computer Science, pages 26-37, 2009.

Simultaneous Information Visualization

  1. Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvìl, Fabian Lipp, Ignaz Rutter. Simultaneous Orthogonal Planarity. In, Martin Nöllenburg, Yifan Hu, editors, Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), Springer-Verlag, volume 9801 of Lecture Notes in Computer Science, pages 532-545, 2016.

  2. Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvìl, Fabian Lipp, Ignaz Rutter. Simultaneous Orthogonal Planarity. Technical Report arXiv:1608.08427, Cornell University, 2016.

  3. Patrizio Angelini, Giordano Da Lozzo. SEFE = C-Planarity?. The Computer Journal. 59(12):1831-1838. 2016.

  4. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Beyond Level Planarity. Technical Report arXiv:1510.08274, Cornell University, 2015.

  5. Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson. SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. Journal of Graph Theory. 2015. In print.

  6. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity. Theoretical Computer Science. 571:1-9. 2015.

  7. Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth. Advancements on SEFE and Partitioned Book Embedding Problems. Theoretical Computer Science. 575:71-89. 2014. Special Issue on Selected Papers from WALCOM '14.

  8. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity). In, Christian Duncan, Antonios Symvonis, editors, Proc. 22nd International Symposium on Graph Drawing (GD '14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 246-258, 2014. [ presentation at GD'14]

  9. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. On the Complexity of Clustered-Level Planarity and T-Level Planarity. Technical Report arXiv:1406.6533, Cornell University, 2014.

  10. Patrizio Angelini, Giordano Da Lozzo. SEFE = C-Planarity?. 9th International Colloquium on Graph Theory and Combinatorics (ICGT '14). 2014.

  11. Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth. Advancements on SEFE and Partitioned Book Embedding Problems. Technical Report arXiv:1311.3607, Cornell University, 2014.

  12. Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth. On some NP-complete SEFE Problems. In, Sudebkumar Pal, Kunihiko Sadakane, editors, Workshop on Algorithms and Computation (WALCOM'14), Springer-Verlag, volume 8344 of Lecture Notes in Computer Science, pages 193-205, 2014.

  13. Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson. SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. In, L. Cai, S. Cheng, T. Lam, editors, Proc. 24th International Symposium on Algorithms and Computation (ISAAC 2013), Springer-Verlag, volume 8283 of Lecture Notes in Computer Science, pages 185-195, 2013.

  14. Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff. Universal Point Sets for Planar Graph Drawings with Circular Arcs. In 25st Canadian Conference on Computational Geometry (CCCG '13), 2013.

  15. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Simultaneous Embedding of Embedded Planar Graphs. International Journal on Computational Geometry and Applications. 23(2):93-126. 2013. Special Issue on Selected Papers from ISAAC '11.

  16. Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth. On a Tree and a Path with no Geometric Simultaneous Embedding. Journal of Graph Algorithms and Applications. 16(1):37-83. 2012. Special Issue on Selected Papers from GD '10.

  17. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected or a Connected Graph. Journal of Discrete Algorithms. 14:150-172. 2012.

  18. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Simultaneous Embedding of Embedded Planar Graphs. In, T. Asano, Y. Okamoto, O. Watanabe, editors, 22nd International Symposium on Algorithms and Computation (ISAAC '11), Springer-Verlag, volume 7074 of Lecture Notes in Computer Science, pages 271-280, 2011.

  19. Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth. On a Tree and a Path with no Geometric Simultaneous Embedding. In, U. Brandes, S. Cornelsen, editors, 18th International Symposium on Graph Drawing (GD '10), Springer-Verlag, volume 6502 of Lecture Notes in Computer Science, pages 38-49, 2011.

  20. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree. In Workshop on Combinatorial Algorithms (IWOCA '10), Springer-Verlag, volume 6460 of Lecture Notes in Computer Science, pages 212-225, 2011.

  21. Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth. On a Tree and a Path with no Geometric Simultaneous Embedding. Technical Report RT-DIA-176-2010, Dept. of Computer Science and Automation, Roma Tre University, 2010.

  22. Patrizio Angelini, Markus Geyer and Michael Kaufmann, Daniel Neuwirth. On a Tree and a Path with no Geometric Simultaneous Embedding. Technical Report arXiv:1001.0555, Cornell University, 2010.

Upward Planarity

  1. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing for Embedded Planar Graphs. Algorithmica. 77(4):1022-1059. 2017.

  2. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Guenter Rote, Ignaz Rutter. Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. Technical Report arXiv:1510.02659, Cornell University, 2015.

  3. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing. In, Stephen Wismath, Alexander Wolff, editors, Proc. 21st International Symposium on Graph Drawing (GD '13), Springer-Verlag, volume 8242 of Lecture Notes in Computer Science, pages 37-48, 2013.

  4. Patrizio Angelini, Giordano Da Lozzo and Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing of Embedded Planar Graphs. Technical Report arXiv:1309.0683, Cornell University, 2013.

  5. Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis. Upward Geometric Graph Embeddings into Point Sets. In, U. Brandes, S. Cornelsen, editors, 18th International Symposium on Graph Drawing (GD '10), Springer-Verlag, volume 6502 of Lecture Notes in Computer Science, pages 25-37, 2011.

  6. Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis. Upward Geometric Graph Embeddings into Point Sets. Technical Report RT-DIA-177-2010, Dept. of Computer Science and Automation, Roma Tre University, 2010.