Fabrizio Frati

Fabrizio Frati

Home

Research groups:
  Graph Drawing

Publications:
  By type
  By year
  By topic

Teaching:
  Courses (Italian)
  Theses & Labs


Show all news

Fabrizio Frati

    Associate Professor

        
    fratidia.uniroma3.it
    Curriculum Vitae
    ORCID: orcid.org/0000-0001-5987-8713
    Scopus ID: 22984560500
    Google Scholar: link
    Regular mail:
    Office DIA-101
    Dipartimento di Ingegneria
    Università Roma Tre
    Via della Vasca Navale, 79
    00146, Rome, Italy
    Phone: +39-06-57333295
    Fax: +39-06-57333612

    Bio Sketch

    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 latter course are here -- Italian, and here -- English). Office hours: friday 08:30-10:00.

    Recent Publications


    • book coverFabrizio Frati, Kwan-Liu Ma
      Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers
      volume 10692 in Lecture Notes in Computer Science
      Springer
      2018.

    • Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs. Journal of Graph Algorithms and Applications. 22(2):139-176. 2018.

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

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

    Display all publications [by type] [by year] [by topic]