Dr Fabrizio Frati

PhD Computer Science
Postdoctoral Research Associate
School of Information Technologies

J12 - The School of Information Technologies
The University of Sydney

Telephone +61 2 9351 4275
Fax +61 2 9351 3838

Website School of Information Technologies

Selected grants

2014

  • Morphing Graph Drawings; Frati F; Australian Research Council (ARC)/Discovery Early Career Researcher Award (DECRA).

Selected publications

Download citations: PDF RTF Endnote

Journals

  • Frati, F. (2014). A note on isosceles planar graph drawing. Information Processing Letters, 110(12-13), 507-509. [More Information]
  • Angelini, P., Frati, F. (2014). Acyclically 3-colorable planar graphs. Journal of Combinatorial Optimization, 24(2), 116-130. [More Information]
  • Angelini, P., Bruckdorfer, T., Chiesa, M., Frati, F., Kaufmann, M., Squarcella, C. (2014). On the area requirements of Euclidean minimum spanning trees. Computational Geometry, 47(2), 200-213. [More Information]
  • Frati, F., Kaufmann, M. (2014). Polynomial area bounds for MST embeddings of trees. Computational Geometry, 44(9), 529-543. [More Information]
  • Di Battista, G., Frati, F. (2014). Small Area Drawings of Outerplanar Graphs. Algorithmica: an international journal in computer science, 54(1), 25-53. [More Information]
  • Angelini, P., Di Battista, G., Frati, F. (2014). Succinct greedy drawings do not always exist. Networks, 59(3), 267-274. [More Information]
  • Binucci, C., Di Giacomo, E., Didimo, W., Estrella-Balderrama, A., Frati, F., Kobourov, S., Liotta, G. (2014). Upward straight-line embeddings of directed graphs into point sets. Computational Geometry, 43(2), 219-232. [More Information]
  • Frati, F., Dujmovic, V., joret, G., Wood, D. (2013). Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. The Electronic Journal of Combinatorics, 20(1), 1-6.
  • Frati, F., Fulek, R., Ruiz-Vargas, A. (2013). On the Page Number of Upward Planar Directed Acyclic Graphs. Journal of Graph Algorithms and Applications, 17(3), 221-244. [More Information]
  • Di Battista, G., Frati, F., Pach, J. (2013). On The Queue Number Of Planar Graphs. SIAM Journal on Computing, 42(6), 2243-2285. [More Information]
  • Di Giacomo, E., Frati, F., Fulek, R., Grilli, L., Krug, M. (2013). Orthogeodesic point-set embedding of trees. Computational Geometry, 46(8), 929-944. [More Information]
  • Angelini, P., Di Battista, G., Frati, F. (2013). Simultaneous embedding of embedded planar graphs. International Journal of Computational Geometry and Applications, 23(2), 93-126. [More Information]
  • Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M. (2012). Monotone drawings of graphs. Journal of Graph Algorithms and Applications, 16(1), 5-35.
  • Frati, F. (2012). Multilevel drawings of clustered graphs. Lecture Notes in Computer Science (LNCS), 7434, 311-322.
  • Di Battista, G., Frati, F., Patrignani, M. (2012). Nonconvex Representations of Plane Graphs. SIAM Journal on Discrete Mathematics, 26(4), 1670-1681. [More Information]
  • Frati, F. (2012). Straight-line drawings of outerplanar graphs in View the MathML sourceO(dnlogn) area. Computational Geometry, 45(9), 524-533. [More Information]
  • Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I. (2012). Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. Journal of Discrete Algorithms (Amsterdam), 14(July 2012), 150-172. [More Information]
  • Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A. (2011). On the Perspectives Opened by Right Angle Crossing Drawings. Journal of Graph Algorithms and Applications, 15(1), 53-78.
  • Angelini, P., Frati, F., Kaufmann, M. (2011). Straight-Line Rectangular Drawings of Clustered Graphs. Computational Geometry, 45(1), 88-140. [More Information]
  • Angelini, P., Frati, F., Grilli, L. (2010). An Algorithm to Construct Greedy Drawings of Triangulations. Journal of Graph Algorithms and Applications, 14(1), 19-51.
  • Frati, F., Kaufmann, M., Kobourov, S. (2009). Constrained Simultaneous and Near-Simultaneous Embeddings. Journal of Graph Algorithms and Applications, 13(3), 447-465. [More Information]
  • Di Battista, G., Frati, F. (2009). Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. Journal of Graph Algorithms and Applications, 13(3), 349-378. [More Information]
  • Di Battista, G., Drovandi, G., Frati, F. (2009). How to draw a clustered tree. Journal of Discrete Algorithms (Amsterdam), 7(4), 479-499. [More Information]
  • Di Battista, G., Frati, F., Patrignani, M. (2009). On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. Theory of Computing Systems, 44(2), 143-159. [More Information]
  • Frati, F., Geyer, M., Kaufmann, M. (2009). Planar packing of trees and spider trees. Information Processing Letters, 109(6), 301-307. [More Information]
  • Frati, F. (2008). C-Planarity of C-Connected Clustered Graphs. Journal of Graph Algorithms and Applications, 12(2), 225-262. [More Information]
  • Frati, F. (2008). 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. [More Information]

