Publications related with Minimum Size Representations of Graphs

Minimum Size Representations of Graphs

Topic home

Graph Drawing
 Topics
 Tools

Publications:
 By type
 By year

Publications related with Minimum Size Representations of Graphs

Journal Publications

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

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

  3. Patrizio Angelini, 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.

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

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

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

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

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

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

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

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

Book Chapters

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

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

Conference Publications

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Technical Reports

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

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

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

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

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

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

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

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

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

Theses

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