Fabrizio Frati

Fabrizio Frati

PhD Computer Science
Postdoctoral Research

SIT Building J12, Room 353
(Cnr Cleveland St and City Rd)
P: +61 2 9036 9726
F: +61 2 9351 3838
E: brillo AT it DOT usyd DOT edu DOT au


Research interests

Graph drawing, graph theory, combinatorial geometry.

Selected publications

The following list is a selection from publications.

  • Fabrizio Frati, Michael Kaufmann. Polynomial Area Bounds for MST Embeddings of Trees. Computational Geometry: Theory and Applications. 44:529-543. 2011.
  • Patrizio Angelini, Fabrizio Frati, Michael Kaufmann. Straight-line Rectangular Drawings of Clustered Graphs. Discrete and Computational Geometry. 45(1):88-140. 2011.
  • Fabrizio Frati. Lower Bounds on the Area Requirements of Series-Parallel Graphs. Discrete Mathematics and Theoretical Computer Science. 12(5):139-174. 2010.
  • 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.
  • 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.
  • Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vit Jelinek, Jan Kratochvil, Maurizio Patrignani, Ignaz Rutter. Testing Planarity of Partially Embedded Graphs. In Symposium On Discrete Algorithms (SODA '10), ACM-SIAM, pages 202-221. 2010.
  • Giuseppe Di Battista, Fabrizio Frati. Small Area Drawings of Outerplanar Graphs. Algorithmica. 54(1):25-53. 2009.
  • 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. 2009.
  • Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati. How to Draw a Clustered Tree. Journal of Discrete Algorithms. 7(4):479-499. 2009.
  • 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. 2008.