Conferences

  • Angelini, P., Eppstein, D., Frati, F., Kaufmann, M., Lazard, S., Mchedlidze, T., Teillaud, M., Wolff, A. (2014). Universal Point Sets for Planar Graph Drawings with Circular Arcs. The 25th Canadian Conference on Computational Geometry, Waterloo: University of Waterloo.
  • Frati, F., Gaspers, S., Gudmundsson, J., Mathieson, L. (2013). Augmenting graphs to minimize the diameter. The 24th International Symposium on Algorithms and Computation (ISAAC 2013), Berlin Heidelberg: Springer. [More Information]
  • Angelini, P., Frati, F., Patrignani, M., Roselli, V. (2013). Morphing planar graph drawings efficiently. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
  • Frati, F., Alamdari, S., Angelini, P., Chan, T., Di Battista, G., Lubiw, A., Patrignani, M., Roselli, V., Singla, S., Wilkinson, B. (2013). Morphing planar graph drawings with a polynomial number of steps. 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, LA; United States: Association for Computing Machinery (ACM).
  • Bremner, D., Evans, W., Frati, F., Heyer, L., Kobourov, S., Lenhart, W., Liotta, G., Rappaport, D., Whitesides, S. (2013). On Representing Graphs by Touching Cuboids. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Frati, F., Kaufmann, M., Pach, J., Toth, C., Wood, D. (2013). On the upward planarity of mixed plane graphs. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
  • Frati, F., Glisse, M., Lenhart, W., Liotta, G., Mchedlidze, T., Nishat, R. (2013). Point-Set Embeddability of 2-Colored Trees. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Angelini, P., Evans, W., Frati, F., Gudmundsson, J. (2013). SEFE with no mapping via large induced outerplane graphs in plane graphs. The 24th International Symposium on Algorithms and Computation (ISAAC 2013), Berlin Heidelberg: Springer. [More Information]
  • Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F. (2013). Strip Planarity Testing. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
  • Dwyer, T., Frati, F., Hong, S., Klein, K. (2013). Theory and Practice of Graph Drawing. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Frati, F., Gudmundsson, J., Welzl, E. (2012). On the Number of Upward Planar Orientations of Maximal Planar Graphs. The 23rd International Symposium on Algorithms and Computation (ISAAC 2012), Heidelberg: Springer. [More Information]
  • Frati, F., Fulek, R., Ruiz-Vargas, A. (2012). On the Page Number of Upward Planar Directed Acyclic Graphs. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer.
  • Di Giacomo, E., Frati, F., Fulek, R., Grilli, L., Krug, M. (2012). Orthogeodesic Point-Set Embedding of Trees. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer.
  • Angelini, P., Di Battista, G., Frati, F. (2011). Simultaneous Embedding of Embedded Planar Graphs. 22nd International Symposium on Algorithms and Computation ISAAC 2011, Heidelberg, Germany: Springer. [More Information]

