André Schulz

J. Graph Algorithms Appl., 2023

Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs.

[BibT_eX]

[DOI]

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

On the Geometric Thickness of 2-Degenerate Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

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

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2022

2021

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.

[BibT_eX]

[DOI]

Philipp Kindermann

Fabrizio Montecchiani

Lena Schlipf

J. Graph Algorithms Appl., 2021

2020

Augmenting Geometric Graphs with Matchings.

[BibT_eX]

[DOI]

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

2019

Lombardi drawings of knots and links.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Recognizing Planar Laman Graphs.

[BibT_eX]

[DOI]

Jonathan Rollin

Lena Schlipf

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

2018

Experimental Analysis of the Accessibility of Drawings with Few Segments.

[BibT_eX]

[DOI]

Philipp Kindermann

J. Graph Algorithms Appl., 2018

Drawing Planar Graphs with Few Geometric Primitives.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Saturated simple and 2-simple topological graphs with few edges.

[BibT_eX]

[DOI]

Péter Hajnal

J. Graph Algorithms Appl., 2018

The Partition Spanning Forest Problem.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Embedding Stacked Polytopes on a Polynomial-Size Grid.

[BibT_eX]

[DOI]

Erik D. Demaine

Discret. Comput. Geom., 2017

On Gallai's conjecture for series-parallel graphs and planar 3-trees.

[BibT_eX]

[DOI]

Philipp Kindermann

Lena Schlipf

CoRR, 2017

2016

Counting Carambolas.

[BibT_eX]

[DOI]

Graphs Comb., 2016

A duality transform for constructing small grid embeddings of 3d polytopes.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Multi-sided Boundary Labeling.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

Drawing Graphs with Few Arcs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Contact Representations of Sparse Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Contact Graphs of Circular Arcs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams.

[BibT_eX]

[DOI]

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

On Minimizing Crossings in Storyline Visualizations.

[BibT_eX]

[DOI]

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

Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments.

[BibT_eX]

[DOI]

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

Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees.

[BibT_eX]

[DOI]

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

2014

Reprint of: Memory-constrained algorithms for simple polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2014

On Monotone Drawings of Trees.

[BibT_eX]

[DOI]

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

2013

Bounds on the Maximum Multiplicity of Some Common Geometric Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

The union of colorful simplices spanned by a colored point set.

[BibT_eX]

[DOI]

Csaba D. Tóth

Comput. Geom., 2013

On numbers of pseudo-triangulations.

[BibT_eX]

[DOI]

Moria Ben-Ner

Adam Sheffer

Comput. Geom., 2013

Bounded-degree polyhedronization of point sets.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Andrew Winslow

Comput. Geom., 2013

Memory-constrained algorithms for simple polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Two-Sided Boundary Labeling with Adjacent Sides.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Algorithms for Designing Pop-Up Cards.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Counting Carambolas.

[BibT_eX]

[DOI]

Maarten Löffler

Csaba D. Tóth

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

2012

Algorithms for Labeling Focus Regions.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2012

Pinning balloons with perfect angles and optimal area.

[BibT_eX]

[DOI]

Immanuel Halupczok

J. Graph Algorithms Appl., 2012

Pointed drawings of planar graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2012

2011

Drawing 3-Polytopes with Good Vertex Resolution.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Small Grid Embeddings of 3-Polytopes.

[BibT_eX]

[DOI]

Ares Ribó Mor

Discret. Comput. Geom., 2011

Convexifying Polygons Without Losing Visibilities.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

On the Number of Spanning Trees a Planar Graph Can Have.

[BibT_eX]

[DOI]

Kevin Buchin

Proceedings of the Algorithms, 2010

Fréchet Distance of Surfaces: Some Simple Hard Cases.

[BibT_eX]

[DOI]

Kevin Buchin

Maike Buchin

Proceedings of the Algorithms, 2010

2009

Flip Graphs of Bounded-Degree Triangulations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Resolving Loads with Positive Interior Stresses.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008

Lifting planar graphs to realize integral 3-polytopes and topics in pseudo- triangulations (Heben von planaren Graphen zur ganzzahligen Einbettung von 3-Polytopen und Themen über Pseudo-Triangulierungen)

[BibT_eX]

[DOI]

PhD thesis, 2008

2007

Embedding 3-polytopes on a small grid.

[BibT_eX]

[DOI]

Ares Ribó Mor