Fabrizio Frati

Theor. Comput. Sci., 2024

Testing the planar straight-line realizability of 2-trees with prescribed edge lengths.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

Weakly Leveled Planarity with Bounded Span.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Upward Pointset Embeddings of Planar st-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Universal geometric graphs.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Michael Hoffmann

Csaba D. Tóth

Comb. Probab. Comput., September, 2023

Recognizing DAGs with page-number 2 is NP-complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

Morphing Planar Graph Drawings Through 3D.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

2022

How to Morph a Tree on a Small Grid.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Drawing Graphs as Spanners.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Planar rectilinear drawings of outerplanar graphs in linear time.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Comput. Geom., 2022

Testing Upward Planarity of Partial 2-Trees.

[BibT_eX]

[DOI]

Kirill Simonov

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Unit-length Rectangular Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Parameterized Algorithms for Upward Planarity.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Kirill Simonov

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

On the area requirements of planar straight-line orthogonal drawings of ternary trees.

[BibT_eX]

[DOI]

Barbara Covella

Theor. Comput. Sci., 2021

Schematic Representation of Large Biconnected Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

Every Collinear Set in a Planar Graph is Free.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

Beyond level planarity: Cyclic, torus, and simultaneous level planarity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the planar edge-length ratio of planar graphs.

[BibT_eX]

[DOI]

Manuel Borrazzo

J. Comput. Geom., 2020

Graph Stories in Small Area.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs.

[BibT_eX]

[DOI]

Vincenzo Roselli

J. Comput. Syst. Sci., 2020

On Planar Greedy Drawings of 3-Connected Planar Graphs.

[BibT_eX]

[DOI]

Giordano Da Lozzo

Anthony D'Angelo

Discret. Comput. Geom., 2020

Extending upward planar graph drawings.

[BibT_eX]

[DOI]

Giordano Da Lozzo

Comput. Geom., 2020

Upward Planar Morphs.

[BibT_eX]

[DOI]

Algorithmica, 2020

Schematic Representation of Biconnected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs.

[BibT_eX]

[DOI]

Giordano Da Lozzo

Anthony D'Angelo

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Simultaneous Embeddings with Few Bends and Crossings.

[BibT_eX]

[DOI]

Michael Hoffmann

Vincent Kusters

J. Graph Algorithms Appl., 2019

Pole Dancing: 3D Morphs for Tree Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Graph Stories in Small Area.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

On the Edge-Length Ratio of Planar Graphs.

[BibT_eX]

[DOI]

Manuel Borrazzo

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

Drawing planar graphs with many collinear vertices.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Computing NodeTrix Representations of Clustered Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Guest editors' foreword.

[BibT_eX]

[DOI]

Kwan-Liu Ma

J. Graph Algorithms Appl., 2018

Stack and Queue Layouts via Layered Separators.

[BibT_eX]

[DOI]

Vida Dujmovic

J. Graph Algorithms Appl., 2018

On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees.

[BibT_eX]

[DOI]

Barbara Covella

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

How to Morph Planar Graph Drawings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Intersection-Link Representations of Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

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

[BibT_eX]

[DOI]

Kwan-Liu Ma

CoRR, 2017

A Lower Bound on the Diameter of the Flip Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Strip Planarity Testing for Embedded Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Clustered Graph Drawing.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Beyond Level Planarity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

The importance of being proper: (In clustered-level planarity and T-level planarity).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Testing Planarity of Partially Embedded Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

Increasing-Chord Graphs On Point Sets.

[BibT_eX]

[DOI]

Hooman Reisi Dehkordi

Joachim Gudmundsson

J. Graph Algorithms Appl., 2015

Drawing Partially Embedded and Simultaneously Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Compatible Connectivity Augmentation of Planar Disconnected Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Testing Cyclic Level and Simultaneous Level Planarity.

[BibT_eX]

[DOI]

CoRR, 2015

Relaxing the constraints of clustered planarity.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Augmenting Graphs to Minimize the Diameter.

[BibT_eX]

[DOI]

Algorithmica, 2015

On the Relationship Between Map Graphs and Clique Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Optimal Morphs of Convex Drawings.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

On the number of upward planar orientations of maximal planar graphs.

[BibT_eX]

