Mikkel Abrahamsen

Most-cited papers

The Art Gallery Problem is ∃ℝ-complete
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2021Journal of the ACM81 citations Open access
Semantic Scholar
The art gallery problem is ∃ ℝ-complete
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2018Symposium on the Theory of Computing58 citations
Semantic Scholar
Framework for ER-Completeness of Two-Dimensional Packing Problems
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
2020IEEE Annual Symposium on Foundations of Computer Science43 citations Open access
Semantic Scholar
Covering Polygons is Even Harder
Mikkel Abrahamsen
2021IEEE Annual Symposium on Foundations of Computer Science32 citations Open access
Semantic Scholar
Training Neural Networks is ER-complete
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
2021Neural Information Processing Systems30 citations
Semantic Scholar
Irrational Guards are Sometimes Needed
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2017International Symposium on Computational Geometry26 citations
Semantic Scholar
Spiral Toolpaths for High-Speed Machining of 2D Pockets with or without Islands
Mikkel Abrahamsen
2014Journal of Computational Design and Engineering23 citations Open access
Semantic Scholar
Graph Reconstruction with a Betweenness Oracle
Mikkel Abrahamsen, Gregory Bodwin, E. Rotenberg, Morten Stöckel
2016Symposium on Theoretical Aspects of Computer Science19 citations
Semantic Scholar
Online Sorting and Translational Packing of Convex Polygons
Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist
2021ACM-SIAM Symposium on Discrete Algorithms17 citations Open access
Semantic Scholar
The Art Gallery Problem is ∃ℝ-complete
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2017arXiv.org16 citations
Semantic Scholar
The Art Gallery Problem is $\exists \mathbb{R}$-complete
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
201712 citations
Semantic Scholar
On the Asymptotic Enumeration of LEGO Structures
Mikkel Abrahamsen, Søren Eilers
2011Experimental Mathematics12 citations Open access
Semantic Scholar
Partitioning a Polygon Into Small Pieces
Mikkel Abrahamsen, N. Rasmussen
2022ACM-SIAM Symposium on Discrete Algorithms11 citations Open access
Semantic Scholar
Tiling with Squares and Packing Dominos in Polynomial Time
Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, P. Rasmussen
2020International Symposium on Computational Geometry11 citations Open access
Semantic Scholar
Range-Clustering Queries
Mikkel Abrahamsen, M. de Berg, K. Buchin, M. Mehr +1 more
2017International Symposium on Computational Geometry11 citations
Semantic Scholar
Geometric Embeddability of Complexes is ∃ℝ-complete
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
2021International Symposium on Computational Geometry9 citations Open access
Semantic Scholar
Dynamic Toolbox for ETRINV
Mikkel Abrahamsen, Tillmann Miltzow
2019arXiv.org8 citations
Semantic Scholar
Fast fencing
Mikkel Abrahamsen, Anna Adamaszek, K. Bringmann, Vincent Cohen-Addad +4 more
2018Symposium on the Theory of Computing8 citations Open access
Semantic Scholar
Best Laid Plans of Lions and Men
Mikkel Abrahamsen, J. Holm, E. Rotenberg, Christian Wulff-Nilsen
2017International Symposium on Computational Geometry8 citations
Semantic Scholar
Constant-Workspace Algorithms for Visibility Problems in the Plane
Mikkel Abrahamsen
20138 citations
Semantic Scholar
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon
Mikkel Abrahamsen
2013Canadian Conference on Computational Geometry8 citations
Semantic Scholar
Constructing Concise Convex Covers via Clique Covers (CG Challenge)
Mikkel Abrahamsen, W. Meyling, André Nusser
2023International Symposium on Computational Geometry7 citations
Semantic Scholar
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane
Mikkel Abrahamsen, P. Giannopoulos, M. Löffler, G. Rote
2019Discrete & Computational Geometry7 citations Open access
Semantic Scholar
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
Mikkel Abrahamsen, S. Alstrup, J. Holm, M. B. T. Knudsen +1 more
2016International Colloquium on Automata, Languages and Programming7 citations
Semantic Scholar
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity
Mikkel Abrahamsen, Tzvika Geft, D. Halperin, Barak Ugav
2023Adaptive Agents and Multi-Agent Systems6 citations Open access
Semantic Scholar
An Optimal Algorithm for the Separating Common Tangents of two Polygons
Mikkel Abrahamsen
2015International Symposium on Computational Geometry6 citations
Semantic Scholar
Minimum Perimeter-Sum Partitions in the Plane
Mikkel Abrahamsen, M. de Berg, K. Buchin, M. Mehr +1 more
2017Discrete & Computational Geometry5 citations Open access
Semantic Scholar
Geometric Embeddability of Complexes Is ∃ R -Complete
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
20234 citations
Semantic Scholar
Escaping an Infinitude of Lions
Mikkel Abrahamsen, J. Holm, E. Rotenberg, Christian Wulff-Nilsen
2020The American mathematical monthly4 citations Open access
Semantic Scholar
Near-optimal induced universal graphs for cycles and paths
Mikkel Abrahamsen, S. Alstrup, J. Holm, M. B. T. Knudsen +1 more
2020Discrete Applied Mathematics4 citations Open access
Semantic Scholar
Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace
Mikkel Abrahamsen, Bartosz Walczak
2016ACM Trans. Algorithms4 citations Open access
Semantic Scholar
Online Packing to Minimize Area or Perimeter
Mikkel Abrahamsen, Lorenzo Beretta
2021International Symposium on Computational Geometry3 citations
Semantic Scholar
Classifying Convex Bodies by their Contact and Intersection Graphs
Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, P. Rasmussen
2019International Symposium on Computational Geometry3 citations
Semantic Scholar
Disks in Curves of Bounded Convex Curvature
Anders Aamand, Mikkel Abrahamsen, M. Thorup
2019The American mathematical monthly3 citations Open access
Semantic Scholar
Finding the Maximum Subset with Bounded Convex Curvature
Mikkel Abrahamsen, M. Thorup
2016International Symposium on Computational Geometry3 citations
Semantic Scholar
Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace
Mikkel Abrahamsen, Bartosz Walczak
2016Embedded Systems and Applications3 citations
Semantic Scholar
Degree of Convexity and Expected Distances in Polygons
Mikkel Abrahamsen, Viktor Fredslund-Hansen
2022arXiv.org2 citations Open access
Semantic Scholar
Framework for ∃ ℝ-Completeness of Two-Dimensional Packing Problems
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
2020TheoretiCS2 citations Open access
Semantic Scholar
Efficient counting of LEGO structures
Mikkel Abrahamsen, Søren Eilers
20072 citations
Semantic Scholar
Training Neural Networks is $\exists\mathbb R$-complete
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
20211 citations
Semantic Scholar
Chasing Puppies: Mobile Beacon Routing on Closed Curves
Mikkel Abrahamsen, Jeff Erickson, I. Kostitsyna, M. Löffler +4 more
2021International Symposium on Computational Geometry1 citations
Semantic Scholar
4 : 2 Minimum Perimeter-Sum Partitions in the Plane
Mikkel Abrahamsen, M. de Berg, K. Buchin, M. Mehr +1 more
20181 citations
Semantic Scholar
How to Cut Corners and Get Bounded Convex Curvature
Mikkel Abrahamsen, M. Thorup
2016Discrete & Computational Geometry1 citations Open access
Semantic Scholar
Outer common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace
Mikkel Abrahamsen, Bartosz Walczak
2016arXiv.org1 citations
Semantic Scholar
Precision in Geometric Algorithms (Dagstuhl Seminar 25372)
Mikkel Abrahamsen, Sándor Kisfaludi-Bak, Linda Kleist, Tillmann Miltzow
2025Dagstuhl Reports0 citations
Semantic Scholar
Distinguishing classes of intersection graphs of homothets or similarities of two convex disks
Mikkel Abrahamsen, Bartosz Walczak
2021International Symposium on Computational Geometry0 citations
Semantic Scholar
Universitet Spiral tool paths for high-speed machining of 2 D pockets with or without islands
Mikkel Abrahamsen
20180 citations
Semantic Scholar
33rd International Symposium on Computational Geometry, SoCG 2017, Brisbane, Australia, July 4-7, 2017
Mikkel Abrahamsen, M. de Berg, K. Buchin, M. Mehr +1 more
2017International Symposium on Computational Geometry0 citations
Semantic Scholar