Publications by the Graph Drawing Group

Graph Drawing

Research Group home

People

Topics

Tools

Publications:
 By type
 By year
 By topic

Theses & Labs

Grants

Wikis

Conferences


Included in


21st Annual Best of Computing - Notable Books and Articles

Marco Di Bartolomeo, Yifan Hu. There Is More To Streamgraphs Than Movies - Better Aesthetics via Ordering And Lassoing. Comp. Graph. For., 2016.

PC of


25th International Symposium on Graph Drawing & Network Visualization

September 25-27, 2017

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


2017 MRC Conference on Beyond Planarity: Crossing Numbers of Graphs

June 11-17, 2017

We will be at


12nd Bertinoro Workshop on Graph Drawing

March 05-10, 2017

Best paper award


18th EG/VGTC Conference on Visualization
6-10 June 2016, Groningen, the Netherlands

Marco Di Bartolomeo, Yifan Hu. There Is More To Streamgraphs Than Movies - Better Aesthetics via Ordering And Lassoing.

Show all news

Publications by the Graph Drawing Group

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. Vincenzo Roselli. Morphing and Visiting Drawings of Graphs, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria, Sezione Informatica ed Automazione, XXVI Ciclo, 2014. [ Thesis (PDF)] [ Presentation (PDF)]

  6. 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.

  7. 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.

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

  9. 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]

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

  11. 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]

  12. 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]

  13. 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. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs. 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 107-120, 2016.

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

  4. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs. Technical Report arXiv:1608.08952, Cornell University, 2016.

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

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

  7. Giordano Da Lozzo. Planar Graphs with Vertices in Prescribed Regions: models, algorithms, and complexity, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria, Sezione Informatica ed Automazione, XXVII Ciclo, 2015.

  8. 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.

  9. 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.

  10. Fabrizio Frati. Clustered Graph Drawing. In, Ming-Yang Kao, editor, Encyclopedia of Algorithms, 2nd Edition, Springer Science+Business Media New York, pages 1-6, 2015.

  11. Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein. Advances on Testing C-Planarity of Embedded Flat Clustered 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 416-427, 2014.

  12. 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]

  13. 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]

  14. Fabrizio Frati. Multilayer Drawings of Clustered Graphs. Journal of Graph Algorithms and Applications. 18(5):633-675. 2014.

  15. 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.

  16. Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein.. Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. Technical Report arXiv:1408.2595, Cornell University, 2014.

  17. 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.

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

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

  20. 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.

  21. Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella. Dynamic Traceroute Visualization at Multiple Abstraction Levels. 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 500-511, 2013.

  22. 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.

  23. 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.

  24. Fabrizio Frati. Multilevel Drawings of Clustered Graphs. In, J. Gudmundsson, J. Mestre, T. Viglas, editors, Proc. 18th Annual International Computing and Combinatorics Conference (COCOON '12), Springer-Verlag, volume 7434 of Lecture Notes in Computer Science, pages 311-322, 2012.

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

  26. 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.

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

  28. Fabrizio Frati. Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria Informatica, XXI Ciclo, 2009. [ download pdf]

  29. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. On Embedding a Cycle in a Plane Graph. Discrete Mathematics. 309(7):1856-1869. Apr 2009. [see TR] [conference version]

  30. Giuseppe Di Battista, Fabrizio Frati. Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. Journal of Graph Algorithms and Applications. 13(3):349-378. Nov 2009. Special Issue on Selected Papers from GD '07. [ download pdf]

  31. 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.

  32. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia. C-Planarity of C-Connected Clustered Graphs. Journal of Graph Algorithms and Applications. 12(2):225-262. Nov 2008. [ download pdf] [see TR1] [see TR2]

  33. Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati. How to Draw a Clustered Tree. Journal of Discrete Algorithms. 7(4):479-499. Dec 2009.

  34. Giuseppe Di Battista, Fabrizio Frati. Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. In, Seok-Hee Hong, Takao Nishizeki, editors, 15th International Symposium on Graph Drawing (GD '07), Springer-Verlag, volume 4875 of Lecture Notes in Computer Science, pages 291-302, 2007.

  35. Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati. How to Draw a Clustered Tree. 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 89-101, 2007.

  36. Giuseppe Di Battista, Fabrizio Frati. Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. Technical Report RT-DIA-119-2007, Dept. of Computer Science and Automation, University of Roma Tre, 2007.

  37. Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati. How to Draw a Clustered Tree. Technical Report RT-DIA-115-2007, Dept. of Computer Science and Automation, University of Roma Tre, 2007.

  38. Pier Francesco Cortese. C-Planarity of Clustered Graphs: Methodologies, Algorithms, and Applications, Doctoral Thesis, Universita' degli Studi ``Roma Tre'', Dottorato di Ricerca in Informatica e Automazione, XIX Ciclo, 2007. [ download pdf]

  39. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia. C-Planarity of C-Connected Clustered Graphs: Part I - Characterization. Technical Report RT-DIA-109-2006, Dip. Informatica e Automazione, Univ. Roma Tre, 2006. [journal version]

  40. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia. C-Planarity of C-Connected Clustered Graphs: Part II - Testing and Embedding Algorithm. Technical Report RT-DIA-110-2006, Dip. Informatica e Automazione, Univ. Roma Tre, 2006. [journal version]

  41. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. Clustering Cycles into Cycles of Clusters. Journal of Graph Algorithms and Applications. 9(3):391-413. 2005. Special Issue on the 2004 Symposium on Graph Drawing, GD '04. [see TR] [conference version]

  42. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. On Embedding a Cycle in a Plane Graph. In, P. Healy, N.S. Nikolov, editors, 13th International Symposium on Graph Drawing (Proc. GD '05), Springer-Verlag, volume 3843 of Lecture Notes in Computer Science, pages 46-60, 2005. [see TR] [journal version]

  43. Pier Francesco Cortese, Giuseppe Di Battista. Clustered Planarity (Invited Lecture). In Twenty-first annual symposium on Computational Geometry (proc. SoCG 05), ACM, pages 30-32, 2005.

  44. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. On Embedding a Cycle in a Plane Graph. Technical Report RT-DIA-100-2005, Dip. Informatica e Automazione, Univ. Roma Tre, 2005. [conference version] [journal version]

  45. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. Clustering Cycles into Cycles of Clusters. In 12th International Symposium on Graph Drawing (Proc. GD '04), Springer-Verlag, volume 3383 of Lecture Notes in Computer Science, pages 100-110, 2004. [ preliminary version] [see TR] [journal version]

  46. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. Clustering Cycles into Cycles of Clusters. Technical Report RT-DIA-91-2004, Dip. Informatica e Automazione, Univ. Roma Tre, 2004. [conference version] [journal version]

  47. Giuseppe Di Battista, Walter Didimo, Alessandro Marcandalli. Planarization of Clustered Graphs. In, P. Mutzel, M. Juenger, S. Leipert, editors, Graph Drawing (Proc. GD '01), Springer-Verlag, volume 2265 of Lecture Notes in Computer Science, pages 60-74, 2002.

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.

  3. Walter Didimo, Giuseppe Liotta, Maurizio Patrignani. On the Complexity of HV-Rectilinear Planarity Testing. 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 343-354, 2014.

  4. Michael A. Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan N\"aher, Vincenzo Roselli. Slanted Orthogonal Drawings: Model, Algorithms and Evaluations. Journal of Graph Algorithms and Applications. 18(3):459-489. 2014.

  5. Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Naher, Vincenzo Roselli. Slanted Orthogonal Drawings. 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 428-439, 2013.

  6. Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug. Orthogeodesic Point-Set Embedding of Trees. Computational Geometry: Theory and Applications. 46(8):924-944. 2013.

  7. Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. The Shape of Orthogonal Cycles in Three Dimensions. Discrete and Computational Geometry. 47:461-491. 2012.

  8. Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug. Orthogeodesic Point-Set Embedding of Trees. In 19th International Symposium on Graph Drawing (GD '11), Springer-Verlag, Lecture Notes in Computer Science, pages 52-63, 2012.

  9. Fabrizio Frati. Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria Informatica, XXI Ciclo, 2009. [ download pdf]

  10. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features. Theory of Computing Systems. 44(2):143-149. Feb 2009. Special Issue on Selected Papers from FUN '07. [conference version]

  11. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features (Invited Lecture). In, Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci, editors, Fun with Algorithms, 4th International Conference (FUN '07), Springer-Verlag, volume 4475 of Lecture Notes in Computer Science, pages 1-13, 2007. [journal version]

  12. Maurizio Patrignani. A Note on the Self-Similarity of Some Orthogonal Drawings. In 12th International Symposium on Graph Drawing (Proc. GD '04), Springer-Verlag, volume 3383 of Lecture Notes in Computer Science, pages 389-394, 2004. [ preliminary version]

  13. Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia. Industrial Plant Drawer. In, P. Mutzel, M. Juenger, S. Leipert, editors, Graph Drawing (Proc. GD '01), Springer-Verlag, volume 2265 of Lecture Notes in Computer Science, pages 475-476, 2002. Software demo.

  14. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia. Drawing Database Schemas with DBDraw. In, P. Mutzel, M. Juenger, S. Leipert, editors, Graph Drawing (Proc. GD '01), Springer-Verlag, volume 2265 of Lecture Notes in Computer Science, pages 451-452, 2002. Software demo. [ preliminary version]

  15. Maurizio Patrignani. On the Complexity of Orthogonal Compaction. Computational Geometry: Theory and Applications. 19(1):47-67. 2001. [see TR] [conference version]

  16. Maurizio Patrignani. Visualization of Large Graphs. Doctoral Thesis. Universita' degli Studi di Roma ``La Sapienza'', Dottorato di Ricerca in Ingegneria Informatica, XIII Ciclo. 2001. [ download pdf]

  17. Maurizio Patrignani. Visualizzazione di Diagrammi in Tre Dimensioni. Universita' degli Studi di Roma ``La Sapienza'', Tesi di Laurea in Ingegneria Elettronica. 1996. (in Italian). [ download pdf]

  18. Maurizio Pizzonia. Engineering of Graph Drawing Algorithms for Applications, Doctoral Thesis, Universita' degli Studi di Roma ``La Sapienza'', Dottorato di Ricerca in Ingegneria Informatica, XIII Ciclo, 2001. [download ps.gz]

  19. Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara. Turn-Regularity and Optimal Area Drawings of Orthogonal Representations. Computational Geometry: Theory and Applications. 16(1):53-93. 2000.

  20. P. Bertolazzi, G. Di Battista, W. Didimo. Computing Orthogonal Drawings with the Minimum Number of Bends. IEEE Trans. Computers. C-49(8):826-840. 2000.

  21. L. Vismara, G. Di Battista, A. Garg, G. Liotta, R. Tamassia, F. Vargiu. Experimental Studies on Graph Drawing Algorithms. Software -- Practice and Experience. 30(11):1235-1284. 2000.

  22. Walter Didimo. Flow Techniques and Optimal Drawings of Graphs, Doctoral Thesis, Universita' degli Studi di Roma ``La Sapienza'', Dottorato di Ricerca in Ingegneria Informatica, XII Ciclo, 2000.

  23. Maurizio Patrignani. On the Complexity of Orthogonal Compaction. In, F. Dehne, A. Gupta, J.-R. Sack, R. Tamassia, editors, 6th International Workshop Algorithms Data Struct. (Proc. WADS '99), Springer-Verlag, volume 1663 of Lecture Notes in Computer Science, pages 56-61, 1999. [ presentation at WADS 1999] [see TR] [journal version]

  24. Maurizio Patrignani. On the Complexity of Orthogonal Compaction. Technical Report RT-DIA-39-1999, Dip. Informatica e Automazione, Univ. Roma Tre, 1999. [conference version] [journal version]

  25. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia. Orthogonal and Quasi-Upward Drawings with Vertices of Prescribed Size. In, Jan Kratochv\'\il, editor, Graph Drawing (Proc. GD '99), Springer-Verlag, volume 1731 of Lecture Notes in Computer Science, pages 297-310, 1999. [ preliminary version]

  26. Stina Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara. Turn-Regularity and Planar Orthogonal Drawings. In, Jan Kratochv\'\il, editor, Graph Drawing (Proc. GD '99), Springer-Verlag, volume 1731 of Lecture Notes in Computer Science, pages 8-26, 1999.

  27. G. Di Battista, G. Liotta, F. Vargiu. Spirality and Optimal Orthogonal Drawings. SIAM J. Comput.. 27(6):1764-1811. 1998.

  28. Stina Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara. Optimal Compaction of Orthogonal Representations. In CGC Workshop on Geometric Computing, 1998.

  29. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, F. Vargiu. An Experimental Comparison of Four Graph Drawing Algorithms. Comput. Geom. Theory Appl.. 7:303-325. 1997.

  30. Walter Didimo, Antonio Leonforte. GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends. In, G. Di Battista, editor, Graph Drawing (Proc. GD '97), Springer-Verlag, volume 1353 of Lecture Notes in Computer Science, pages 309-315, 1997.

  31. Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo. Computing Orthogonal Drawings with the Minimum Number of Bends. In, Frank Dehne, Andrew Rau-Chaplin, J\"org-R\"udiger Sack, Roberto Tamassia, editors, Proc. 5th Workshop Algorithms Data Struct. (WADS '97), Springer-Verlag, volume 1272 of Lecture Notes in Computer Science, pages 331-344, 1997.

3D Representations of Graphs

  1. David Bremner, Will Evans, Fabrizio Frati, Laurie Heyer, Stephen Kobourov, William Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides. On Representing Graphs by Touching Cuboids. In, W. Didimo, M. Patrignani, editors, Proc. 20th International Symposium on Graph Drawing (GD '12), Springer-Verlag, volume 7704 of Lecture Notes in Computer Science, pages 187-198, 2013.

  2. Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. The Shape of Orthogonal Cycles in Three Dimensions. Discrete and Computational Geometry. 47:461-491. 2012.

  3. Maurizio Patrignani. Complexity Results for Three-dimensional Orthogonal Graph Drawing. Journal of Discrete Algorithms. 6:140-161. 2008. [see TR] [conference version]

  4. Fabrizio Frati, Giuseppe Di Battista. Three Dimensional Drawings of Bounded Degree Trees. In 14th International Symposium on Graph Drawing (GD '06), Springer-Verlag, volume 4372 of Lecture Notes in Computer Science, pages 89-94, 2006.

  5. Maurizio Patrignani. Complexity Results for Three-dimensional Orthogonal Graph Drawing. In, P. Healy, N.S. Nikolov, editors, 13th International Symposium on Graph Drawing (Proc. GD '05), Springer-Verlag, volume 3843 of Lecture Notes in Computer Science, pages 368-379, 2005. [ presentation at GD 2005] [see TR] [journal version]

  6. Maurizio Patrignani. Complexity Results for Three-dimensional Orthogonal Graph Drawing. Technical Report RT-DIA-94-2005, Dip. Informatica e Automazione, Univ. Roma Tre, 2005. [conference version] [journal version]

  7. Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani. A Note on 3D Orthogonal Drawings with Direction Constrained Edges. Information Processing Letters. 90:97-101. 2004.

  8. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. Embedding problems for paths with direction constrained edges. Theor. Computer Science. 289(2):897-917. 2002.

  9. Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani. Orthogonal 3D Shapes of Theta Graphs. In, Michael Goodrich, Stephen Kobourov, editors, Graph Drawing (Proc. GD '02), Springer-Verlag, volume 2528 of Lecture Notes in Computer Science, pages 142-149, 2002. [ preliminary version] [ presentation at GD 2002]

  10. Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani. On Orthogonal 3D Shapes of Theta Graphs. Technical Report RT-DIA-71-2002, Dept. of Computer Sci., Univ. di Roma Tre, 2002.

  11. Maurizio Patrignani. Visualization of Large Graphs. Doctoral Thesis. Universita' degli Studi di Roma ``La Sapienza'', Dottorato di Ricerca in Ingegneria Informatica, XIII Ciclo. 2001. [ download pdf]

  12. Maurizio Patrignani. Visualizzazione di Diagrammi in Tre Dimensioni. Universita' degli Studi di Roma ``La Sapienza'', Tesi di Laurea in Ingegneria Elettronica. 1996. (in Italian). [ download pdf]

  13. Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu. A Split-and-Push Approach to 3D Orthogonal Drawing. Journal of Graph Algorithms and Applications. 4(3):105-133. 2000. [conference version]

  14. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. Embedding Problems for Paths with Direction Constrained Edges. In Proc. of the Annual International Computing and Combinatorics Conference, COCOON'2000, Springer-Verlag, volume 1858 of Lecture Notes in Computer Science, pages 64-73, 2000.

  15. Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu. A Split-and-Push Approach to 3D Orthogonal Drawing. In, Sue Whitesides, editor, Graph Drawing (Proc. GD '98), Springer-Verlag, volume 1547 of Lecture Notes in Computer Science, pages 87-101, 1998. [journal version]

  16. Maurizio Patrignani, Francesco Vargiu. 3DCube: A Tool for Three Dimensional Graph Drawing. In, G. Di Battista, editor, Graph Drawing (Proc. GD '97), Springer-Verlag, volume 1353 of Lecture Notes in Computer Science, pages 284-290, 1998. [ preliminary version]

  17. Giuseppe Liotta, Giuseppe Di Battista. Computing Proximity Drawings of Trees in the 3-Dimensional Space. In Proc. 4th Workshop Algorithms Data Struct., Springer-Verlag, volume 955 of Lecture Notes in Computer Science, pages 239-250, 1995.

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. Fabrizio Frati. Multilayer Drawings of Clustered Graphs. Journal of Graph Algorithms and Applications. 18(5):633-675. 2014.

  3. 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.

  4. Thomas Blasius, Ignaz Rutter. Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. In 24th ACM-SIAM Symposium on Discrete Algorithms (SODA '13), 2013. To appear.

  5. 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.

  6. Markus Chimani, Karsten Klein. Shrinking the Search Space for Clustered Planarity. In 20th International Symposium on Graph Drawing (GD '12), Springer-Verlag, Lecture Notes in Computer Science, 2013. To appear.

  7. Thomas Blasius, Ignaz Rutter. Disconnectivity and Relative Positions in Simultaneous Embeddings. In 20th International Symposium on Graph Drawing (GD '12), Springer-Verlag, Lecture Notes in Computer Science, 2013. To appear.

  8. 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.

  9. 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.

  10. 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.

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

  12. 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. Giordano Da Lozzo, William Devanny, David Eppstein, Timothy Johnson. Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. Technical Report arXiv:1710.00426, Cornell University, 2017.

  2. Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, \'Eva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C.-H. Lin, Austin Mohr, Heather C. Smith, L\'aszl\'o A. Sz\'ekely, Hays Whitlatch. Analogies between the crossing number and the tangle crossing number. Technical Report arXiv:1708.09281, Cornell University, 2017.

  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. Technical Report arXiv:1702.08716, Cornell University, 2017.

  4. Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini. NodeTrix Planarity Testing with Small Clusters. Technical Report arXiv:1708.09281, Cornell University, 2017.

  5. Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani. Visualizing Co-Phylogenetic Reconciliations. Technical Report arXiv:1708.09691, Cornell University, 2017.

  6. Giordano Da Lozzo, William Devanny, David Eppstein, Timothy Johnson. Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. In Proc. 28th International Symposium on Algorithms and Computation (ISAAC '17), 2017. To Appear.

  7. Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff. Planar L-Drawings of Directed Graphs. Technical Report arXiv:1708.09107, Cornell University, 2017.

  8. Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff. Planar L-Drawings of Directed Graphs. In Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD '17), 2017. To Appear.

  9. Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini. NodeTrix Planarity Testing with Small Clusters. In Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD '17), 2017. To Appear.

  10. Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani. Visualizing Co-Phylogenetic Reconciliations. In Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD '17), 2017. To Appear.

  11. Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani. Visualizing Reconciliations in Co-Phylogeny (Extended Abstract). In 18th Italian Conference on Theoretical Computer Science (ICTCS 2017), 2017. To Appear.

  12. 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.

  13. 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.

  14. Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati. On Planar Greedy Drawings of 3-Connected Planar Graphs. In, Boris Aronov, Matthew Katz, editors, Proc. 33rd Symposium on Computational Geometry (SoCG '17), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs, 2017.

  15. 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.

  16. Fabrizio Frati. A Lower Bound on the Diameter of the Flip Graph. Electronic Journal of Combinatorics. 24(1):1-6. 2017. Article 43.

  17. 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]

  18. Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. In, Philip Klein, editor, Proc. 28th ACM-SIAM Symposium on Discrete Algorithms (SODA '17), ACM-SIAM, pages 1980-1999, 2017.

  19. Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. Technical Report arXiv:1610.02841, Cornell University, 2016.

  20. 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.

  21. 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.

  22. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs. 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 107-120, 2016.

  23. Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli. Drawing Planar Graphs with Many Collinear Vertices. 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 152-165, 2016.

  24. Vida Dujmovic, Fabrizio Frati. Stacks and Queue Layouts via Layered Separators. In, Martin Nöllenburg, Yifan Hu, editors, Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD '16), Springer-Verlag, Lecture Notes in Computer Science, 2016. To appear.

  25. 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.

  26. Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati. On Planar Greedy Drawings of 3-Connected Planar Graphs. Technical Report arXiv:1612.09277, Cornell University, 2016.

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

  28. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs. Technical Report arXiv:1608.08952, Cornell University, 2016.

  29. 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.

  30. Giordano Da Lozzo, Ignaz Rutter. On the Complexity of Realizing Facial Cycles. Technical Report arXiv:1607.02347, Cornell University, 2016.

  31. Giordano Da Lozzo, Ignaz Rutter. Strengthening Hardness Results to 3-Connected Planar Graphs. Technical Report arXiv:1607.02346, Cornell University, 2016.

  32. Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli. Drawing Planar Graphs with Many Collinear Vertices. Technical Report arXiv:1606.03890, Cornell University, 2016.

  33. 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.

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

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

  36. Timothy Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer. Drawing Partially Embedded and Simultaneously Planar Graphs. Journal of Graph Algorithms and Applications. 19(2):681-706. 2015.

  37. 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.

  38. 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.

  39. 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.

  40. 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]


  41. 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]

  42. Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin. Compatible Connectivity-Augmentation of Disconnected Graphs. Discrete and Computational Geometry. 54(2):459-480. 2015.

  43. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson. Increasing-Chord Graphs On Point Sets. Journal of Graph Algorithms and Applications. 19(2):761-778. 2015.

  44. 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.

  45. Giordano Da Lozzo. Planar Graphs with Vertices in Prescribed Regions: models, algorithms, and complexity, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria, Sezione Informatica ed Automazione, XXVII Ciclo, 2015.

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

  47. 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.

  48. 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.

  49. 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.

  50. Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis. Fan-Planarity: Properties and Complexity. Theoretical Computer Science. 589:76-86. 2015.

  51. 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.

  52. 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.

  53. 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.

  54. Giordano Da Lozzo, Ignaz Rutter. Planarity of Streamed Graphs. In, Vangelis Th. Paschos, Peter Widmayer, editors, Proc. 9th International Conference on Algorithms and Complexity (CIAC '15), Springer-Verlag, volume 9079 of Lecture Notes in Computer Science, pages 153-166, 2015. [ presentation at CIAC'15]

  55. Giordano Da Lozzo, Ignaz Rutter. Planarity of Streamed Graphs. Technical Report arXiv:1501.07106, Cornell University, 2015.

  56. 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.

  57. 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.

  58. Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin. Compatible Connectivity-Augmentation of Disconnected Graphs. In, Piotr Indyk, editor, 26th ACM-SIAM Symposium on Discrete Algorithms (SODA '15), ACM, pages 1602-1615, 2015.

  59. Giordano Da Lozzo, Vìt Jelìnek, Jan Kratochvìl, Ignaz Rutter. Planar Embeddings with Small and Uniform Faces. Technical Report arXiv:1409.4299, Cornell University, 2014.

  60. Giordano Da Lozzo, Vìt Jelìnek, Jan Kratochvìl, Ignaz Rutter. Planar Embeddings with Small and Uniform Faces. In, Hee-Kap Ahn, Chan-Su Shin, editors, Proc. 25th International Symposium on Algorithms and Computation (ISAAC 2014), Springer-Verlag, volume 8889 of Lecture Notes in Computer Science, pages 633-645, 2014. [ presentation at ISAAC'14]

  61. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson. Increasing-Chord Graphs On Point Sets. 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 464-475, 2014.

  62. Timothy Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer. Drawing Partially Embedded and Simultaneously 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 25-39, 2014.

  63. Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein. Advances on Testing C-Planarity of Embedded Flat Clustered 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 416-427, 2014.

  64. 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]

  65. 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]

  66. Walter Didimo, Giuseppe Liotta, Maurizio Patrignani. On the Complexity of HV-Rectilinear Planarity Testing. 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 343-354, 2014.

  67. Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis. Fan-planar Graphs: Combinatorial Properties and Complexity Results. 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 186-197, 2014.

  68. Fabrizio Frati. Multilayer Drawings of Clustered Graphs. Journal of Graph Algorithms and Applications. 18(5):633-675. 2014.

  69. 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.

  70. Giuseppe Di Battista, Fabrizio Frati. A Survey on Small-Area Planar Graph Drawing. Technical Report arXiv:1410.1006, Cornell University, 2014.

  71. Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin.. Compatible Connectivity-Augmentation of Disconnected Graphs. Technical Report arXiv:1408.2436, Cornell University, 2014.

  72. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson.. Increasing-Chord Graphs On Point Sets. Technical Report arXiv:1408.2592, Cornell University, 2014.

  73. 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.

  74. Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis. Properties and Complexity of Fan-Planarity. Technical Report arXiv:1406.5299, Cornell University, 2014.

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

  76. 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.

  77. Michael A. Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan N\"aher, Vincenzo Roselli. Slanted Orthogonal Drawings: Model, Algorithms and Evaluations. Journal of Graph Algorithms and Applications. 18(3):459-489. 2014.

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

  79. Fabrizio Frati, Michael Kaufmann, Janos Pach, Csaba Toth, David Wood. On the Upward Planarity of Mixed Plane Graphs. Journal of Graph Algorithms and Applications. 18(2):253-279. 2014.

  80. 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.

  81. 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.

  82. 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.

  83. Carla Binucci, Walter Didimo, Maurizio Patrignani. Upward and Quasi-Upward Planarity Testing of Embedded Mixed Graphs. Theor. Computer Science. 526:75-89. 2014.

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

  85. 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.

  86. Giuseppe Di Battista, Fabrizio Frati, Janos Pach. On the Queue Number of Planar Graphs. SIAM Journal on Computing. 42(6):2243-2285. 2013.

  87. 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.

  88. 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.

  89. 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.

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

  91. Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Naher, Vincenzo Roselli. Slanted Orthogonal Drawings. 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 428-439, 2013.

  92. Fabrizio Frati, Michael Kaufmann, Janos Pach, Csaba Toth, David Wood. On the Upward Planarity of Mixed Plane Graphs. 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 1-12, 2013.

  93. 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.

  94. 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]

  95. 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]

  96. Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella. Dynamic Traceroute Visualization at Multiple Abstraction Levels. 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 500-511, 2013.

  97. 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.

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

  99. Giuseppe Di Battista, Claudio Squarcella, Wolfgang Nagele. How to Visualize the K-Root Name Server. Journal of Graph Algorithms and Applications. 16(3):675-699. 2012.

  100. 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]

  101. 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.

  102. 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.

  103. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Nonconvex Representations of Plane Graphs. SIAM Journal on Discrete Mathematics. 26(4):1670-1681. 2012.


  104. book coverMaurizio Patrignani
    Planarity Testing and Embedding
    In, Roberto Tamassia, editor
    Handbook of Graph Drawing and Visualization, Discrete Mathematics and Its Applications
    Chapman and Hall/CRC Press
    pages 1-42, 2013.

  105. Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia. Drawing Graphs on a Smartphone. Journal of Graph Algorithms and Applications. 16(1):109-126. 2012. Special Issue on Selected Papers from GD '10.

  106. 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]

  107. 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.

  108. Carla Binucci, Walter Didimo, Maurizio Patrignani. Upward and Quasi-Upward Planarity Testing of Embedded Mixed Graphs. Technical Report RT 001-12, Dipartimento di Ingegneria Elettronica e dell'Informazione, Perugia University, 2012.

  109. Maurizio Patrignani. Finding Bimodal and Acyclic Orientations of Mixed Planar Graphs is NP-Complete. Technical Report RT-DIA-188-2011, Dept. of Computer Science and Automation, Roma Tre University, 2011.

  110. 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.

  111. 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.

  112. Giuseppe Di Battista, Claudio Squarcella, Wolfgang Nagele. How to Visualize the K-Root Name Server (Demo). In 19th International Symposium on Graph Drawing (GD '11), Springer-Verlag, Lecture Notes in Computer Science, pages 191-202, 2012.

  113. 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.

  114. Vladimir Batagelj, Franz J. Brandenburg, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani. Visual Analysis of Large Graphs Using $(X,Y)$-clustering and Hybrid Visualizations. IEEE Transactions on Visualization and Computer Graphics. 17(11):1587-1598. 2011.

  115. Fabrizio Frati. Lower Bounds on the Area Requirements of Series-Parallel Graphs. Discrete Mathematics and Theoretical Computer Science. 12(5):139-174. 2010. [ download pdf]

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

  117. 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)]

  118. 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.

  119. 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.

  120. Giuseppe Di Battista, Fabrizio Frati, Janos Pach. On the Queue Number of Planar Graphs. In Foundations of Computer Science (FOCS '10), {IEEE} Computer Society, pages 365-374, 2010.

  121. 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.

  122. 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.

  123. 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.

  124. 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.

  125. Giuseppe Di Battista, Fabrizio Frati, Janos Pach. On the Queue Number of Planar Graphs. Technical Report RT-DIA-169-2010, Dept. of Computer Science and Automation, Roma Tre University, 2010.

  126. Fabrizio Frati. A Note on Isosceles Planar Graph Drawing. Information Processing Letters. 110(12--13):507-509. Jun 2010.

  127. Fabrizio Frati. Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. Computational Geometry: Theory and Applications. 45:524-533. 2012. Special Issue on Selected Papers from CCCG '07..

  128. 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.

  129. Fabrizio Frati. A Note on Isosceles Planar Graph Drawing. Technical Report RT-DIA-154-2009, Dept. of Computer Science and Automation, Roma Tre University, 2009.

  130. 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.

  131. Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen Kobourov, Giuseppe Liotta. Upward Straight-line Embeddings of Directed Graphs into Point Sets. Computational Geometry: Theory and Applications. 43:219-232. 2010.

  132. Fabrizio Frati. Planar Packing of Diameter-Four Trees. In, William Evans, editor, 21st Canadian Conference on Computational Geometry (CCCG '09), pages 95-98, 2009.

  133. Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen Kobourov, Giuseppe Liotta. Directed Graphs with an Upward Straight-line Embedding into Every Point Set. In, William Evans, editor, 21st Canadian Conference on Computational Geometry (CCCG '09), pages 21-24, 2009.

  134. 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.

  135. 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.

  136. 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.

  137. Fabrizio Frati. Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria Informatica, XXI Ciclo, 2009. [ download pdf]

  138. 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.

  139. 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.

  140. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Non-convex Representations of Graphs. Technical Report RT-DIA-135-2008, Dept. of Computer Science and Automation, Roma Tre University, 2008. [conference version]

  141. 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]

  142. 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]

  143. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Non-Convex Representations of Graphs. 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 390-395, 2009. [see TR]

  144. Fabrizio Frati. A Lower Bound on the Area Requirements of Series-Parallel Graphs. In, H. Broersma, T. Erlebach, T. Friedetzky, D. Paulusma, editors, 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '08), Springer-Verlag, volume 5344 of Lecture Notes in Computer Science, pages 159-170, 2008.

  145. Alejandro-Estrella Balderrama, Fabrizio Frati, Stephen Kobourov. Upward Straight-line Embeddings of Directed Graphs into Point Sets. In, H. Broersma, T. Erlebach, T. Friedetzky, D. Paulusma, editors, 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '08), Springer-Verlag, volume 5344 of Lecture Notes in Computer Science, pages 122-133, 2008.

  146. Fabrizio Frati. On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. International Journal of Computational Geometry and Applications. 18(3):251-271. Jun 2008.

  147. Giuseppe Di Battista, Fabrizio Frati. Small Area Drawings of Outerplanar Graphs. Algorithmica. 54(1):25-53. May 2009.

  148. Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvìl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta. Homothetic Triangle Contact Representations of Planar Graphs. In, Prosenjit Bose, editor, 19th Canadian Conference on Computational Geometry (CCCG '07), pages 233-236, 2007.

  149. Fabrizio Frati, Maurizio Patrignani. A Note on Minimum Area Straight-line Drawings of Planar Graphs. In, Seok-Hee Hong, Takao Nishizeki, editors, 15th International Symposium on Graph Drawing (GD '07), Springer-Verlag, volume 4875 of Lecture Notes in Computer Science, pages 339-344, 2007.

  150. Fabrizio Frati. Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. In, Prosenjit Bose, editor, 19th Canadian Conference on Computational Geometry (CCCG '07), pages 225-228, 2007.

  151. Fabrizio Frati, Markus Geyer, Michael Kaufmann. Packing and Squeezing Subgraphs into Planar Graphs. In, Antonin Kucera, Ludek Kucera, editors, 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS '07), Springer-Verlag, volume 4708 of Lecture Notes in Computer Science, pages 394-405, 2007.

  152. 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]

  153. 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]

  154. Fabrizio Frati, Markus Geyer, Michael Kaufmann. Packing and Squeezing Subgraphs into Planar Graphs. Technical Report RT-DIA-114-2007, Dept. of Computer Science and Automation, University of Roma Tre, 2007.

  155. Maurizio Patrignani. On Extending a Partial Straight-Line Drawing. International Journal of Foundations of Computer Science (IJFCS), Special Issue on Graph Drawing. 17(5):1061-1069. 2006. [see TR] [conference version]

  156. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis Tollis, Francesco Trotta. On the Topologies of Local Minimum Spanning Trees. In, Thomas Erlebach, editor, 3rd Workshop on Combinatorial and Algorithmic Aspects of the Networks (CAAN '06), Springer-Verlag, volume 4235 of Lecture Notes in Computer Science, pages 31-44, 2006. [see TR]

  157. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis Tollis, Francesco Trotta. On the Topologies of Local Minimum Spanning Trees. Technical Report RT-001-06, Dip. Ingegneria Elettronica e dell'Informazione, Univ. Perugia, 2006. [conference version]

  158. Maurizio Pizzonia. Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis. In, P. Healy, N.S. Nikolov, editors, 13th International Symposium on Graph Drawing (Proc. GD '05), Springer-Verlag, volume 3843 of Lecture Notes in Computer Science, pages 397-408, 2005.

  159. Giuseppe Di Battista, Fabrizio Frati. Small Area Drawings of Outerplanar Graphs. In 13th International Symposium on Graph Drawing (GD '05), Springer-Verlag, volume 3843 of Lecture Notes in Computer Science, pages 89-100, 2005.

  160. Maurizio Patrignani. On Extending a Partial Straight-Line Drawing. In, P. Healy, N.S. Nikolov, editors, 13th International Symposium on Graph Drawing (Proc. GD '05), Springer-Verlag, volume 3843 of Lecture Notes in Computer Science, pages 380-385, 2005. [ presentation at GD 2005] [see TR] [journal version]

  161. Maurizio Patrignani. On Extending a Partial Straight-Line Drawing. Technical Report RT-DIA-99-2005, Dip. Informatica e Automazione, Univ. Roma Tre, 2005. [conference version] [journal version]

  162. John Michael Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista. Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm. In, Giuseppe Liotta, editor, Graph Drawing (Proc. GD '03), Springer-Verlag, volume 2912 of Lecture Notes in Computer Science, pages 25-36, 2004. [see TR]

  163. John Michael Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista. Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm. Technical Report RT-DIA-83-2003, Dip. Informatica e Automazione, Univ. Roma Tre, 2003. [conference version]

  164. Giuseppe Di Battista, Roberto Tamassia, Luca Vismara. Incremental Convex Planarity Testing. Inf. Comput.. 169(1):94-126. 2001.

  165. Maurizio Pizzonia, Roberto Tamassia. Minimum Depth Graph Embedding. In, Mike Paterson, editor, 8th Annual European Symposium on Algorithms (Proc. ESA 2000), Springer, volume 1879 of Lecture Notes in Computer Science, pages 356-367, 2000.

  166. G. Di Battista. Graph Drawing: the Aesthetics-Complexity Trade-Off (Invited Lecture). In, K.~Inderfurth et al.\ , editor, Operations Research Proceedings (Proc. Symposium on Operations Research - SOR'99), Springer-Verlag, pages 92-94, 1999.

  167. G. Di Battista, G. Liotta. Upward Planarity Checking: ``Faces Are More than Polygons''. In, S. H. Whitesides, editor, Graph Drawing (Proc. GD~'98), Springer-Verlag, volume 1547 of Lecture Notes in Computer Science, pages 72-86, 1999.

  168. P. Bertolazzi, G. Di Battista, C. Mannino, R. Tamassia. Optimal Upward Planarity Testing of Single-Source Digraphs. SIAM J. Comput.. 27(1):132-169. 1998.

  169. Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo. Quasi-Upward Planarity. In, S. H. Whitesides, editor, Graph Drawing (Proc. GD '98), Springer-Verlag, volume 1547 of Lecture Notes in Computer Science, pages 15-29, 1998.

  170. G. Di Battista, L. Vismara. Angles of Planar Triangular Graphs. SIAM J. Discrete Math.. 9(3):349-359. 1996.

  171. G. Di Battista, R. Tamassia. On-Line Planarity Testing. SIAM J. Comput.. 25:956-997. 1996.

  172. G. Di Battista, R. Tamassia, L. Vismara. On-Line Convex Planarity Testing. In Graph-Theoretic Concepts in Computer Science (Proc. WG '94), Springer-Verlag, volume 903 of Lecture Notes in Computer Science, pages 242-255, 1995.

  173. G. Di Battista, R. Tamassia, L. Vismara. On-Line Convex Planarity Testing. Technical Report CS-95-26, Dept. Computer Science, Brown Univ., 1995.

  174. G. Di Battista, R. Tamassia. On-Line Planarity Testing. Technical Report CS-92-39, Computer Science Dept., Brown Univ., 1992.

  175. G. Di Battista, R. Tamassia. On-Line Maintenance of Triconnected Components with SPQR-Trees. Technical Report CS-92-40, Computer Science Dept., Brown Univ., 1992.

Minimum Size Representations of Graphs

  1. Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. In, Philip Klein, editor, Proc. 28th ACM-SIAM Symposium on Discrete Algorithms (SODA '17), ACM-SIAM, pages 1980-1999, 2017.

  2. 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.

  3. Giuseppe Di Battista, Fabrizio Frati. A Survey on Small-Area Planar Graph Drawing. Technical Report arXiv:1410.1006, Cornell University, 2014.

  4. Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin.. Compatible Connectivity-Augmentation of Disconnected Graphs. Technical Report arXiv:1408.2436, Cornell University, 2014.

  5. 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.

  6. Lukas Barth, Sara Irina Fabrikant, Stephen Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff. Semantic Word Cloud Representations: Hardness and Approximation Algorithms. In Proc. 11th Latin American Theoretical Informatics Symposium (LATIN'14), Springer-Verlag, Lecture Notes in Computer Science, 2014. To appear.

  7. Lukas Barth, Sara Irina Fabrikant, Stephen Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff. Semantic Word Cloud Representations: Hardness and Approximation Algorithms. Technical Report arXiv:1311.4778, Cornell University, 2013.

  8. 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.

  9. 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.

  10. 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.

  11. Giuseppe Di Battista, Fabrizio Frati. Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in Small Area. In, J. Pach, editor, Geometric Graph Theory, Springer, pages 121-165, 2013.

  12. Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug. Orthogeodesic Point-Set Embedding of Trees. In 19th International Symposium on Graph Drawing (GD '11), Springer-Verlag, Lecture Notes in Computer Science, pages 52-63, 2012.

  13. 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.

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

  15. Fabrizio Frati, Michael Kaufmann. Polynomial Area Bounds for MST Embeddings of Trees. Computational Geometry: Theory and Applications. 44:529-543. 2011.

  16. 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.

  17. 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.

  18. Fabrizio Frati. Lower Bounds on the Area Requirements of Series-Parallel Graphs. Discrete Mathematics and Theoretical Computer Science. 12(5):139-174. 2010. [ download pdf]

  19. 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)]

  20. Fabrizio Frati. Improved Lower Bounds on the Area Requirements of Series-Parallel 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 220-225, 2011.

  21. Giuseppe Di Battista, Fabrizio Frati, Janos Pach. On the Queue Number of Planar Graphs. In Foundations of Computer Science (FOCS '10), {IEEE} Computer Society, pages 365-374, 2010.

  22. 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.

  23. Giuseppe Di Battista, Fabrizio Frati, Janos Pach. On the Queue Number of Planar Graphs. Technical Report RT-DIA-169-2010, Dept. of Computer Science and Automation, Roma Tre University, 2010.

  24. Fabrizio Frati. Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. Computational Geometry: Theory and Applications. 45:524-533. 2012. Special Issue on Selected Papers from CCCG '07..

  25. Fabrizio Frati. Lower Bounds on the Area Requirements of Series-Parallel Graphs. Technical Report RT-DIA-159-2009, Dept. of Computer Science and Automation, Roma Tre University, 2009.

  26. 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.

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

  28. Fabrizio Frati. Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria Informatica, XXI Ciclo, 2009. [ download pdf]

  29. Fabrizio Frati, Michael Kaufmann. Polynomial Area Bounds for MST Embeddings of Trees. Technical Report RT-DIA-122-2008, Dept. of Computer Science and Automation, Roma Tre University, 2008.

  30. Fabrizio Frati. A Lower Bound on the Area Requirements of Series-Parallel Graphs. In, H. Broersma, T. Erlebach, T. Friedetzky, D. Paulusma, editors, 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '08), Springer-Verlag, volume 5344 of Lecture Notes in Computer Science, pages 159-170, 2008.

  31. Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati. How to Draw a Clustered Tree. Journal of Discrete Algorithms. 7(4):479-499. Dec 2009.

  32. Fabrizio Frati. On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. International Journal of Computational Geometry and Applications. 18(3):251-271. Jun 2008.

  33. Giuseppe Di Battista, Fabrizio Frati. Small Area Drawings of Outerplanar Graphs. Algorithmica. 54(1):25-53. May 2009.

  34. Fabrizio Frati. Straight-line Orthogonal Drawings of Binary and Ternary Trees. In, Seok-Hee Hong, Takao Nishizeki, editors, 15th International Symposium on Graph Drawing (GD '07), Springer-Verlag, volume 4875 of Lecture Notes in Computer Science, pages 76-87, 2007.

  35. Fabrizio Frati, Maurizio Patrignani. A Note on Minimum Area Straight-line Drawings of Planar Graphs. In, Seok-Hee Hong, Takao Nishizeki, editors, 15th International Symposium on Graph Drawing (GD '07), Springer-Verlag, volume 4875 of Lecture Notes in Computer Science, pages 339-344, 2007.

  36. Fabrizio Frati. Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. In, Prosenjit Bose, editor, 19th Canadian Conference on Computational Geometry (CCCG '07), pages 225-228, 2007.

  37. Fabrizio Frati. On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. In, Andreas Brandstadt, Dieter Kratsch, Haiko Muller, editors, 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG '07), Springer-Verlag, volume 4769 of Lecture Notes in Computer Science, pages 133-144, 2007.

  38. Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati. How to Draw a Clustered Tree. 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 89-101, 2007.

  39. Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati. How to Draw a Clustered Tree. Technical Report RT-DIA-115-2007, Dept. of Computer Science and Automation, University of Roma Tre, 2007.

  40. Fabrizio Frati, Giuseppe Di Battista. Three Dimensional Drawings of Bounded Degree Trees. In 14th International Symposium on Graph Drawing (GD '06), Springer-Verlag, volume 4372 of Lecture Notes in Computer Science, pages 89-94, 2006.

  41. Giuseppe Di Battista, Fabrizio Frati. Small Area Drawings of Outerplanar Graphs. In 13th International Symposium on Graph Drawing (GD '05), Springer-Verlag, volume 3843 of Lecture Notes in Computer Science, pages 89-100, 2005.

  42. P. Crescenzi, G. Di Battista, A. Piperno. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Comput. Geom. Theory Appl.. 2:187-200. 1992.

Proximity Drawings

  1. Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati. On Planar Greedy Drawings of 3-Connected Planar Graphs. In, Boris Aronov, Matthew Katz, editors, Proc. 33rd Symposium on Computational Geometry (SoCG '17), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs, 2017.

  2. Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati. On Planar Greedy Drawings of 3-Connected Planar Graphs. Technical Report arXiv:1612.09277, Cornell University, 2016.

  3. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson. Increasing-Chord Graphs On Point Sets. Journal of Graph Algorithms and Applications. 19(2):761-778. 2015.

  4. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson. Increasing-Chord Graphs On Point Sets. 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 464-475, 2014.

  5. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson.. Increasing-Chord Graphs On Point Sets. Technical Report arXiv:1408.2592, Cornell University, 2014.

  6. 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.

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

  8. Fabrizio Frati, Michael Kaufmann. Polynomial Area Bounds for MST Embeddings of Trees. Computational Geometry: Theory and Applications. 44:529-543. 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, 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.

  11. 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]

  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.

  14. Fabrizio Frati. Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria Informatica, XXI Ciclo, 2009. [ download pdf]

  15. 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.

  16. Fabrizio Frati, Michael Kaufmann. Polynomial Area Bounds for MST Embeddings of Trees. Technical Report RT-DIA-122-2008, Dept. of Computer Science and Automation, Roma Tre University, 2008.

  17. 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.

  18. Giuseppe Di Battista, Giuseppe Liotta, Sue H. Whitesides. The strength of weak proximity. Journal of Discrete Algorithms. 4(3):384-400. Sep 2006.

  19. G. Di Battista, G. Liotta, S. H. Whitesides. The Strength of Weak Proximity. In, F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), Springer-Verlag, volume 1027 of Lecture Notes in Computer Science, pages 178-189, 1996.

  20. P. Bose, G. Di Battista, W. Lenhart, G. Liotta. Proximity Constraints and Representable Trees. Technical Report RT-INF-9-96, Dip. Discipline Scientifiche, Sez. Informatica, Univ. Roma III, 1996.

  21. G. Di Battista, G. Liotta, S.H. Whitesides. The Strength of Weak Proximity. Technical Report RT-INF-8-96, Dip. Discipline Scientifiche, Sez. Informatica, Univ. Roma III, 1996.

  22. P. Bose, G. Di Battista, W. Lenhart, G. Liotta. Proximity Constraints and Representable Trees. In, R. Tamassia, I. G. Tollis, editors, Graph Drawing (Proc. GD '94), Springer-Verlag, volume 894 of Lecture Notes in Computer Science, pages 340-351, 1995.

  23. Giuseppe Liotta, Giuseppe Di Battista. Computing Proximity Drawings of Trees in the 3-Dimensional Space. In Proc. 4th Workshop Algorithms Data Struct., Springer-Verlag, volume 955 of Lecture Notes in Computer Science, pages 239-250, 1995.

  24. G. Di Battista, W. Lenhart, G. Liotta. Proximity Drawability: a Survey. In, R. Tamassia, I. G. Tollis, editors, Graph Drawing (Proc. GD '94), Springer-Verlag, volume 894 of Lecture Notes in Computer Science, pages 328-339, 1995.

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. Timothy Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer. Drawing Partially Embedded and Simultaneously Planar Graphs. Journal of Graph Algorithms and Applications. 19(2):681-706. 2015.

  5. 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.

  6. Fabrizio Frati, Michael Hoffmann, Vincent Kusters. Simultaneous Embeddings with Few Bends and Crossings. In, Emilio Di Giacomo, Anna Lubiw, editors, Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD '15), Springer-Verlag, Lecture Notes in Computer Science, 2015. To appear.

  7. Giordano Da Lozzo. Planar Graphs with Vertices in Prescribed Regions: models, algorithms, and complexity, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria, Sezione Informatica ed Automazione, XXVII Ciclo, 2015.

  8. 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.

  9. Giordano Da Lozzo, Ignaz Rutter. Planarity of Streamed Graphs. In, Vangelis Th. Paschos, Peter Widmayer, editors, Proc. 9th International Conference on Algorithms and Complexity (CIAC '15), Springer-Verlag, volume 9079 of Lecture Notes in Computer Science, pages 153-166, 2015. [ presentation at CIAC'15]

  10. Giordano Da Lozzo, Ignaz Rutter. Planarity of Streamed Graphs. Technical Report arXiv:1501.07106, Cornell University, 2015.

  11. 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.

  12. 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.

  13. Timothy Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer. Drawing Partially Embedded and Simultaneously 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 25-39, 2014.

  14. 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]

  15. 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.

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

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

  18. 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.

  19. 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.

  20. 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.

  21. 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.

  22. Fabrizio Frati, Marc Glisse, William Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat. Point-Set Embeddability of 2-Colored Trees. In, W. Didimo, M. Patrignani, editors, Proc. 20th International Symposium on Graph Drawing (GD '12), Springer-Verlag, volume 7704 of Lecture Notes in Computer Science, pages 291-302, 2013.

  23. 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.

  24. 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.

  25. 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.

  26. Ulrik Brandes, Cesim Erten, Joe Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis. Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica. 60(3):569-592. 2011.

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

  28. 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.

  29. 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.

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

  31. Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen Kobourov, Giuseppe Liotta. Upward Straight-line Embeddings of Directed Graphs into Point Sets. Computational Geometry: Theory and Applications. 43:219-232. 2010.

  32. Fabrizio Frati. Planar Packing of Diameter-Four Trees. In, William Evans, editor, 21st Canadian Conference on Computational Geometry (CCCG '09), pages 95-98, 2009.

  33. Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen Kobourov, Giuseppe Liotta. Directed Graphs with an Upward Straight-line Embedding into Every Point Set. In, William Evans, editor, 21st Canadian Conference on Computational Geometry (CCCG '09), pages 21-24, 2009.

  34. Fabrizio Frati, Michael Kaufmann, Stephen Kobourov. Constrained Simultaneous and Near Simultaneous Embeddings. Journal of Graph Algorithms and Applications. 13(3):447-465. Nov 2009. Special Issue on Selected Papers from GD '07. [ download pdf]

  35. Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen Kobourov. Upward Straight-line Embeddings of Directed Graphs into Point Sets. Technical Report RT-DIA-133-2008, Dept. of Computer Science and Automation, Roma Tre University, 2008.

  36. Alejandro-Estrella Balderrama, Fabrizio Frati, Stephen Kobourov. Upward Straight-line Embeddings of Directed Graphs into Point Sets. In, H. Broersma, T. Erlebach, T. Friedetzky, D. Paulusma, editors, 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '08), Springer-Verlag, volume 5344 of Lecture Notes in Computer Science, pages 122-133, 2008.

  37. Fabrizio Frati, Markus Geyer, Michael Kaufmann. Planar Packings of Trees and Spider Trees. Information Processing Letters. 109(6):301-307. Feb 2009.

  38. Fabrizio Frati, Michael Kaufmann, Stephen Kobourov. Constrained Simultaneous and Near Simultaneous Embeddings. In, Seok-Hee Hong, Takao Nishizeki, editors, 15th International Symposium on Graph Drawing (GD '07), Springer-Verlag, volume 4875 of Lecture Notes in Computer Science, pages 268-279, 2007.

  39. Fabrizio Frati, Markus Geyer, Michael Kaufmann. Packing and Squeezing Subgraphs into Planar Graphs. In, Antonin Kucera, Ludek Kucera, editors, 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS '07), Springer-Verlag, volume 4708 of Lecture Notes in Computer Science, pages 394-405, 2007.

  40. Ulrik Brandes, Cesim Erten, Joe Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis. Colored Simultaneous Geometric Embeddings. In, Guohui Lin, editor, 13th Annual International Computing and Combinatorics Conference (COCOON '07), Springer-Verlag, volume 4598 of Lecture Notes in Computer Science, pages 254-263, 2007.

  41. Fabrizio Frati, Michael Kaufmann, Stephen Kobourov. Constrained Simultaneous and Near-Simultaneous Embeddings. Technical Report RT-DIA-120-2007, Dept. of Computer Science and Automation, University of Roma Tre, 2007.

  42. Fabrizio Frati, Markus Geyer, Michael Kaufmann. Packing and Squeezing Subgraphs into Planar Graphs. Technical Report RT-DIA-114-2007, Dept. of Computer Science and Automation, University of Roma Tre, 2007.

  43. Fabrizio Frati. Embedding Graphs Simultaneously with Fixed Edges. In 14th International Symposium on Graph Drawing (GD '06), Springer-Verlag, volume 4372 of Lecture Notes in Computer Science, pages 108-113, 2006.

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. Fabrizio Frati, Michael Kaufmann, Janos Pach, Csaba Toth, David Wood. On the Upward Planarity of Mixed Plane Graphs. Journal of Graph Algorithms and Applications. 18(2):253-279. 2014.

  4. Fabrizio Frati, Joachim Gudmundsson, Emo Welzl. On the Number of Upward Planar Orientations of Maximal Planar Graphs. Theoretical Computer Science. 544:32-59. 2014.

  5. Fabrizio Frati, Michael Kaufmann, Janos Pach, Csaba Toth, David Wood. On the Upward Planarity of Mixed Plane Graphs. 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 1-12, 2013.

  6. 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.

  7. 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.

  8. Fabrizio Frati, Joachim Gudmundsson, Emo Welzl. On the Number of Upward Planar Orientations of Maximal Planar Graphs. In, K. Chao, T. Hsu, D. Lee, editors, 23rd International Symposium on Algorithms and Computation (ISAAC '12), Springer-Verlag, volume 7676 of Lecture Notes in Computer Science, pages 413-422, 2012.

  9. 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.

  10. 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.

  11. Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo. Quasi-Upward Planarity. Algorithmica. 32:474-506. 2002.

  12. G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, L. Vismara. Drawing Directed Acyclic Graphs: an Experimental Study. International Journal of Computational Geometry and Applications. 10(6):623-648. 2000.

  13. G. Di Battista. Graph Drawing: the Aesthetics-Complexity Trade-Off (Invited Lecture). In, K.~Inderfurth et al.\ , editor, Operations Research Proceedings (Proc. Symposium on Operations Research - SOR'99), Springer-Verlag, pages 92-94, 1999.

  14. G. Di Battista, G. Liotta. Upward Planarity Checking: ``Faces Are More than Polygons''. In, S. H. Whitesides, editor, Graph Drawing (Proc. GD~'98), Springer-Verlag, volume 1547 of Lecture Notes in Computer Science, pages 72-86, 1999.

  15. P. Bertolazzi, G. Di Battista, C. Mannino, R. Tamassia. Optimal Upward Planarity Testing of Single-Source Digraphs. SIAM J. Comput.. 27(1):132-169. 1998.

  16. Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo. Quasi-Upward Planarity. In, S. H. Whitesides, editor, Graph Drawing (Proc. GD '98), Springer-Verlag, volume 1547 of Lecture Notes in Computer Science, pages 15-29, 1998.

  17. G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, L. Vismara. Drawing Directed Acyclic Graphs: An Experimental Study. In, S. North, editor, Graph Drawing (Proc. GD '96), Springer-Verlag, volume 1190 of Lecture Notes in Computer Science, pages 76-91, 1997.

  18. G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, L. Vismara. Drawing Directed Acyclic Graphs: An Experimental Study. Technical Report CS-96-24, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

  19. P. Bertolazzi, R. F. Cohen, G. Di Battista, R. Tamassia, I. G. Tollis. How to Draw a Series-Parallel Digraph. Internat. J. Comput. Geom. Appl.. 4:385-402. 1994.

  20. P. Bertolazzi, G. Di Battista, G. Liotta, C. Mannino. Upward Drawings of Triconnected Digraphs. Algorithmica. 6(12):476-497. 1994.

  21. P. Bertolazzi, G. Di Battista, C. Mannino, R. Tamassia. Optimal Upward Planarity Testing of Single-Source Digraphs. In Proc. 1st Annu. European Sympos. Algorithms, Springer-Verlag, volume 726 of Lecture Notes in Computer Science, pages 37-48, 1993.

  22. G. Di Battista, R. Tamassia, I. G. Tollis. Area Requirement and Symmetry Display of Planar Upward Drawings. Discrete Comput. Geom.. 7(4):381-401. 1992.

  23. P. Crescenzi, G. Di Battista, A. Piperno. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Comput. Geom. Theory Appl.. 2:187-200. 1992.

  24. P. Bertolazzi, G. Di Battista. On upward drawing testing of triconnected digraphs. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 272-280, 1991.

  25. P. Crescenzi, G. Di Battista, A. Piperno. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Technical Report 11.91, Dipartimento di Informatica e Sistemistica, Univ. di Roma ``La Sapienza'', 1991.

  26. G. Di Battista, W. P. Liu, I. Rival. Bipartite Graphs Upward Drawings and Planarity. Inform. Process. Lett.. 36:317-322. 1990.

  27. G. Di Battista, E. Nardelli. Hierarchies and Planarity Theory. IEEE Trans. Syst. Man Cybern.. 18(6):1035-1046. 1988.

Dynamic Graph Drawing

  1. Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani and Maurizio Pizzonia. Infinite Trees and the Future. In, Jan Kratochv\'\il, editor, Graph Drawing (Proc. GD '99), Springer-Verlag, volume 1731 of Lecture Notes in Computer Science, pages 379-391, 1999. [ preliminary version]

  2. G. Di Battista, R. Tamassia. On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica. 15:302-318. 1996.

  3. G. Di Battista, R. Tamassia. On-Line Planarity Testing. SIAM J. Comput.. 25:956-997. 1996.

  4. R. F. Cohen, G. Di Battista, R. Tamassia, I. G. Tollis. Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs. SIAM J. Comput.. 24(5):970-1001. 1995.

  5. G. Di Battista, R. Tamassia, L. Vismara. On-Line Convex Planarity Testing. In Graph-Theoretic Concepts in Computer Science (Proc. WG '94), Springer-Verlag, volume 903 of Lecture Notes in Computer Science, pages 242-255, 1995.

  6. G. Di Battista, R. Tamassia, L. Vismara. On-Line Convex Planarity Testing. Technical Report CS-95-26, Dept. Computer Science, Brown Univ., 1995.

  7. G. Di Battista, R. Tamassia. On-Line Planarity Testing. Technical Report CS-92-39, Computer Science Dept., Brown Univ., 1992.

  8. G. Di Battista, R. Tamassia. On-Line Maintenance of Triconnected Components with SPQR-Trees. Technical Report CS-92-40, Computer Science Dept., Brown Univ., 1992.

  9. A. Kanevsky, R. Tamassia, G. Di Battista, J. Chen. On-line Maintenance of the Four-Connected Components of a Graph. In Proc. Annu. IEEE Sympos. Found. Computer Science (FOCS), pages 793-801, 1991.

  10. G. Di Battista, R. Tamassia. On-Line Graph Algorithms with SPQR-Trees. In, M. S. Paterson, editor, Automata, Languages and Programming (Proc. 17th ICALP), Springer-Verlag, volume 443 of Lecture Notes in Computer Science, pages 598-611, 1990.

Inference of commercial relationships between Internet Service Providers.

  1. Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia. Topographic Visualization of Prefix Propagation in the Internet. IEEE Transactions on Visualization and Computer Graphics. 12(5):725-732. 2006. [see TR]