[DOI]

Joachim Gudmundsson

Emo Welzl

Theor. Comput. Sci., 2014

On the Upward Planarity of Mixed Plane Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Multilayer Drawings of Clustered Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

A Survey on Small-Area Planar Graph Drawing.

[BibT_eX]

[DOI]

CoRR, 2014

On the Complexity of Clustered-Level Planarity and T-Level Planarity.

[BibT_eX]

[DOI]

CoRR, 2014

On the area requirements of Euclidean minimum spanning trees.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Morphing Planar Graph Drawings Optimally.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

On the Queue Number of Planar Graphs.

[BibT_eX]

[DOI]

János Pach

SIAM J. Comput., 2013

On the Page Number of Upward Planar Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Radoslav Fulek

Andres J. Ruiz-Vargas

J. Graph Algorithms Appl., 2013

Simultaneous Embedding of Embedded Planar graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2013

Morphing Planar Graphs Drawings Efficiently.

[BibT_eX]

[DOI]

CoRR, 2013

Orthogeodesic point-set embedding of trees.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Nonrepetitive Colourings of Planar Graphs with O(log n) Colours.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Morphing Planar Graph Drawings with a Polynomial Number of Steps.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Strip Planarity Testing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Morphing Planar Graph Drawings Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Universal Point Sets for Planar Graph Drawings with Circular Arcs.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Nonconvex Representations of Plane Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Succinct greedy drawings do not always exist.

[BibT_eX]

[DOI]

Networks, 2012

Monotone Drawings of Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Acyclically 3-colorable planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Beyond Clustered Planarity

[BibT_eX]

[DOI]

CoRR, 2012

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

[BibT_eX]

[DOI]

Comput. Geom., 2012

Point-Set Embeddability of 2-Colored Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Theory and Practice of Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

On Representing Graphs by Touching Cuboids.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Multilevel Drawings of Clustered Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

On the Perspectives Opened by Right Angle Crossing Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Straight-Line Rectangular Drawings of Clustered Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

Polynomial area bounds for MST embeddings of trees.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.

[BibT_eX]

[DOI]

Ulrik Brandes

Cesim Erten

Algorithmica, 2011

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010

An Algorithm to Construct Greedy Drawings of Triangulations.

[BibT_eX]

[DOI]

Luca Grilli

J. Graph Algorithms Appl., 2010

A note on isosceles planar graph drawing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Lower Bounds on the Area Requirements of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

Upward straight-line embeddings of directed graphs into point sets.

[BibT_eX]

[DOI]

Carla Binucci

Emilio Di Giacomo

Walter Didimo

Giuseppe Liotta

Comput. Geom., 2010

Crossings between Curves with Many Tangencies.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Upward Geometric Graph Embeddings into Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Constrained Simultaneous and Near-Simultaneous Embeddings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

How to draw a clustered tree.

[BibT_eX]

[DOI]

Guido Drovandi

J. Discrete Algorithms, 2009

Planar packing of trees and spider trees.

[BibT_eX]

[DOI]

Markus Geyer

Inf. Process. Lett., 2009

Small Area Drawings of Outerplanar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2009

Splitting Clusters to Get C-Planarity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Planar Packing of Diameter-Four Trees.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

On Directed Graphs with an Upward Straight-line.

[BibT_eX]

[DOI]

Carla Binucci

Emilio Di Giacomo

Walter Didimo

Giuseppe Liotta

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

C-Planarity of C-Connected Clustered Graphs.

[BibT_eX]

[DOI]

Pier Francesco Cortese

J. Graph Algorithms Appl., 2008

On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2008

A Lower Bound on the Area Requirements of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Upward Straight-Line Embeddings of Directed Graphs into Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Non-convex Representations of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Packing and Squeezing Subgraphs into Planar Graphs.

[BibT_eX]

[DOI]

Markus Geyer

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

A Note on Minimum-Area Straight-Line Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Straight-Line Orthogonal Drawings of Binary and Ternary Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Colored Simultaneous Geometric Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Three-Dimensional Drawings of Bounded Degree Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Embedding Graphs Simultaneously with Fixed Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

On the Topologies of Local Minimum Spanning Trees.

[BibT_eX]

[DOI]

Pier Francesco Cortese