Giuseppe Di Battista's Publications

Giuseppe Di Battista

Home

Research groups:
  Graph Drawing
  Computer Networks

Publications:
  By type
  By year
  By topic

Teaching:
  Courses (Italian)
  Theses & Labs


PC of

LSDVE 2017

Show all news

Giuseppe Di Battista's Publications

Software-Defined Networking

  1. Roberto di Lallo, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. How to Handle ARP in a Software-Defined Network. In Conference on Network Softwarization (NetSoft 2016), IEEE, pages 63-67, 2016.

  2. Roberto di Lallo, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. Supporting End-to-End Connectivity in Federated Networks using SDN. In, Melike Erol-Kantarci, Brendan Jennings, Helmut Reiser, editors, Proc. IEEE/IFIP Network Operations and Management Symposium (NOMS 2016), pages 759-762, 2016. Poster. [ NOMS 2016 poster]

  3. Gabriele Lospoto, Massimo Rimondini, Benedetto Gabriele Vignoli, Giuseppe Di Battista. Rethinking Virtual Private Networks in the Software-Defined Era. In Proc. IFIP/IEEE International Symposium on Integrated Network Management (IM 2015), 2015. [demo]

  4. Gabriele Lospoto, Massimo Rimondini, Benedetto Gabriele Vignoli, Giuseppe Di Battista. Making MPLS VPNs Manageable through the Adoption of SDN. In Proc. IFIP/IEEE International Symposium on Integrated Network Management (IM 2015), 2015. Demo. [conference paper]

