On the Asymptotic Enumeration of LEGO Structures. - Mikkel Abrahamsen; Søren Eilers (Exp. Math., 2011)

An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon. - Mikkel Abrahamsen (CCCG, 2013)

Spiral Toolpaths for High-Speed Machining of 2D Pockets with or without Islands. - Mikkel Abrahamsen (CoRR, 2014)

An Optimal Algorithm for the Separating Common Tangents of Two Polygons. - Mikkel Abrahamsen (SoCG, 2015)

Finding the Maximum Subset with Bounded Convex Curvature. - Mikkel Abrahamsen; Mikkel Thorup (SoCG, 2016)

Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace. - Mikkel Abrahamsen; Bartosz Walczak (ESA, 2016)

Graph Reconstruction with a Betweenness Oracle. - Mikkel Abrahamsen; Greg Bodwin; Eva Rotenberg; Morten Stöckel (STACS, 2016)

Outer common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace. - Mikkel Abrahamsen; Bartosz Walczak (CoRR, 2016)

Irrational Guards are Sometimes Needed. - Mikkel Abrahamsen; Anna Adamaszek; Tillmann Miltzow (SoCG, 2017)

Range-Clustering Queries. - Mikkel Abrahamsen; Mark de Berg; Kevin Buchin; Mehran Mehr; Ali D. Mehrabi (SoCG, 2017)

Best Laid Plans of Lions and Men. - Mikkel Abrahamsen; Jacob Holm; Eva Rotenberg; Christian Wulff-Nilsen (SoCG, 2017)

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. - Mikkel Abrahamsen; Stephen Alstrup; Jacob Holm; Mathias Bæk Tejs Knudsen; Morten Stöckel (ICALP, 2017)

Fast fencing. - Mikkel Abrahamsen; Anna Adamaszek; Karl Bringmann; Vincent Cohen-Addad; Mehran Mehr; Eva Rotenberg; Alan Roytman; Mikkel Thorup (STOC, 2018)

Geometric Multicut. - Mikkel Abrahamsen; Panos Giannopoulos; Maarten Löffler; Günter Rote (ICALP, 2019)

Dynamic Toolbox for ETRINV. - Mikkel Abrahamsen; Tillmann Miltzow (CoRR, 2019)

Spiral tool paths for high-speed machining of 2D pockets with or without islands. - Mikkel Abrahamsen (J. Comput. Des. Eng., 2019)

Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace. - Mikkel Abrahamsen; Bartosz Walczak (ACM Trans. Algorithms, 2019)

Framework for ER-Completeness of Two-Dimensional Packing Problems. - Mikkel Abrahamsen; Tillmann Miltzow; Nadja Seiferth (FOCS, 2020)

Near-optimal induced universal graphs for cycles and paths. - Mikkel Abrahamsen; Stephen Alstrup; Jacob Holm; Mathias Bæk Tejs Knudsen; Morten Stöckel (Discret. Appl. Math., 2020)

Minimum Perimeter-Sum Partitions in the Plane. - Mikkel Abrahamsen; Mark de Berg; Kevin Buchin; Mehran Mehr; Ali D. Mehrabi (Discret. Comput. Geom., 2020)

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. - Mikkel Abrahamsen; Panos Giannopoulos; Maarten Löffler; Günter Rote (Discret. Comput. Geom., 2020)

Disks in Curves of Bounded Convex Curvature. - Anders Aamand; Mikkel Abrahamsen; Mikkel Thorup (Am. Math. Mon., 2020)

Escaping an Infinitude of Lions. - Mikkel Abrahamsen; Jacob Holm; Eva Rotenberg; Christian Wulff-Nilsen (Am. Math. Mon., 2020)

Classifying Convex Bodies by Their Contact and Intersection Graphs. - Anders Aamand; Mikkel Abrahamsen; Jakob Bæk Tejs Knudsen; Peter Michael Reichstein Rasmussen (SoCG, 2021)

Online Packing to Minimize Area or Perimeter. - Mikkel Abrahamsen; Lorenzo Beretta 001 (SoCG, 2021)

