Fabrizio Frati

According to our database1, Fabrizio Frati authored at least 102 papers between 2006 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Beyond level planarity: Cyclic, torus, and simultaneous level planarity.
Theor. Comput. Sci., 2020

LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs.
J. Comput. Syst. Sci., 2020

On Planar Greedy Drawings of 3-Connected Planar Graphs.
Discrete & Computational Geometry, 2020

Drawing Graphs as Spanners.
CoRR, 2020

2019
Simultaneous Embeddings with Few Bends and Crossings.
J. Graph Algorithms Appl., 2019

Pole Dancing: 3D Morphs for Tree Drawings.
J. Graph Algorithms Appl., 2019

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs.
Int. J. Found. Comput. Sci., 2019

Graph Stories in Small Area.
CoRR, 2019

On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees.
CoRR, 2019

Extending Upward Planar Graph Drawings.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

How to Morph a Tree on a Small Grid.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Every Collinear Set in a Planar Graph Is Free.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Graph Stories in Small Area.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

On the Edge-Length Ratio of Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018
Drawing planar graphs with many collinear vertices.
JoCG, 2018

Computing NodeTrix Representations of Clustered Graphs.
J. Graph Algorithms Appl., 2018

Guest editors' foreword.
J. Graph Algorithms Appl., 2018

Stack and Queue Layouts via Layered Separators.
J. Graph Algorithms Appl., 2018

On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Upward Planar Morphs.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
How to Morph Planar Graph Drawings.
SIAM J. Comput., 2017

Intersection-Link Representations of Graphs.
J. Graph Algorithms Appl., 2017

Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017).
CoRR, 2017

A Lower Bound on the Diameter of the Flip Graph.
Electr. J. Comb., 2017

Strip Planarity Testing for Embedded Planar Graphs.
Algorithmica, 2017

2016
Clustered Graph Drawing.
Encyclopedia of Algorithms, 2016

SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs.
Journal of Graph Theory, 2016

Beyond Level Planarity.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
The importance of being proper: (In clustered-level planarity and T-level planarity).
Theor. Comput. Sci., 2015

Testing Planarity of Partially Embedded Graphs.
ACM Trans. Algorithms, 2015

Increasing-Chord Graphs On Point Sets.
J. Graph Algorithms Appl., 2015

Drawing Partially Embedded and Simultaneously Planar Graphs.
J. Graph Algorithms Appl., 2015

Compatible Connectivity Augmentation of Planar Disconnected Graphs.
Discrete & Computational Geometry, 2015

Testing Cyclic Level and Simultaneous Level Planarity.
CoRR, 2015

Relaxing the constraints of clustered planarity.
Comput. Geom., 2015

Augmenting Graphs to Minimize the Diameter.
Algorithmica, 2015

On the Relationship Between Map Graphs and Clique Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Optimal Morphs of Convex Drawings.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
On the number of upward planar orientations of maximal planar graphs.
Theor. Comput. Sci., 2014

On the Upward Planarity of Mixed Plane Graphs.
J. Graph Algorithms Appl., 2014

Multilayer Drawings of Clustered Graphs.
J. Graph Algorithms Appl., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.
J. Graph Algorithms Appl., 2014

A Survey on Small-Area Planar Graph Drawing.
CoRR, 2014

On the Complexity of Clustered-Level Planarity and T-Level Planarity.
CoRR, 2014

On the area requirements of Euclidean minimum spanning trees.
Comput. Geom., 2014

Morphing Planar Graph Drawings Optimally.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
On the Queue Number of Planar Graphs.
SIAM J. Comput., 2013

On the Page Number of Upward Planar Directed Acyclic Graphs.
J. Graph Algorithms Appl., 2013

Simultaneous Embedding of Embedded Planar graphs.
Int. J. Comput. Geometry Appl., 2013

Morphing Planar Graphs Drawings Efficiently.
CoRR, 2013

Orthogeodesic point-set embedding of trees.
Comput. Geom., 2013

Nonrepetitive Colourings of Planar Graphs with O(log n) Colours.
Electr. J. Comb., 2013

Morphing Planar Graph Drawings with a Polynomial Number of Steps.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Strip Planarity Testing.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Morphing Planar Graph Drawings Efficiently.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Universal Point Sets for Planar Graph Drawings with Circular Arcs.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Nonconvex Representations of Plane Graphs.
SIAM J. Discrete Math., 2012

Succinct greedy drawings do not always exist.
Networks, 2012

Monotone Drawings of Graphs.
J. Graph Algorithms Appl., 2012

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph.
J. Discrete Algorithms, 2012

Acyclically 3-colorable planar graphs.
J. Comb. Optim., 2012

Beyond Clustered Planarity
CoRR, 2012

Straight-line drawings of outerplanar graphs in O(dn log n) area.
Comput. Geom., 2012

Point-Set Embeddability of 2-Colored Trees.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Theory and Practice of Graph Drawing.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

On Representing Graphs by Touching Cuboids.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Multilevel Drawings of Clustered Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
On the Perspectives Opened by Right Angle Crossing Drawings.
J. Graph Algorithms Appl., 2011

Straight-Line Rectangular Drawings of Clustered Graphs.
Discrete & Computational Geometry, 2011

Polynomial area bounds for MST embeddings of trees.
Comput. Geom., 2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.
Algorithmica, 2011

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010
An Algorithm to Construct Greedy Drawings of Triangulations.
J. Graph Algorithms Appl., 2010

A note on isosceles planar graph drawing.
Inf. Process. Lett., 2010

Lower Bounds on the Area Requirements of Series-Parallel Graphs.
Discrete Mathematics & Theoretical Computer Science, 2010

Upward straight-line embeddings of directed graphs into point sets.
Comput. Geom., 2010

Crossings between Curves with Many Tangencies.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Upward Geometric Graph Embeddings into Point Sets.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features.
Theory Comput. Syst., 2009

Constrained Simultaneous and Near-Simultaneous Embeddings.
J. Graph Algorithms Appl., 2009

Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.
J. Graph Algorithms Appl., 2009

How to draw a clustered tree.
J. Discrete Algorithms, 2009

Planar packing of trees and spider trees.
Inf. Process. Lett., 2009

Small Area Drawings of Outerplanar Graphs.
Algorithmica, 2009

Splitting Clusters to Get C-Planarity.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Planar Packing of Diameter-Four Trees.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

On Directed Graphs with an Upward Straight-line.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
C-Planarity of C-Connected Clustered Graphs.
J. Graph Algorithms Appl., 2008

On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs.
Int. J. Comput. Geometry Appl., 2008

A Lower Bound on the Area Requirements of Series-Parallel Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Upward Straight-Line Embeddings of Directed Graphs into Point Sets.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Non-convex Representations of Graphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

2007
Packing and Squeezing Subgraphs into Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

A Note on Minimum-Area Straight-Line Drawings of Planar Graphs.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Straight-Line Orthogonal Drawings of Binary and Ternary Trees.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Colored Simultaneous Geometric Embeddings.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Three-Dimensional Drawings of Bounded Degree Trees.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

Embedding Graphs Simultaneously with Fixed Edges.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

On the Topologies of Local Minimum Spanning Trees.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006


  Loading...