A Control Plane for Intra-Domain Routing

  1. Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. Intra-Domain Routing with Pathlets. Computer Communications. 46:76-86. 2014. [conference version] [see TR]

  2. Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. Intra-Domain Pathlet Routing. In 22nd International Conference on Computer Communications and Networks (IEEE ICCCN 2013), IEEE, pages 1-9, 2013. [ Presentation at ICCCN'13] [journal version] [see TR]

  3. Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. Intra-Domain Pathlet Routing. Technical Report arXiv:1302.5414, Cornell University, 2013. [journal version] [conference version]

Monitoring of MPLS VPNs and VPLS based on BGP Signaling

  1. Giuseppe Di Battista, Massimo Rimondini, Giorgio Sadolfo. Monitoring the Status of MPLS VPN and VPLS Based on BGP Signaling Information. In Proc. IEEE/IFIP Network Operations and Management Symposium (NOMS 2012), IEEE, pages 237-244, 2012. [ Presentation at NOMS 2012]

Interdomain Routing Stability

  1. Marco Chiesa, Luca Cittadini, Laurent Vanbever, Stefano Vissicchio, Giuseppe Di Battista. Using Routers to Build Logic Circuits: How Powerful is BGP?. In Proc. International Conference on Network Protocols (IEEE ICNP 2013), IEEE, pages 1-10, 2013. [BEST PAPER AWARD ] [ Presentation at ICNP'13 ]

  2. Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani. Computational Complexity of Traffic Hijacking under BGP and S-BGP. In Proc. 39th International Colloquium on Automata, Languages and Programming (ICALP '12), Springer Verlag, volume 7392 of Lecture Notes in Computer Science, pages 476-487, 2012. [see arXiv extended version] [ Presentation at ICALP'12]

  3. Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini, Stefano Vissicchio. Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing. IEEE/ACM Transactions on Networking. 19(4):1085-1096. Aug 2011. [conference version]

  4. Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini. On the Stability of Interdomain Routing. ACM Computing Surveys. 44(4):26:1-26:40. 2012.

  5. Luca Cittadini, Massimo Rimondini, Stefano Vissicchio, Matteo Corea, Giuseppe Di Battista. From Theory to Practice: Efficiently Checking BGP Configurations for Guaranteed Convergence. IEEE Transactions on Network and Service Management. 8(4):387-400. Dec 2011.

  6. Marco Chiesa, Luca Cittadini, Giuseppe Di Battista, Stefano Vissicchio. Local Transit Policies and the Complexity of BGP Stability Testing. In 30th IEEE International Conference on Computer Communications (IEEE INFOCOM 2011), IEEE, pages 2957-2965, 2011. [ Presentation at INFOCOM'11]

  7. Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini. Assigning AS Relationships to Satisfy the Gao-Rexford Conditions. In Proc. ICNP 2010, IEEE, pages 113-123, 2010. [ Presentation at ICNP'10]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Planarity and Planar Graphs

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

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

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

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

  5. Patrizio Angelini, Giordano Da Lozzo, 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.

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

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

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

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

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

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

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

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

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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  73. 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. Giuseppe Di Battista, Fabrizio Frati. A Survey on Small-Area Planar Graph Drawing. Technical Report arXiv:1410.1006, Cornell University, 2014.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  17. 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. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings Do Not Always Exist. Networks. 59(3):267-274. 2012.

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

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

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

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

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

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

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

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

  10. 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, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. Beyond Level Planarity. Technical Report arXiv:1510.08274, Cornell University, 2015.

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

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

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

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

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

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

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

Upward Planarity

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

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

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

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

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

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

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

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

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

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

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

  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. Technical Report CS-96-24, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

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

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

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

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

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

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

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

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

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

Root Cause Analysis

  1. Giordano Da Lozzo, Giuseppe Di Battista, Claudio Squarcella. Visual Discovery of the Correlation between BGP Routing and Round-Trip Delay Active Measurements. Computing. 96(1):67-77. 2014.


  2. book coverGiordano Da Lozzo, Giuseppe Di Battista, Claudio Squarcella
    Visual Discovery of the Correlation between BGP Routing and Round-Trip Delay Active Measurements
    In 1st IMC Workshop on Internet Visualization (WIV 2012), 2012. Poster. Program: http://ant.isi.edu/wiv2012/program.html.

  3. Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso. Policy-aware Visualization of Internet Dynamics. In, Tollis, Ioannis G.; Patrignani, Maurizio, editors, 16th International Symposium on Graph Drawing (GD '08), Springer-Verlag, volume 5417 of Lecture Notes in Computer Science, pages 435-436, 2009. [ poster description]

  4. Alessio Campisano, Luca Cittadini, Giuseppe Di Battista, Tiziana Refice, Claudio Sasso. Tracking Back the Root Cause of a Path Change in Interdomain Routing. In Proc. IEEE/IFIP Network Operations and Management Symposium (NOMS 2008), IEEE, pages 441-448, 2008. [ presentation at NOMS 2008]

  5. Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso. Measuring and Visualizing Interdomain Routing Dynamics with BGPath. In Proc. IEEE Symposium on Computers and Communications (ISCC 2008), IEEE, pages 780-787, 2008. [ presentation at ISCC 2008] [ presentation at RIPE 56 Meeting]

  6. Alessio Campisano, Luca Cittadini, Giuseppe Di Battista, Tiziana Refice, Claudio Sasso. Update-Driven Root Cause Analysis in Interdomain Routing. Technical Report RT-DIA-117-2007, Dept. of Computer Science and Automation, University of Roma Tre, 2007.

Analysis of the Internet Routing Registry

  1. Giuseppe Di Battista, Tiziana Refice, Massimo Rimondini. How to Extract BGP Peering Information from the Internet Routing Registry. In ACM SIGCOMM MineNet Workshop 2006, 2006. [ presentation at MINENET 2006] [ presentation at the RIPE 53 Meeting] [see TR]

  2. Giuseppe Di Battista, Tiziana Refice, Massimo Rimondini. How to Extract BGP Peering Information from the Internet Routing Registry. Technical Report RT-DIA-108-2006, Dept. of Computer Science and Automation, University of Roma Tre, 2006. [conference version]

  3. Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia. Visualization of the Autonomous Systems Interconnections with HERMES. Journal of Graph Algorithms and Applications. 6(3):281-311. 2002.

  4. Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia. Visualization of the Autonomous Systems Interconnections with HERMES. In, Joe Marks, editor, Graph Drawing (Proc. GD '00), Springer-Verlag, volume 1984 of Lecture Notes in Computer Science, pages 150-163, 2000.

Route Diversity in Interdomain Routing

  1. Andrea Di Menna, Tiziana Refice, Luca Cittadini, Giuseppe Di Battista. Measuring Route Diversity in the Internet from Remote Vantage Points. In Proc. International Conference on Networks (ICN 2009), IEEE, pages 24-29, 2009.

Discovery and Analysis of Interdomain Routing Policies

  1. Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini. Investigating Prefix Propagation through Active BGP Probing. Microprocessors and Microsystems. 31:460-474. 2007. [see TR] [conference version]

  2. Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini. Investigating Prefix Propagation through Active BGP Probing. In, Paolo Bellavista, Chi-Ming Chen, editors, 11th IEEE Symposium on Computers and Communications (ISCC 2006), IEEE Computer Society, pages 497-504, 2006. [see TR] [journal version]

  3. Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini. Active BGP Probing. Technical Report RT-DIA-102-2005, Dip. Informatica e Automazione, Univ. Roma Tre, 2005. [conference version] [journal version]

Inference of commercial relationships between Internet Service Providers.

  1. Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank. Computing the Types of the Relationships between Autonomous Systems. IEEE/ACM Transactions on Networking. 15(2):267-280. Apr 2007.

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

  3. Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia. Topographic Visualization of the Internet. Technical Report RT-DIA-104-2005, Dip. Informatica e Automazione, Univ. Roma Tre, 2005. [journal version]

  4. Massimo Rimondini, Maurizio Pizzonia, Giuseppe Di Battista, Maurizio Patrignani. Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation. In 2nd International Workshop on Inter-Domain Performance and Simulation (IPS 2004), pages 33-45, 2004. [ presentation at IPS 2004]

  5. Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia. BGPlay: a System for Visualizing the Interdomain Routing Evolution. In, Giuseppe Liotta, editor, Graph Drawing (Proc. GD '03), Springer-Verlag, volume 2912 of Lecture Notes in Computer Science, pages 295-306, 2004. [journal version]

  6. Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. Computing the Types of the Relationships between Autonomous Systems. In IEEE INFOCOM 2003, pages 156-165, 2003. [ presentation at INFOCOM 2003] [see TR]

  7. Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia. Archives of BGP Updates: Integration and Visualization. In Proceedings of IPS 2003, International Workshop on Inter-domain Performance and Simulation, pages 123-129, 2003. [ preliminary version]

  8. Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. Computing the Types of Relationships between Autonomous Systems. Technical Report RT-DIA-73-2002, Dip. Informatica e Automazione, Univ. Roma Tre, 2002. [conference version]

IPv6 Tunnel Discovery

  1. Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani. IPv6-in-IPv4 tunnel discovery: methods and experimental results. IEEE Transactions on Network and Service Management. 1(1):2-10. Apr 2004. [see TR] [conference version]

  2. Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani. Discovering IPv6-in-IPv4 Tunnels in the Internet. In, R. Boutaba, S.-B. Kim, editors, Proc. IEEE/IFIP Network Operations and Management Symposium (NOMS 2004), pages 613-626, 2004. [ preliminary version] [see TR] [journal version]

  3. Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani. Discovering IPv6-in-IPv4 Tunnels in the Internet. Technical Report RT-DIA-82-2003, Dip. Informatica e Automazione, Univ. Roma Tre, 2003. [conference version] [journal version]