Patrizio Angelini

Alessandra Tappini

Algorithmica, February, 2024

2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth.

[BibT_eX]

[DOI]

Comput. J., 2024

2023

Morphing Triangle Contact Representations of Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., October, 2023

Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario.

[BibT_eX]

[DOI]

Algorithmica, September, 2023

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Reinhard von Hanxleden

J. Graph Algorithms Appl., 2023

Splitting Vertices in 2-Layer Graph Drawings.

[BibT_eX]

[DOI]

IEEE Computer Graphics and Applications, 2023

Axis-Parallel Right Angle Crossing Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

On mixed linear layouts of series-parallel graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On morphs of 1-plane graphs.

[BibT_eX]

[DOI]

Maximilian Pfister

J. Comput. Geom., 2022

Planar L-Drawings of Bimodal Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

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

[BibT_eX]

[DOI]

Reinhard von Hanxleden

CoRR, 2022

On Upward-Planar L-Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

RAC Drawings of Graphs with Low Degree.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Extending Partial Orthogonal Drawings.

[BibT_eX]

[DOI]

T. P. Sandhya

J. Graph Algorithms Appl., 2021

On Morphing 1-Planar Drawings.

[BibT_eX]

[DOI]

Maximilian Pfister

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons.

[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 RAC drawings of graphs with one bend per edge.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Simple k-planar graphs are simple (k + 1)-quasiplanar.

[BibT_eX]

[DOI]

Csaba D. Tóth

J. Comb. Theory, Ser. B, 2020

Graph Planarity by Replacing Cliques with Paths.

[BibT_eX]

[DOI]

Algorithms, 2020

Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting.

[BibT_eX]

[DOI]

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

2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth.

[BibT_eX]

[DOI]

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

Beyond Clustered Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019

On 3D visibility representations of graphs with few crossings per edge.

[BibT_eX]

[DOI]

Michael Kaufmann

Theor. Comput. Sci., 2019

Greedy rectilinear drawings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Multi-level Steiner Trees.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar.

[BibT_eX]

[DOI]

Csaba D. Tóth

CoRR, 2019

Clustered Planarity with Pipes.

[BibT_eX]

[DOI]

Algorithmica, 2019

Universal Slope Sets for 1-Bend Planar Drawings.

[BibT_eX]

[DOI]

Giuseppe Liotta

Algorithmica, 2019

Hierarchical Partial Planarity.

[BibT_eX]

[DOI]

Algorithmica, 2019

Geometric Representations of Dichotomous Ordinal Data.

[BibT_eX]

[DOI]

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

The QuaSEFE Problem.

[BibT_eX]

[DOI]

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

Morphing Contact Representations of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

1-Fan-bundle-planar drawings of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

3-coloring arrangements of line segments with 4 slopes is hard.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Algorithms and Bounds for L-Drawings of Directed Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Small Universal Point Sets for k-Outerplanar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Turning Cliques into Paths to Achieve Planarity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 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

Vertex-Coloring with Defects.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Vincenzo Roselli

Antonios Symvonis

J. Graph Algorithms Appl., 2017

Monotone drawings of graphs with few directions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Beyond-Planarity: Density Results for Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Strip Planarity Testing for Embedded Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

On the Relationship Between k-Planar and k-Quasi-Planar Graphs.

[BibT_eX]

[DOI]

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

On Vertex- and Empty-Ply Proximity Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

3D Visibility Representations of 1-planar Graphs.

[BibT_eX]

[DOI]

Michael Kaufmann

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

A Universal Slope Set for 1-Bend Planar Drawings.

[BibT_eX]

[DOI]

Giuseppe Liotta

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

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

[BibT_eX]

[DOI]

J. Graph Theory, 2016

SEFE = C-Planarity?

[BibT_eX]

[DOI]

Comput. J., 2016

Vertex-Coloring with Star-Defects.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

L-Drawings of Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Beyond Level Planarity.

[BibT_eX]

[DOI]

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

Simultaneous Orthogonal Planarity.

[BibT_eX]

[DOI]

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

Low Ply Drawings of Trees.

[BibT_eX]

[DOI]

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

2015

Advancements on SEFE and Partitioned Book Embedding problems.

[BibT_eX]

[DOI]

Daniel Neuwirth

Theor. Comput. Sci., 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

Testing Cyclic Level and Simultaneous Level Planarity.

[BibT_eX]

[DOI]

CoRR, 2015

Relaxing the constraints of clustered planarity.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs.

[BibT_eX]

[DOI]

Ioannis G. Tollis

Comput. Geom., 2015

Monotone Drawings of Graphs with Fixed Embedding.

[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

A Universal Point Set for 2-Outerplanar 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

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Testing Mutual duality of Planar graphs.

[BibT_eX]

[DOI]

Thomas Bläsius

Int. J. Comput. Geom. Appl., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Deepening the Relationship between SEFE and C-Planarity.

[BibT_eX]

[DOI]

CoRR, 2014

On the area requirements of Euclidean minimum spanning trees.

[BibT_eX]

[DOI]

Comput. Geom., 2014

On Some $\mathcal{NP}$ -complete SEFE Problems.

[BibT_eX]

[DOI]

Daniel Neuwirth

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Morphing Planar Graph Drawings Optimally.

[BibT_eX]

[DOI]

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

Anchored Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013

Topological morphing of planar graphs.

[BibT_eX]

[DOI]

Pier Francesco Cortese

Theor. Comput. Sci., 2013

Simultaneous Embedding of Embedded Planar graphs.

[BibT_eX]

[DOI]

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

On the Complexity of Some Problems Related to SEFE.

[BibT_eX]

[DOI]

Daniel Neuwirth

CoRR, 2013

Morphing Planar Graphs Drawings Efficiently.

[BibT_eX]

[DOI]

CoRR, 2013

Drawings of Non-planar Graphs with Crossing-free Subgraphs.

[BibT_eX]

[DOI]

Ioannis G. Tollis

CoRR, 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

Drawing Non-Planar Graphs with Crossing-Free Subgraphs.

[BibT_eX]

[DOI]

Ioannis G. Tollis

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

Succinct greedy drawings do not always exist.

[BibT_eX]

[DOI]

Networks, 2012

On a Tree and a Path with no Geometric Simultaneous Embedding.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 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

Universal Point Subsets for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Implementing a Partitioned 2-Page Book Embedding Testing Algorithm.

[BibT_eX]

[DOI]

Marco Di Bartolomeo

Proceedings of the Graph Drawing - 20th International Symposium, 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]

Michael Kaufmann

Discret. Comput. Geom., 2011

Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time.

[BibT_eX]

[DOI]

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

Small Point Sets for Simply-Nested Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

An Algorithm to Construct Greedy Drawings of Triangulations.

[BibT_eX]

[DOI]

Luca Grilli

J. Graph Algorithms Appl., 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

Upward Geometric Graph Embeddings into Point Sets.

[BibT_eX]

[DOI]

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

2009

Splitting Clusters to Get C-Planarity.

[BibT_eX]

[DOI]

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

2007

Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time.

[BibT_eX]

[DOI]