Fabrizio Frati's Publications

Fabrizio Frati

Home

Research groups:
  Graph Drawing

Publications:
  By type
  By year
  By topic

Teaching:
  Courses (Italian)
  Theses & Labs


Show all news

Fabrizio Frati's Publications

Journal Publications

  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. Fabrizio Frati. A Lower Bound on the Diameter of the Flip Graph. Electronic Journal of Combinatorics. 24(1):1-6. 2017. Article 43.

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

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

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

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

  7. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson. Increasing-Chord Graphs On Point Sets. Journal of Graph Algorithms and Applications. 19(2):761-778. 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. 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. Multilayer Drawings of Clustered Graphs. Journal of Graph Algorithms and Applications. 18(5):633-675. 2014.

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

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

  13. Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson. Augmenting Graphs to Minimize the Diameter. Algorithmica. 72(4):995-1010. 2015.

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

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

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

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

  18. Fabrizio Frati, Radoslav Fulek, Andres Ruiz Vargas. On the Page Number of Upward Planar Directed Graphs. Journal of Graph Algorithms and Applications. 17(3):221-244. 2013.

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

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

  21. Vida Dujmovic, Fabrizio Frati, Gwenael Joret, David R. Wood. Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. Electronic Journal of Combinatorics. 20(1). 2013.

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

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

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

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

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

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

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

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

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

  31. Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis. On the Perspectives Opened by Right Angle Crossing Drawings. Journal of Graph Algorithms and Applications. 15(1):53-78. 2011. Special Issue on Selected Papers from GD '09. [ download pdf]

  32. Patrizio Angelini, Fabrizio Frati. Acyclically 3-Colorable Planar Graphs. Journal of Combinatorial Optimization. 24(2):116-130. 2012. Special Issue on Selected Papers from WALCOM '10.

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

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

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

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

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

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

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

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

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

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

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

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

Book Chapters

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

  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. Jacob Fox, Fabrizio Frati, Janos Pach, Rom Pinchasi. Crossings Between Curves with Many Tangencies. In, I. Barany, J. Solymosi, editors, An Irregular Mind (Szemeredi is 70), Bolyai Society Mathematical Studies, vol. 21, Springer-Verlag, pages 1-10, 2010.

Conference Publications

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

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

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

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

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

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


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

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

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

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

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

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

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

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

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

  18. Fabrizio Frati, Joachim Gudmundsson, Serge Gaspers, Luke Mathieson. Augmenting Graphs to Minimize the Diameter. 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 383-393, 2013.

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

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

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

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

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

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

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

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

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

  29. Fabrizio Frati, Radoslav Fulek, Andres Ruiz Vargas. On the Page Number of Upward Planar Directed Graphs. In 19th International Symposium on Graph Drawing (GD '11), Springer-Verlag, Lecture Notes in Computer Science, pages 391-402, 2012.

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

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

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

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

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

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

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

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

  38. Jacob Fox, Fabrizio Frati, Janos Pach, Rom Pinchasi. Crossings between Curves with Many Tangencies. In, Md. Saidur Rahman, Satoshi Fujita, editors, Workshop on Algorithms and Computation (WALCOM '10), Springer, volume 5942 of Lecture Notes in Computer Science, pages 1-8, 2010.

  39. Patrizio Angelini, Fabrizio Frati. Acyclically 3-Colorable Planar Graphs. In, Md. Saidur Rahman, Satoshi Fujita, editors, Workshop on Algorithms and Computation (WALCOM '10), Springer-Verlag, volume 5942 of Lecture Notes in Computer Science, pages 113-124, 2010.

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

  41. Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis. On the Perspectives Opened by Right Angle Crossing Drawings. 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 21-32, 2010.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  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. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs. Technical Report arXiv:1608.08952, Cornell University, 2016.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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]