Dipartimento di Ingegneria
Università Roma Tre
Via della Vasca Navale, 79
00146, Rome, Italy
Phone: +39-06-57333295 Fax: +39-06-57333612
Fabrizio Frati is currently associate professor at the Department of Engineering of Roma Tre University. Previously, he was a Ph.D. student at Roma Tre University, a postdoc at EPFL Lausanne, and a researcher at The University of Sydney. His current research interests include graph drawing, combinatorial and algorithmic graph theory, and computational geometry. Currently teaching: Fondamenti di Informatica for Computer Scientists and Fondamenti di Informatica for Civil Engineers (the topics covered by the course are here -- Italian, and here -- English).
Office hours: Tuesday 12:00-14:00.
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. 2017. To appear.
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.
Fabrizio Frati. A Lower Bound on the Diameter of the Flip Graph. Electronic Journal of Combinatorics. 24(1):1-6. 2017. Article 43.
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]
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.