Fabrizio Frati

From MaRDI portal
Person:390120

Available identifiers

zbMath Open frati.fabrizioWikidataQ62057837 ScholiaQ62057837MaRDI QIDQ390120

List of research outcomes

PublicationDate of PublicationType
Upward planarity testing of biconnected outerplanar DAGs solves partition2024-04-17Paper
https://portal.mardi4nfdi.de/entity/Q61474232024-01-15Paper
Morphing planar graph drawings through 3D2023-12-16Paper
Unit-length rectangular drawings of graphs2023-08-16Paper
Testing upward planarity of partial 2-trees2023-08-16Paper
Recognizing DAGs with page-number 2 is NP-complete2023-08-16Paper
Morphing planar graph drawings through 3D2023-08-14Paper
Recognizing DAGs with page-number 2 is NP-complete2023-02-01Paper
Drawing graphs as spanners2022-12-21Paper
Drawing graphs as spanners2022-09-16Paper
From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs2022-07-01Paper
Planar straight-line realizations of 2-trees with prescribed edge lengths2022-07-01Paper
Planar rectilinear drawings of outerplanar graphs in linear time2022-04-08Paper
How to morph a tree on a small grid2022-03-22Paper
Schematic Representation of Biconnected Graphs2021-12-01Paper
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time2021-12-01Paper
Schematic Representation of Large Biconnected Graphs2021-06-17Paper
Every collinear set in a planar graph is free2021-04-29Paper
On the area requirements of planar greedy drawings of triconnected planar graphs2021-04-21Paper
On the area requirements of planar straight-line orthogonal drawings of ternary trees2021-01-25Paper
Extending upward planar graph drawings2021-01-07Paper
On the edge-length ratio of planar graphs2020-10-26Paper
Graph stories in small area2020-10-26Paper
Upward planar morphs2020-10-12Paper
On the planar edge-length ratio of planar graphs2020-09-09Paper
Graph Stories in Small Area2020-09-04Paper
Extending upward planar graph drawings2020-01-16Paper
How to morph a tree on a small grid2020-01-16Paper
On planar greedy drawings of 3-connected planar graphs2019-12-30Paper
Beyond level planarity: cyclic, torus, and simultaneous level planarity2019-12-27Paper
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs2019-11-29Paper
Every collinear set in a planar graph is free2019-10-15Paper
Pole Dancing: 3D Morphs for Tree Drawings2019-09-16Paper
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs2019-06-24Paper
Morphing Planar Graph Drawings with a Polynomial Number of Steps2019-05-15Paper
Drawing planar graphs with many collinear vertices2019-02-27Paper
Upward planar morphs2019-02-15Paper
Pole dancing: 3D morphs for tree drawings2019-02-15Paper
Testing Planarity of Partially Embedded Graphs2018-10-30Paper
On the area requirements of straight-line orthogonal drawings of ternary trees2018-09-06Paper
https://portal.mardi4nfdi.de/entity/Q45801082018-08-13Paper
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs2018-07-16Paper
Computing NodeTrix Representations of Clustered Graphs2018-01-12Paper
Stack and Queue Layouts via Layered Separators2018-01-12Paper
Intersection-Link Representations of Graphs2017-10-12Paper
Optimal Morphs of Convex Drawings2017-10-10Paper
Compatible Connectivity-Augmentation of Planar Disconnected Graphs2017-10-05Paper
How to Morph Planar Graph Drawings2017-05-30Paper
Strip planarity testing for embedded planar graphs2017-05-02Paper
A lower bound on the diameter of the flip graph2017-04-10Paper
Computing NodeTrix Representations of Clustered Graphs2017-02-21Paper
Drawing Planar Graphs with Many Collinear Vertices2017-02-21Paper
Beyond Level Planarity2017-02-21Paper
Stack and Queue Layouts via Layered Separators2017-02-21Paper
Intersection-Link Representations of Graphs2017-02-10Paper
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs2016-06-10Paper
Drawing Partially Embedded and Simultaneously Planar Graphs2016-01-07Paper
Increasing-Chord Graphs On Point Sets2016-01-07Paper
SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS2015-12-22Paper
Compatible connectivity augmentation of planar disconnected graphs2015-12-02Paper
Augmenting graphs to minimize the diameter2015-09-02Paper
Relaxing the constraints of clustered planarity2015-03-06Paper
The importance of being proper2015-01-30Paper
Multilayer Drawings of Clustered Graphs2015-01-15Paper
Drawing Partially Embedded and Simultaneously Planar Graphs2015-01-07Paper
Increasing-Chord Graphs On Point Sets2015-01-07Paper
The Importance of Being Proper2015-01-07Paper
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs2015-01-07Paper
On the number of upward planar orientations of maximal planar graphs2014-07-07Paper
Morphing Planar Graph Drawings Optimally2014-07-01Paper
Universal Point Sets for Drawing Planar Graphs with Circular Arcs2014-06-10Paper
On the Upward Planarity of Mixed Plane Graphs2014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q54176192014-05-22Paper
On the Queue Number of Planar Graphs2014-04-11Paper
https://portal.mardi4nfdi.de/entity/Q53967502014-02-03Paper
On the area requirements of Euclidean minimum spanning trees2014-01-22Paper
Augmenting graphs to minimize the diameter2014-01-14Paper
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs2014-01-14Paper
On the Upward Planarity of Mixed Plane Graphs2013-12-20Paper
Strip Planarity Testing2013-12-20Paper
Morphing Planar Graph Drawings Efficiently2013-12-20Paper
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area2013-09-25Paper
Orthogeodesic point-set embedding of trees2013-07-31Paper
On the Page Number of Upward Planar Directed Acyclic Graphs2013-06-12Paper
Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours2013-06-07Paper
Nonconvex Representations of Plane Graphs2013-04-09Paper
On Representing Graphs by Touching Cuboids2013-04-03Paper
Point-Set Embeddability of 2-Colored Trees2013-04-03Paper
On the Number of Upward Planar Orientations of Maximal Planar Graphs2013-03-21Paper
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area2013-01-07Paper
Acyclically 3-colorable planar graphs2012-12-21Paper
Multilevel Drawings of Clustered Graphs2012-09-25Paper
Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area2012-09-21Paper
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph2012-09-13Paper
Succinct greedy drawings do not always exist2012-06-29Paper
A note on isosceles planar graph drawing2012-03-12Paper
Orthogeodesic Point-Set Embedding of Trees2012-03-09Paper
On the Page Number of Upward Planar Directed Acyclic Graphs2012-03-09Paper
Monotone Drawings of Graphs2012-01-12Paper
Polynomial area bounds for MST embeddings of trees2011-12-28Paper
Simultaneous Embedding of Embedded Planar Graphs2011-12-16Paper
On the Area Requirements of Euclidean Minimum Spanning Trees2011-08-12Paper
Colored simultaneous geometric embeddings and universal pointsets2011-06-30Paper
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree2011-05-19Paper
On the Perspectives Opened by Right Angle Crossing Drawings2011-04-19Paper
Straight-line rectangular drawings of clustered graphs2011-03-10Paper
https://portal.mardi4nfdi.de/entity/Q30782052011-02-18Paper
Monotone Drawings of Graphs2011-02-11Paper
Upward Geometric Graph Embeddings into Point Sets2011-02-11Paper
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs2011-02-11Paper
Planar packing of trees and spider trees2010-06-16Paper
On the Perspectives Opened by Right Angle Crossing Drawings2010-04-27Paper
Splitting Clusters to Get C-Planarity2010-04-27Paper
Succinct Greedy Drawings Do Not Always Exist2010-04-27Paper
Crossings between Curves with Many Tangencies2010-02-09Paper
Acyclically 3-Colorable Planar Graphs2010-02-09Paper
An Algorithm to Construct Greedy Drawings of Triangulations2010-02-04Paper
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces2010-02-04Paper
Constrained Simultaneous and Near-Simultaneous Embeddings2010-02-04Paper
How to draw a clustered tree2009-12-10Paper
Upward straight-line embeddings of directed graphs into point sets2009-11-16Paper
Straight-Line Rectangular Drawings of Clustered Graphs2009-10-20Paper
On embedding a graph in the grid with the maximum number of bends and other bad features2009-08-06Paper
Small area drawings of outerplanar graphs2009-06-16Paper
An Algorithm to Construct Greedy Drawings of Triangulations2009-03-03Paper
Non-convex Representations of Graphs2009-03-03Paper
How to Draw a Clustered Tree2009-02-17Paper
Upward Straight-Line Embeddings of Directed Graphs into Point Sets2009-01-20Paper
A Lower Bound on the Area Requirements of Series-Parallel Graphs2009-01-20Paper
C-Planarity of C-Connected Clustered Graphs2009-01-19Paper
Packing and Squeezing Subgraphs into Planar Graphs2008-09-17Paper
ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS2008-08-26Paper
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs2008-07-01Paper
On the Topologies of Local Minimum Spanning Trees2008-04-17Paper
Straight-Line Orthogonal Drawings of Binary and Ternary Trees2008-03-25Paper
Constrained Simultaneous and Near-Simultaneous Embeddings2008-03-25Paper
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces2008-03-25Paper
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs2008-03-25Paper
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features2007-11-15Paper
Three-Dimensional Drawings of Bounded Degree Trees2007-08-28Paper
Embedding Graphs Simultaneously with Fixed Edges2007-08-28Paper
Graph Drawing2006-11-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Fabrizio Frati