2014

  • Frati, F. (2014). A note on isosceles planar graph drawing. Information Processing Letters, 110(12-13), 507-509. [More Information]
  • Angelini, P., Frati, F. (2014). Acyclically 3-colorable planar graphs. Journal of Combinatorial Optimization, 24(2), 116-130. [More Information]
  • Angelini, P., Bruckdorfer, T., Chiesa, M., Frati, F., Kaufmann, M., Squarcella, C. (2014). On the area requirements of Euclidean minimum spanning trees. Computational Geometry, 47(2), 200-213. [More Information]
  • Frati, F., Kaufmann, M. (2014). Polynomial area bounds for MST embeddings of trees. Computational Geometry, 44(9), 529-543. [More Information]
  • Di Battista, G., Frati, F. (2014). Small Area Drawings of Outerplanar Graphs. Algorithmica: an international journal in computer science, 54(1), 25-53. [More Information]
  • Angelini, P., Di Battista, G., Frati, F. (2014). Succinct greedy drawings do not always exist. Networks, 59(3), 267-274. [More Information]
  • Angelini, P., Eppstein, D., Frati, F., Kaufmann, M., Lazard, S., Mchedlidze, T., Teillaud, M., Wolff, A. (2014). Universal Point Sets for Planar Graph Drawings with Circular Arcs. The 25th Canadian Conference on Computational Geometry, Waterloo: University of Waterloo.
  • Binucci, C., Di Giacomo, E., Didimo, W., Estrella-Balderrama, A., Frati, F., Kobourov, S., Liotta, G. (2014). Upward straight-line embeddings of directed graphs into point sets. Computational Geometry, 43(2), 219-232. [More Information]

2013

  • Frati, F., Gaspers, S., Gudmundsson, J., Mathieson, L. (2013). Augmenting graphs to minimize the diameter. The 24th International Symposium on Algorithms and Computation (ISAAC 2013), Berlin Heidelberg: Springer. [More Information]
  • Angelini, P., Frati, F., Patrignani, M., Roselli, V. (2013). Morphing planar graph drawings efficiently. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
  • Frati, F., Alamdari, S., Angelini, P., Chan, T., Di Battista, G., Lubiw, A., Patrignani, M., Roselli, V., Singla, S., Wilkinson, B. (2013). Morphing planar graph drawings with a polynomial number of steps. 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, LA; United States: Association for Computing Machinery (ACM).
  • Frati, F., Dujmovic, V., joret, G., Wood, D. (2013). Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. The Electronic Journal of Combinatorics, 20(1), 1-6.
  • Bremner, D., Evans, W., Frati, F., Heyer, L., Kobourov, S., Lenhart, W., Liotta, G., Rappaport, D., Whitesides, S. (2013). On Representing Graphs by Touching Cuboids. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Frati, F., Fulek, R., Ruiz-Vargas, A. (2013). On the Page Number of Upward Planar Directed Acyclic Graphs. Journal of Graph Algorithms and Applications, 17(3), 221-244. [More Information]
  • Di Battista, G., Frati, F., Pach, J. (2013). On The Queue Number Of Planar Graphs. SIAM Journal on Computing, 42(6), 2243-2285. [More Information]
  • Frati, F., Kaufmann, M., Pach, J., Toth, C., Wood, D. (2013). On the upward planarity of mixed plane graphs. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
  • Di Giacomo, E., Frati, F., Fulek, R., Grilli, L., Krug, M. (2013). Orthogeodesic point-set embedding of trees. Computational Geometry, 46(8), 929-944. [More Information]
  • Frati, F., Glisse, M., Lenhart, W., Liotta, G., Mchedlidze, T., Nishat, R. (2013). Point-Set Embeddability of 2-Colored Trees. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Angelini, P., Evans, W., Frati, F., Gudmundsson, J. (2013). SEFE with no mapping via large induced outerplane graphs in plane graphs. The 24th International Symposium on Algorithms and Computation (ISAAC 2013), Berlin Heidelberg: Springer. [More Information]
  • Angelini, P., Di Battista, G., Frati, F. (2013). Simultaneous embedding of embedded planar graphs. International Journal of Computational Geometry and Applications, 23(2), 93-126. [More Information]
  • Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F. (2013). Strip Planarity Testing. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
  • Dwyer, T., Frati, F., Hong, S., Klein, K. (2013). Theory and Practice of Graph Drawing. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]

