Michael A. Bekos

Alessandra Tappini

Algorithmica, February, 2024

Convex grid drawings of planar graphs with constant edge-vertex resolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., January, 2024

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

[BibT_eX]

[DOI]

Discret. Math., January, 2024

2023

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

[BibT_eX]

[DOI]

Algorithmica, September, 2023

Lazy Queue Layouts of Posets.

[BibT_eX]

[DOI]

Algorithmica, May, 2023

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

An Improved Upper Bound on the Queue Number of Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, February, 2023

Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023).

[BibT_eX]

[DOI]

Markus Chimani

CoRR, 2023

On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Splitting Vertices in 2-Layer Graph Drawings.

[BibT_eX]

[DOI]

IEEE Computer Graphics and Applications, 2023

On the 2-Layer Window Width Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 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

The mixed page number of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On morphs of 1-plane graphs.

[BibT_eX]

[DOI]

Maximilian Pfister

J. Comput. Geom., 2022

On Turn-Regular Orthogonal Representations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2022

Universal Slope Sets for Upward Planar Drawings.

[BibT_eX]

[DOI]

Algorithmica, 2022

RAC Drawings of Graphs with Low Degree.

[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

Strictly-Convex Drawings of 3-Connected Planar Graphs.

[BibT_eX]

[DOI]

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

The Rique-Number of Graphs.

[BibT_eX]

[DOI]

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

2021

External Labeling: Fundamental Concepts and Algorithmic Techniques

[BibT_eX]

[DOI]

Benjamin Niedermann

Martin Nöllenburg

Synthesis Lectures on Visualization, Morgan & Claypool Publishers, ISBN: 978-3-031-02609-6, 2021

On dispersable book embeddings.

[BibT_eX]

[DOI]

Muhammad Jawaherul Alam

Theor. Comput. Sci., 2021

Grid drawings of graphs with constant edge-vertex resolution.

[BibT_eX]

[DOI]

Dömötör Pálvölgyi

Leonidas Theocharous

Comput. Geom., 2021

A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution.

[BibT_eX]

[DOI]

Comput. J., 2021

On Morphing 1-Planar Drawings.

[BibT_eX]

[DOI]

Maximilian Pfister

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

On the Queue Number of Planar Graphs.

[BibT_eX]

[DOI]

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

2020

On RAC drawings of graphs with one bend per edge.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Four Pages Are Indeed Necessary for Planar Graphs.

[BibT_eX]

[DOI]

Torsten Ueckerdt

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

Ignaz Rutter

Csaba D. Tóth

J. Comb. Theory, Ser. B, 2020

Grid Drawings of Graphs with Constant Edge-Vertex Resolution.

[BibT_eX]

[DOI]

Leonidas Theocharous

CoRR, 2020

An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Queue Layouts of Planar 3-Trees.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

k-Planar Graphs.

[BibT_eX]

[DOI]

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

Fan-Planar Graphs.

[BibT_eX]

[DOI]

Luca Grilli

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

2019

Planar drawings of fixed-mobile bigraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Greedy rectilinear drawings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Planar Graphs of Bounded Degree Have Bounded Queue Number.

[BibT_eX]

[DOI]

Torsten Ueckerdt

SIAM J. Comput., 2019

Edge partitions of optimal 2-plane and 3-plane graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

Coloring outerplanar graphs and planar 3-trees with small monochromatic components.

[BibT_eX]

[DOI]

Carla Binucci

Alessandra Tappini

CoRR, 2019

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

[BibT_eX]

[DOI]

Ignaz Rutter

Csaba D. Tóth

CoRR, 2019

External Labeling Techniques: A Taxonomy and Survey.

[BibT_eX]

[DOI]

Benjamin Niedermann

Martin Nöllenburg

Comput. Graph. Forum, 2019

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.

[BibT_eX]

[DOI]

Henry Förster

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

2018

Algorithms and insights for RaceTrack.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

1-Fan-bundle-planar drawings of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Guest Editors' Foreword and Overview.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Planar Graphs of Bounded Degree have Constant Queue Number.

[BibT_eX]

[DOI]

Torsten Ueckerdt

CoRR, 2018

Queue Layouts of Planar 3-Trees.

[BibT_eX]

[DOI]

CoRR, 2018

On Dispersable Book Embeddings.

[BibT_eX]

[DOI]

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

2017

On RAC drawings of 1-planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On the Total Number of Bends for Planar Octilinear Drawings.

[BibT_eX]

[DOI]

Robert Krug

J. Graph Algorithms Appl., 2017

Vertex-Coloring with Defects.

[BibT_eX]

[DOI]

Vincenzo Roselli

J. Graph Algorithms Appl., 2017

The maximum k-differential coloring problem.

[BibT_eX]

[DOI]

Konstantinos S. Stavropoulos

Stephen G. Kobourov

Sankar Veeramoni

J. Discrete Algorithms, 2017

Beyond-Planarity: Density Results for Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Improved Approximation Algorithms for Box Contact Representations.

[BibT_eX]

[DOI]

Algorithmica, 2017

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

The Book Thickness of 1-Planar Graphs is Constant.

[BibT_eX]

[DOI]

Till Bruckdorfer

Algorithmica, 2017

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

[BibT_eX]

[DOI]

Ignaz Rutter

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

3D Visibility Representations of 1-planar Graphs.

[BibT_eX]

[DOI]

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

On Optimal 2- and 3-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 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

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2016

On the Density of 3-Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Two-Page Book Embeddings of 4-Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2016

Vertex-Coloring with Star-Defects.

[BibT_eX]

[DOI]

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

AVDTC of generalized 3-Halin graphs.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Information, 2016

On the Density of Non-simple 3-Planar Graphs.

[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

On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

Planar Octilinear Drawings with One Bend Per Edge.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Many-to-One Boundary Labeling with Backbones.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

The Effect of Almost-Empty Faces on Planar Kandinsky Drawings.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

The Maximum k-Differential Coloring Problem.

[BibT_eX]

[DOI]

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

Sloginsky drawings of graphs.

[BibT_eX]

[DOI]

Robert Krug

Proceedings of the 6th International Conference on Information, 2015

The Book Embedding Problem from a SAT-Solving Perspective.

[BibT_eX]

[DOI]

Christian Zielke

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

1-Planar Graphs have Constant Book Thickness.

[BibT_eX]

[DOI]

Till Bruckdorfer

Proceedings of the Algorithms - ESA 2015, 2015

2014

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

A note on maximum differential coloring of planar graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Smooth Orthogonal Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Muhammad Jawaherul Alam

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Sloggy drawings of graphs.

[BibT_eX]

[DOI]

Robert Krug

Proceedings of the 5th International Conference on Information, 2014

Perfect smooth orthogonal drawings.

[BibT_eX]

[DOI]

Sergey Pupyrev

Proceedings of the 5th International Conference on Information, 2014

2013

Smooth Orthogonal Layouts.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Geometric RAC Simultaneous Drawings of Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Maximizing the Total Resolution of Graphs.

[BibT_eX]

[DOI]

Evmorfia N. Argyriou

Comput. J., 2013

Slanted Orthogonal Drawings.

[BibT_eX]

[DOI]

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

2012

The Straight-Line RAC Drawing Problem is NP-Hard.

[BibT_eX]

[DOI]

Evmorfia N. Argyriou

J. Graph Algorithms Appl., 2012

Circle-Representations of Simple 4-Regular Planar Graphs.

[BibT_eX]

[DOI]

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

2011

Geometric Simultaneous RAC Drawings of Graphs

[BibT_eX]

[DOI]

CoRR, 2011

Combining Traditional Map Labeling with Boundary Labeling.

[BibT_eX]

[DOI]

Dimitrios Papadopoulos

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

Combining Problems on RAC Drawings and Simultaneous Graph Drawings.

[BibT_eX]

[DOI]

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

2010

On Metro-Line Crossing Minimization.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Area-Feature Boundary Labeling.

[BibT_eX]

[DOI]

Comput. J., 2010

Boundary Labeling with Octilinear Leaders.

[BibT_eX]

[DOI]

Algorithmica, 2010

2008

Efficient Labeling of Collinear Sites.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2008

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem.

[BibT_eX]

[DOI]

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

2007

Boundary labeling: Models and efficient algorithms for rectangular maps.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Line Crossing Minimization on Metro Maps.

[BibT_eX]

[DOI]

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

Labeling collinear sites.

[BibT_eX]

[DOI]

Proceedings of the APVIS 2007, 2007

2006

Multi-stack Boundary Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Polygon labelling of minimum leader length.

[BibT_eX]

[DOI]

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006

2005

Boundary Labelling of Optimal Total Leader Length.

[BibT_eX]

[DOI]

Proceedings of the Advances in Informatics, 2005

BLer: A Boundary Labeller for Technical Drawings.

[BibT_eX]

[DOI]