Mikkel Abrahamsen

Peter M. R. Rasmussen

Thomas D. Ahle

ACM Trans. Algorithms, July, 2023

How to Cut Corners and Get Bounded Convex Curvature.

[BibT_eX]

[DOI]

Mikkel Thorup

Discret. Comput. Geom., June, 2023

Clustering with Few Disks to Minimize the Sum of Radii.

[BibT_eX]

[DOI]

CoRR, 2023

Minimum Star Partitions of Simple Polygons in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2023

Online Sorting and Translational Packing of Convex Polygons.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks.

[BibT_eX]

[DOI]

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

Constructing Concise Convex Covers via Clique Covers (CG Challenge).

[BibT_eX]

[DOI]

William Bille Meyling

André Nusser

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

Geometric Embeddability of Complexes Is ∃ℝ-Complete.

[BibT_eX]

[DOI]

Linda Kleist

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

Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

The Art Gallery Problem is ∃ℝ-complete.

[BibT_eX]

[DOI]

Anna Adamaszek

J. ACM, 2022

Partitioning a Polygon Into Small Pieces.

[BibT_eX]

[DOI]

Nichlas Langhoff Rasmussen

CoRR, 2022

Degree of Convexity and Expected Distances in Polygons.

[BibT_eX]

[DOI]

Viktor Fredslund-Hansen

CoRR, 2022

2021

Training Neural Networks is ER-complete.

[BibT_eX]

[DOI]

Linda Kleist

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Covering Polygons is Even Harder.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Online Packing to Minimize Area or Perimeter.

[BibT_eX]

[DOI]

Lorenzo Beretta

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Chasing Puppies: Mobile Beacon Routing on Closed Curves.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Classifying Convex Bodies by Their Contact and Intersection Graphs.

[BibT_eX]

[DOI]

Anders Aamand

Peter Michael Reichstein Rasmussen

Jakob Bæk Tejs Knudsen

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Escaping an Infinitude of Lions.

[BibT_eX]

[DOI]

Eva Rotenberg

Christian Wulff-Nilsen

Am. Math. Mon., 2020

Disks in Curves of Bounded Convex Curvature.

[BibT_eX]

[DOI]

Anders Aamand

Mikkel Thorup

Am. Math. Mon., 2020

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Minimum Perimeter-Sum Partitions in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Near-optimal induced universal graphs for cycles and paths.

[BibT_eX]

[DOI]

Stephen Alstrup

Mathias Bæk Tejs Knudsen

Morten Stöckel

Discret. Appl. Math., 2020

Framework for ∃R-Completeness of Two-Dimensional Packing Problems.

[BibT_eX]

[DOI]

Nadja Seiferth

CoRR, 2020

Framework for ER-Completeness of Two-Dimensional Packing Problems.

[BibT_eX]

[DOI]

Nadja Seiferth

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Spiral tool paths for high-speed machining of 2D pockets with or without islands.

[BibT_eX]

[DOI]

J. Comput. Des. Eng., 2019

Dynamic Toolbox for ETRINV.

[BibT_eX]

[DOI]

CoRR, 2019

Geometric Multicut.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Fast fencing.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs.

[BibT_eX]

[DOI]

Stephen Alstrup

Mathias Bæk Tejs Knudsen

Morten Stöckel

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Best Laid Plans of Lions and Men.

[BibT_eX]

[DOI]

Eva Rotenberg

Christian Wulff-Nilsen

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Range-Clustering Queries.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Irrational Guards are Sometimes Needed.

[BibT_eX]

[DOI]

Anna Adamaszek

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Outer common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace.

[BibT_eX]

[DOI]

CoRR, 2016

Graph Reconstruction with a Betweenness Oracle.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Finding the Maximum Subset with Bounded Convex Curvature.

[BibT_eX]

[DOI]

Mikkel Thorup

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

An Optimal Algorithm for the Separating Common Tangents of Two Polygons.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Spiral Toolpaths for High-Speed Machining of 2D Pockets with or without Islands.

[BibT_eX]

[DOI]

CoRR, 2014

2013

An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon.

[BibT_eX]

[DOI]

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

2011

On the Asymptotic Enumeration of LEGO Structures.

[BibT_eX]

[DOI]