2012

  • Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M. (2012). Monotone drawings of graphs. Journal of Graph Algorithms and Applications, 16(1), 5-35.
  • Frati, F. (2012). Multilevel drawings of clustered graphs. Lecture Notes in Computer Science (LNCS), 7434, 311-322.
  • Di Battista, G., Frati, F., Patrignani, M. (2012). Nonconvex Representations of Plane Graphs. SIAM Journal on Discrete Mathematics, 26(4), 1670-1681. [More Information]
  • Frati, F., Gudmundsson, J., Welzl, E. (2012). On the Number of Upward Planar Orientations of Maximal Planar Graphs. The 23rd International Symposium on Algorithms and Computation (ISAAC 2012), Heidelberg: Springer. [More Information]
  • Frati, F., Fulek, R., Ruiz-Vargas, A. (2012). On the Page Number of Upward Planar Directed Acyclic Graphs. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer.
  • Di Giacomo, E., Frati, F., Fulek, R., Grilli, L., Krug, M. (2012). Orthogeodesic Point-Set Embedding of Trees. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer.
  • Frati, F. (2012). Straight-line drawings of outerplanar graphs in View the MathML sourceO(dnlogn) area. Computational Geometry, 45(9), 524-533. [More Information]
  • Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I. (2012). Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. Journal of Discrete Algorithms (Amsterdam), 14(July 2012), 150-172. [More Information]

2011

  • Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A. (2011). On the Perspectives Opened by Right Angle Crossing Drawings. Journal of Graph Algorithms and Applications, 15(1), 53-78.
  • Angelini, P., Di Battista, G., Frati, F. (2011). Simultaneous Embedding of Embedded Planar Graphs. 22nd International Symposium on Algorithms and Computation ISAAC 2011, Heidelberg, Germany: Springer. [More Information]
  • Angelini, P., Frati, F., Kaufmann, M. (2011). Straight-Line Rectangular Drawings of Clustered Graphs. Computational Geometry, 45(1), 88-140. [More Information]

2010

  • Angelini, P., Frati, F., Grilli, L. (2010). An Algorithm to Construct Greedy Drawings of Triangulations. Journal of Graph Algorithms and Applications, 14(1), 19-51.

2009

  • Frati, F., Kaufmann, M., Kobourov, S. (2009). Constrained Simultaneous and Near-Simultaneous Embeddings. Journal of Graph Algorithms and Applications, 13(3), 447-465. [More Information]
  • Di Battista, G., Frati, F. (2009). Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. Journal of Graph Algorithms and Applications, 13(3), 349-378. [More Information]
  • Di Battista, G., Drovandi, G., Frati, F. (2009). How to draw a clustered tree. Journal of Discrete Algorithms (Amsterdam), 7(4), 479-499. [More Information]
  • Di Battista, G., Frati, F., Patrignani, M. (2009). On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. Theory of Computing Systems, 44(2), 143-159. [More Information]
  • Frati, F., Geyer, M., Kaufmann, M. (2009). Planar packing of trees and spider trees. Information Processing Letters, 109(6), 301-307. [More Information]

2008

  • Frati, F. (2008). C-Planarity of C-Connected Clustered Graphs. Journal of Graph Algorithms and Applications, 12(2), 225-262. [More Information]
  • Frati, F. (2008). 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. [More Information]

For support on your academic profile contact .