Michael Hoffmann

Comb. Probab. Comput., September, 2023

Drawings of Complete Multipartite Graphs up to Triangle Flips.

[BibT_eX]

[DOI]

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

The Number of Edges in Maximal 2-Planar Graphs.

[BibT_eX]

[DOI]

Meghana M. Reddy

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

2022

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Drawing Shortest Paths in Geodetic Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Long Plane Trees.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2020

Halving balls by a hyperplane in deterministic linear time.

[BibT_eX]

[DOI]

Tillmann Miltzow

J. Comput. Geom., 2020

Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard.

[BibT_eX]

[DOI]

Jayson Lynch

Andrew Winslow

J. Inf. Process., 2020

Minimal Representations of Order Types by Geometric Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

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

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Ignaz Rutter

J. Comb. Theory B, 2020

Simple Topological Drawings of k-Planar Graphs.

[BibT_eX]

[DOI]

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

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens.

[BibT_eX]

[DOI]

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

Plane Spanning Trees in Edge-Colored Simple Drawings of Kn.

[BibT_eX]

[DOI]

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

2019

Simultaneous Embeddings with Few Bends and Crossings.

[BibT_eX]

[DOI]

Fabrizio Frati

J. Graph Algorithms Appl., 2019

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

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Ignaz Rutter

CoRR, 2019

The QuaSEFE Problem.

[BibT_eX]

[DOI]

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

Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian.

[BibT_eX]

[DOI]

Boris Klemz

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

2018

Arc diagrams, flip distances, and Hamiltonian triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Convex Hulls in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2017

The planar tree packing theorem.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Computing nonsimple polygons of minimum perimeter.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Arne Schmidt

Christiane Schmidt

Julian Troegel

J. Comput. Geom., 2017

Column planarity and partially-simultaneous geometric embedding.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Netrunner Mate-in-1 or -2 is Weakly NP-Hard.

[BibT_eX]

[DOI]

Jeffrey Bosboom

CoRR, 2017

Obedient Plane Drawings for Disk Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Two-Planar Graphs Are Quasiplanar.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Single-Player and Two-Player Buttons & Scissors Games.

[BibT_eX]

[DOI]

CoRR, 2016

2015

On Universal Point Sets for Planar Graphs.

[BibT_eX]

[DOI]

Jean Cardinal

J. Graph Algorithms Appl., 2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014

Covering Folded Shapes.

[BibT_eX]

[DOI]

J. Comput. Geom., 2014

Vertex-Colored Encompassing Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Plane Graphs with Parity Constraints.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Editorial.

[BibT_eX]

[DOI]

Emo Welzl

Comput. Geom., 2014

Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations.

[BibT_eX]

[DOI]

Proceedings of the Geographic Information Science - 8th International Conference, 2014

Halving Balls in Deterministic Linear Time.

[BibT_eX]

[DOI]

Tillmann Miltzow

Proceedings of the Algorithms - ESA 2014, 2014

Quality Ratios of Measures for Graph Drawing Styles.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Graph Drawings with Relative Edge Length Specifications.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Interference Minimization in Asymmetric Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2014

2013

Maximizing maximal angles for plane straight-line graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Planar Packing of Binary Trees.

[BibT_eX]

[DOI]

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

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.

[BibT_eX]

[DOI]

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

Convex hull alignment through translation.

[BibT_eX]

[DOI]

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

2012

Minimum and maximum against k lies.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2012

2011

Convex partitions with 2-edge connected dual graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

The t-Pebbling Number is Eventually Linear in t.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

Counting Plane Graphs: Flippability and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Wireless Localization within Orthogonal Polyhedra.

[BibT_eX]

[DOI]

Tobias Christ

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

2010

Pointed binary encompassing trees: Simple and optimal.

[BibT_eX]

[DOI]

Bettina Speckmann

Comput. Geom., 2010

Improved Bounds for Wireless Localization.

[BibT_eX]

[DOI]

Algorithmica, 2010

Minimum and Maximum against k Lies.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

2009

The Euclidean degree-4 minimum spanning tree problem is NP-hard.

[BibT_eX]

[DOI]

Andrea Francke

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Wireless Localization with Vertex Guards is NP-hard.

[BibT_eX]

[DOI]

Tobias Christ

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2007

An adaptable and extensible geometry kernel.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Chordless paths through three vertices.

[BibT_eX]

[DOI]

Robert Haas

Theor. Comput. Sci., 2006

Coloring octrees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

The traveling salesman problem with few inner points.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

The minimum weight triangulation problem with few inner points.

[BibT_eX]

[DOI]

Yoshio Okamoto

Comput. Geom., 2006

Spanning trees across axis-parallel segments.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

A simple linear algorithm for computing rectilinear 3-centers.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Pointed binary encompassing trees: Simple and optimal.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Pointed and colored binary encompassing trees.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Pointed Binary Encompassing Trees.

[BibT_eX]

[DOI]

Bettina Speckmann

Proceedings of the Algorithm Theory, 2004

2003

Alternating paths through disjoint line segments.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Segment endpoint visibility graphs are Hamiltonian.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Pushing blocks is hard.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Degree Bounds for Constrained Pseudo-Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Connecting points in the presence of obstacles in the plane.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Push-2-f is pspace-complete.

[BibT_eX]

[DOI]

Erik D. Demaine

Robert A. Hearn

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

Pushing blocks is np-complete for noncrossing solution paths.

[BibT_eX]

[DOI]

Erik D. Demaine

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Push-* is NP-hard.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

A simple linear algorithm for computing rectangle 3-centers.

[BibT_eX]

[DOI]