Publications related with Clustered Graphs

Clustered Graphs

Topic home

Graph Drawing
 Topics
 Tools

Publications:
 By type
 By year

Publications related with Clustered Graphs

2017

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

2016

  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.

2015

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

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

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

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

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

2014

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

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

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

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

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

  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, Giordano Da Lozzo. SEFE = C-Planarity?. 9th International Colloquium on Graph Theory and Combinatorics (ICGT '14). 2014.

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

2013

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

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

  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.

2012

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

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

2011

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

2010

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

2009

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

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

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

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

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

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

2008

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

2007

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

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

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

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

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

2006

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

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

2005

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

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

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

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

2004

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

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

2002

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