Giordano Da Lozzo

Alessandra Tappini

Algorithmica, February, 2024

Book embeddings of k-framed graphs and k-map graphs.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Discret. Math., January, 2024

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

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

Quantum Graph Drawing.

[BibT_eX]

[DOI]

Susanna Caroppo

Proceedings of the WALCOM: Algorithms and Computation, 2024

2023

Upward Book Embeddability of st-Graphs: Complexity and Algorithms.

[BibT_eX]

[DOI]

Algorithmica, December, 2023

Morphing Triangle Contact Representations of Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., October, 2023

On the upward book thickness problem: Combinatorial and complexity results.

[BibT_eX]

[DOI]

Sujoy Bhore

Chrysanthi N. Raftopoulou

Martin Nöllenburg

Eur. J. Comb., May, 2023

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Philipp Kindermann

J. Graph Algorithms Appl., 2023

Planar L-Drawings of Directed Graphs.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

The Parametrized Complexity of the Segment Number.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

Planar L-Drawings of Bimodal Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

How to Morph a Tree on a Small Grid.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

On Upward-Planar L-Drawings of Graphs.

[BibT_eX]

[DOI]

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

Graph Product Structure for h-Framed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Unit-length Rectangular Drawings of Graphs.

[BibT_eX]

[DOI]

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

2021

C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.

[BibT_eX]

[DOI]

Algorithmica, 2021

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 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

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

Graph Stories in Small Area.

[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

On Planar Greedy Drawings of 3-Connected Planar Graphs.

[BibT_eX]

[DOI]

Anthony D'Angelo

Fabrizio Frati

Discret. Comput. Geom., 2020

Extending upward planar graph drawings.

[BibT_eX]

[DOI]

Fabrizio Frati

Comput. Geom., 2020

Upward Planar Morphs.

[BibT_eX]

[DOI]

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

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Proceedings of the 36th International Symposium on Computational Geometry, 2020

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

[BibT_eX]

[DOI]

Anthony D'Angelo

Fabrizio Frati

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

Beyond Clustered Planar Graphs.

[BibT_eX]

[DOI]

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

2019

Planarity of streamed graphs.

[BibT_eX]

[DOI]

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

Reaching 3-Connectivity via Edge-Edge Additions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Graph Stories in Small Area.

[BibT_eX]

[DOI]

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

Computing k-Modal Embeddings of Planar Digraphs.

[BibT_eX]

[DOI]

Juan José Besa Vial

Michael T. Goodrich

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Upward Book Embeddings of st-Graphs.

[BibT_eX]

[DOI]

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

Morphing Contact Representations of Graphs.

[BibT_eX]

[DOI]

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

2018

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 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

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

Analogies between the Crossing Number and the Tangle Crossing Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity.

[BibT_eX]

[DOI]

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

Approximation Algorithms for Facial Cycles in Planar Embeddings.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 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

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

Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

On the Complexity of Realizing Facial Cycles.

[BibT_eX]

[DOI]

CoRR, 2016

Strengthening Hardness Results to 3-Connected Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

SEFE = C-Planarity?

[BibT_eX]

[DOI]

Comput. J., 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

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 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]

Maurizio Patrignani

Ioannis G. Tollis

Comput. Geom., 2015

Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data.

[BibT_eX]

[DOI]

Proceedings of the IVAPP 2015, 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 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

Visual discovery of the correlation between BGP routing and round-trip delay active measurements.

[BibT_eX]

[DOI]

Claudio Squarcella

Computing, 2014

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

[BibT_eX]

[DOI]

Daniel Neuwirth

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

Planar Embeddings with Small and Uniform Faces.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 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

On the Complexity of Some Problems Related to SEFE.

[BibT_eX]

[DOI]

Daniel Neuwirth

CoRR, 2013

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

[BibT_eX]

[DOI]

Maurizio Patrignani

Ioannis G. Tollis

CoRR, 2013

Strip Planarity Testing.

[BibT_eX]

[DOI]

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

Drawing Non-Planar Graphs with Crossing-Free Subgraphs.

[BibT_eX]

[DOI]

Maurizio Patrignani

Ioannis G. Tollis

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

2012

Drawing Graphs on a Smartphone.

[BibT_eX]

[DOI]