Fabrizio Frati

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. SODA 2013: 1656-1667

Fabrizio Frati: Straight-line drawings of outerplanar graphs in O(dn log n) area. Comput. Geom. 45(9): 524-533 (2012)

Patrizio Angelini, Fabrizio Frati: Acyclically 3-colorable planar graphs. J. Comb. Optim. 24(2): 116-130 (2012)

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. J. Discrete Algorithms 14: 150-172 (2012)

Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Monotone Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 5-35 (2012)

Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Succinct greedy drawings do not always exist. Networks 59(3): 267-274 (2012)

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

Fabrizio Frati: Multilevel Drawings of Clustered Graphs. COCOON 2012: 311-322

David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides: On Representing Graphs by Touching Cuboids. Graph Drawing 2012: 187-198

Fabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat: Point-Set Embeddability of 2-Colored Trees. Graph Drawing 2012: 291-302

Tim Dwyer, Fabrizio Frati, Seok-Hee Hong, Karsten Klein: Theory and Practice of Graph Drawing. Graph Drawing 2012: 571-574

Fabrizio Frati, Joachim Gudmundsson, Emo Welzl: On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC 2012: 413-422

Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood: Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours. CoRR abs/1202.1569 (2012)

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli: Beyond Clustered Planarity. CoRR abs/1207.3934 (2012)

Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011)

Fabrizio Frati, Michael Kaufmann: Polynomial area bounds for MST embeddings of trees. Comput. Geom. 44(9): 529-543 (2011)

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

Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis: On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011)

Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug: Orthogeodesic Point-Set Embedding of Trees. Graph Drawing 2011: 52-63

Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas: On the Page Number of Upward Planar Directed Acyclic Graphs. Graph Drawing 2011: 391-402

Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Simultaneous Embedding of Embedded Planar Graphs. ISAAC 2011: 271-280

Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella: On the Area Requirements of Euclidean Minimum Spanning Trees. WADS 2011: 25-36

Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta: Upward straight-line embeddings of directed graphs into point sets. Comput. Geom. 43(2): 219-232 (2010)

Fabrizio Frati: Lower Bounds on the Area Requirements of Series-Parallel Graphs. Discrete Mathematics & Theoretical Computer Science 12(5): 139-174 (2010)

Fabrizio Frati: A note on isosceles planar graph drawing. Inf. Process. Lett. 110(12-13): 507-509 (2010)

Patrizio Angelini, Fabrizio Frati, Luca Grilli: An Algorithm to Construct Greedy Drawings of Triangulations. J. Graph Algorithms Appl. 14(1): 19-51 (2010)

Giuseppe Di Battista, Fabrizio Frati, János Pach: On the Queue Number of Planar Graphs. FOCS 2010: 365-374

Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Monotone Drawings of Graphs. Graph Drawing 2010: 13-24

Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis: Upward Geometric Graph Embeddings into Point Sets. Graph Drawing 2010: 25-37

Fabrizio Frati: Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs. Graph Drawing 2010: 220-225

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. IWOCA 2010: 212-225

Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter: Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221

Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi: Crossings between Curves with Many Tangencies. WALCOM 2010: 1-8

Patrizio Angelini, Fabrizio Frati: Acyclically 3-Colorable Planar Graphs. WALCOM 2010: 113-124

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

Fabrizio Frati, Markus Geyer, Michael Kaufmann: Planar packing of trees and spider trees. Inf. Process. Lett. 109(6): 301-307 (2009)

Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati: How to draw a clustered tree. J. Discrete Algorithms 7(4): 479-499 (2009)

Giuseppe Di Battista, Fabrizio Frati: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. J. Graph Algorithms Appl. 13(3): 349-378 (2009)

Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov: Constrained Simultaneous and Near-Simultaneous Embeddings. J. Graph Algorithms Appl. 13(3): 447-465 (2009)

Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. Theory Comput. Syst. 44(2): 143-159 (2009)

Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta: On Directed Graphs with an Upward Straight-line. CCCG 2009: 21-24

Fabrizio Frati: Planar Packing of Diameter-Four Trees. CCCG 2009: 95-98

Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis: On the Perspectives Opened by Right Angle Crossing Drawings. Graph Drawing 2009: 21-32

Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani: Splitting Clusters to Get C-Planarity. Graph Drawing 2009: 57-68

Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati: Succinct Greedy Drawings Do Not Always Exist. Graph Drawing 2009: 171-182

Patrizio Angelini, Fabrizio Frati, Michael Kaufmann: Straight-Line Rectangular Drawings of Clustered Graphs. WADS 2009: 25-36

Fabrizio Frati: On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. Int. J. Comput. Geometry Appl. 18(3): 251-271 (2008)

Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia: C-Planarity of C-Connected Clustered Graphs. J. Graph Algorithms Appl. 12(2): 225-262 (2008)

Patrizio Angelini, Fabrizio Frati, Luca Grilli: An Algorithm to Construct Greedy Drawings of Triangulations. Graph Drawing 2008: 26-37

Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Non-convex Representations of Graphs. Graph Drawing 2008: 390-395

Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov: Upward Straight-Line Embeddings of Directed Graphs into Point Sets. WG 2008: 122-133

Fabrizio Frati: A Lower Bound on the Area Requirements of Series-Parallel Graphs. WG 2008: 159-170

Fabrizio Frati: Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. CCCG 2007: 225-228

Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263

Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. FUN 2007: 1-13

Fabrizio Frati: Straight-Line Orthogonal Drawings of Binary and Ternary Trees. Graph Drawing 2007: 76-87

Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov: Constrained Simultaneous and Near-Simultaneous Embeddings. Graph Drawing 2007: 268-279

Giuseppe Di Battista, Fabrizio Frati: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. Graph Drawing 2007: 291-302

Fabrizio Frati, Maurizio Patrignani: A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. Graph Drawing 2007: 339-344

Fabrizio Frati, Markus Geyer, Michael Kaufmann: Packing and Squeezing Subgraphs into Planar Graphs. MFCS 2007: 394-405

Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati: How to Draw a Clustered Tree. WADS 2007: 89-101

Fabrizio Frati: On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. WG 2007: 133-144

Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta: On the Topologies of Local Minimum Spanning Trees. CAAN 2006: 31-44

Fabrizio Frati, Giuseppe Di Battista: Three-Dimensional Drawings of Bounded Degree Trees. Graph Drawing 2006: 89-94

Fabrizio Frati: Embedding Graphs Simultaneously with Fixed Edges. Graph Drawing 2006: 108-113

Giuseppe Di Battista, Fabrizio Frati: Small Area Drawings of Outerplanar Graphs. Graph Drawing 2005: 89-100