Covering Polygons is Even Harder. - Mikkel Abrahamsen (FOCS, 2021)

Training Neural Networks is ER-complete. - Mikkel Abrahamsen; Linda Kleist; Tillmann Miltzow (NeurIPS, 2021)

Chasing Puppies: Mobile Beacon Routing on Closed Curves. - Mikkel Abrahamsen; Jeff Erickson 001; Irina Kostitsyna; Maarten Löffler; Till Miltzow; Jérôme Urhausen; Jordi L. Vermeulen; Giovanni Viglietta (J. Comput. Geom., 2021)

Degree of Convexity and Expected Distances in Polygons. - Mikkel Abrahamsen; Viktor Fredslund-Hansen (CoRR, 2022)

The Art Gallery Problem is ∃ℝ-complete. - Mikkel Abrahamsen; Anna Adamaszek; Tillmann Miltzow (J. ACM, 2022)

Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. - Mikkel Abrahamsen; Tzvika Geft; Dan Halperin; Barak Ugav (AAMAS, 2023)

Constructing Concise Convex Covers via Clique Covers (CG Challenge). - Mikkel Abrahamsen; William Bille Meyling; André Nusser (SoCG, 2023)

Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks. - Mikkel Abrahamsen; Bartosz Walczak (SoCG, 2023)

Online Sorting and Translational Packing of Convex Polygons. - Anders Aamand; Mikkel Abrahamsen; Lorenzo Beretta 001; Linda Kleist (SODA, 2023)

How to Cut Corners and Get Bounded Convex Curvature. - Mikkel Abrahamsen; Mikkel Thorup (Discret. Comput. Geom., 2023)

Tiling with Squares and Packing Dominos in Polynomial Time. - Anders Aamand; Mikkel Abrahamsen; Thomas D. Ahle; Peter M. R. Rasmussen (ACM Trans. Algorithms, 2023)

Clustering with Few Disks to Minimize the Sum of Radii. - Mikkel Abrahamsen; Sarita de Berg; Lucas Meijer; André Nusser; Leonidas Theocharous (SoCG, 2024)

Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. - Mikkel Abrahamsen; Ioana O. Bercea; Lorenzo Beretta 001; Jonas Klausen; László Kozma 002 (ESA, 2024)

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares. - Mikkel Abrahamsen; Jack Stade (FOCS, 2024)

Minimum Star Partitions of Simple Polygons in Polynomial Time. - Mikkel Abrahamsen; Joakim Blikstad; André Nusser; Hanwen Zhang 003 (STOC, 2024)

Ten Problems in Geobotics. - Mikkel Abrahamsen; Dan Halperin (CoRR, 2024)

Framework for ∃ ℝ-Completeness of Two-Dimensional Packing Problems. - Mikkel Abrahamsen; Tillmann Miltzow; Nadja Seiferth (TheoretiCS, 2024)

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting. - Mikkel Abrahamsen (SIGACT News, 2024)

Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings. - Mikkel Abrahamsen; Kevin Buchin; Maike Buchin; Linda Kleist; Maarten Löffler; Lena Schlipf; André Schulz 001; Jack Stade (SoCG, 2025)

Computing Non-Obtuse Triangulations with Few Steiner Points (CG Challenge). - Mikkel Abrahamsen; Florestan Brunck; Jacobus Conradi; Benedikt Kolbe; André Nusser (SoCG, 2025)

Partitioning a Polygon Into Small Pieces. - Mikkel Abrahamsen; Nichlas Langhoff Rasmussen (SODA, 2025)

Geometric Embeddability of Complexes is ∃ℝ-complete. - Mikkel Abrahamsen; Linda Kleist; Tillmann Miltzow (J. ACM, 2025)

Computing Non-Obtuse Triangulations with Few Steiner Points. - Mikkel Abrahamsen; Florestan Brunck; Jacobus Conradi; Benedikt Kolbe; André Nusser (CoRR, 2025)

nonObtuseTri. - Mikkel Abrahamsen; Florestan Brunck; Jacobus Conradi; Benedikt Kolbe; André Nusser (DROPS Artifacts, 2025)