Sabine Cornelsen

Gregor Diatzko

CoRR, 2023

The Parametrized Complexity of the Segment Number.

[BibT_eX]

[DOI]

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

2022

On Upward-Planar L-Drawings of Graphs.

[BibT_eX]

[DOI]

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

Planar Confluent Orthogonal Drawings of 4-Modal Digraphs.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Gregor Diatzko

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

2021

ClusterSets: Optimizing Planar Clusters in Categorical Point Data.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2021

2020

Drawing Shortest Paths in Geodetic Graphs.

[BibT_eX]

[DOI]

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

Planar L-Drawings of Bimodal Graphs.

[BibT_eX]

[DOI]

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

2019

Morphing Contact Representations of Graphs.

[BibT_eX]

[DOI]

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

2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.

[BibT_eX]

[DOI]

Alexander Wolff

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

Planarity of Overlapping Clusterings Including Unions of Two Partitions.

[BibT_eX]

[DOI]

Jan Christoph Athenstädt

J. Graph Algorithms Appl., 2017

Planar L-Drawings of Directed Graphs.

[BibT_eX]

[DOI]

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

2016

C-Planarity of Overlapping Clusterings Including Unions of Two Partitions.

[BibT_eX]

[DOI]

Jan Christoph Athenstädt

CoRR, 2016

Simultaneous Orthogonal Planarity.

[BibT_eX]

[DOI]

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

2014

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

[BibT_eX]

[DOI]

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

2013

Many-to-One Boundary Labeling with Backbones.

[BibT_eX]

[DOI]

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

2012

Guest Editor's Foreword.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Progress on Partial Edge Drawings.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Martin Nöllenburg

Alexander Wolff

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

Leveling the Grid.

[BibT_eX]

[DOI]

Andreas Karrenbauer

Shujun Li

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011

More Canonical Ordering.

[BibT_eX]

[DOI]

Melanie Badent

J. Graph Algorithms Appl., 2011

Accelerated Bend Minimization.

[BibT_eX]

[DOI]

Andreas Karrenbauer

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

2010

Blocks of Hypergraphs - Applied to Hypergraphs and Outerplanarity.

[BibT_eX]

[DOI]

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

Path-Based Supports for Hypergraphs.

[BibT_eX]

[DOI]

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

2009

Treelike comparability graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Phylogenetic graph models beyond trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Leftist Canonical Ordering.

[BibT_eX]

[DOI]

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

2007

Track assignment.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

2004

How to draw the minimum cuts of a planar graph.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Treelike Comparability Graphs: Characterization, Recognition, and Applications.

[BibT_eX]

[DOI]

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

Platform Assignment.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2003

Drawing Families of Cuts in a Graph

[BibT_eX]

[DOI]

PhD thesis, 2003

Completely Connected Clustered Graphs.

[BibT_eX]

[DOI]

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

Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Drawing Graphs on Two and Three Lines.

[BibT_eX]

[DOI]

Thomas Schank

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

Planarity of the 2-Level Cactus Model.

[BibT_eX]

[DOI]

Yefim Dinitz

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

Visual Ranking of Link Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Visone.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

Drawing Clusters and Hierarchies.

[BibT_eX]

[DOI]

Ralf Brockenauer