Mikkel Abrahamsen

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 66

Top Topics

Convexity Measure

Packing Problem

Multiple Robots

Top Venues

Discret. Comput. Geom.

Publications

Mikkel Abrahamsen, Jack Stade
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares. CoRR (2024)
Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma
Online sorting and online TSP: randomized, stochastic, and high-dimensional. CoRR (2024)
Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang
Minimum Star Partitions of Simple Polygons in Polynomial Time. STOC (2024)
Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous
Clustering with Few Disks to Minimize the Sum of Radii. SoCG (2024)
Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous
Clustering with Few Disks to Minimize the Sum of Radii. CoRR (2023)
Mikkel Abrahamsen, Bartosz Walczak
Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks. SoCG (2023)
Anders Aamand, Mikkel Abrahamsen, Peter M. R. Rasmussen, Thomas D. Ahle
Tiling with Squares and Packing Dominos in Polynomial Time. ACM Trans. Algorithms 19 (3) (2023)
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
Geometric Embeddability of Complexes Is ∃ℝ-Complete. SoCG (2023)
Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist
Online Sorting and Translational Packing of Convex Polygons. SODA (2023)
Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang
Minimum Star Partitions of Simple Polygons in Polynomial Time. CoRR (2023)
Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. CoRR (2023)
Mikkel Abrahamsen, Mikkel Thorup
How to Cut Corners and Get Bounded Convex Curvature. Discret. Comput. Geom. 69 (4) (2023)
Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. AAMAS (2023)
Mikkel Abrahamsen, William Bille Meyling, André Nusser
Constructing Concise Convex Covers via Clique Covers (CG Challenge). SoCG (2023)
Mikkel Abrahamsen
Covering Polygons is Even Harder. FOCS (2022)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
The Art Gallery Problem is ∃ℝ-complete. J. ACM 69 (1) (2022)
Mikkel Abrahamsen, Viktor Fredslund-Hansen
Degree of Convexity and Expected Distances in Polygons. CoRR (2022)
Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen
Tiling with Squares and Packing Dominos in Polynomial Time. SoCG (2022)
Mikkel Abrahamsen, Nichlas Langhoff Rasmussen
Partitioning a Polygon Into Small Pieces. CoRR (2022)
Mikkel Abrahamsen, Lorenzo Beretta
Online Packing to Minimize Area or Perimeter. SoCG (2021)
Mikkel Abrahamsen
Covering Polygons is Even Harder. CoRR (2021)
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
Training Neural Networks is ER-complete. NeurIPS (2021)
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
Training Neural Networks is ER-complete. CoRR (2021)
Mikkel Abrahamsen
Covering Polygons is Even Harder. FOCS (2021)
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG (2021)
Mikkel Abrahamsen, Bartosz Walczak
Distinguishing classes of intersection graphs of homothets or similarities of two convex disks. CoRR (2021)
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
Geometric Embeddability of Complexes is ∃R-complete. CoRR (2021)
Mikkel Abrahamsen, Lorenzo Beretta
Online Packing to Minimize Area or Perimeter. CoRR (2021)
Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen
Classifying Convex Bodies by Their Contact and Intersection Graphs. SoCG (2021)
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
Chasing Puppies: Mobile Beacon Routing on Closed Curves. CoRR (2021)
Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist
Online Sorting and Translational Packing of Convex Polygons. CoRR (2021)
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel
Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282 (2020)
Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup
Disks in Curves of Bounded Convex Curvature. Am. Math. Mon. 127 (7) (2020)
Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen
Tiling with Squares and Packing Dominos in Polynomial Time. CoRR (2020)
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
Framework for ∃R-Completeness of Two-Dimensional Packing Problems. CoRR (2020)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Escaping an Infinitude of Lions. Am. Math. Mon. 127 (10) (2020)
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
Framework for ER-Completeness of Two-Dimensional Packing Problems. FOCS (2020)
Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. 64 (3) (2020)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Escaping an Infinitude of Lions. CoRR (2020)
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
Minimum Perimeter-Sum Partitions in the Plane. Discret. Comput. Geom. 63 (2) (2020)
Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
Geometric Multicut. CoRR (2019)
Mikkel Abrahamsen, Tillmann Miltzow
Dynamic Toolbox for ETRINV. CoRR (2019)
Mikkel Abrahamsen
Spiral tool paths for high-speed machining of 2D pockets with or without islands. J. Comput. Des. Eng. 6 (1) (2019)
Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup
Disks in Curves of Bounded Convex Curvature. CoRR (2019)
Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
Geometric Multicut. ICALP (2019)
Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen
Classifying Convex Bodies by their Contact and Intersection Graphs. CoRR (2019)
Mikkel Abrahamsen, Bartosz Walczak
Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace. ACM Trans. Algorithms 15 (1) (2019)
Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
Fast Fencing. CoRR (2018)
Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
Fast fencing. STOC (2018)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
The art gallery problem is ∃ ℝ-complete. STOC (2018)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
The Art Gallery Problem is ∃ℝ-complete. CoRR (2017)
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
Minimum Perimeter-Sum Partitions in the Plane. CoRR (2017)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
Irrational Guards are Sometimes Needed. SoCG (2017)
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
Range-Clustering Queries. SoCG (2017)
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
Irrational Guards are Sometimes Needed. CoRR (2017)
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. ICALP (2017)
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
Minimum Perimeter-Sum Partitions in the Plane. SoCG (2017)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Best Laid Plans of Lions and Men. CoRR (2017)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Best Laid Plans of Lions and Men. SoCG (2017)
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
Range-Clustering Queries. CoRR (2017)
Mikkel Abrahamsen, Bartosz Walczak
Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace. ESA (2016)
Mikkel Abrahamsen, Mikkel Thorup
Finding the Maximum Subset with Bounded Convex Curvature. SoCG (2016)
Mikkel Abrahamsen, Mikkel Thorup
Finding the Maximum Subset with Bounded Convex Curvature. CoRR (2016)
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. CoRR (2016)
Mikkel Abrahamsen, Bartosz Walczak
Outer common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace. CoRR (2016)
Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel
Graph Reconstruction with a Betweenness Oracle. STACS (2016)
Mikkel Abrahamsen
An Optimal Algorithm for the Separating Common Tangents of Two Polygons. SoCG (2015)
Mikkel Abrahamsen
An Optimal Algorithm for the Separating Common Tangents of two Polygons. CoRR (2015)
Mikkel Abrahamsen
Spiral Toolpaths for High-Speed Machining of 2D Pockets with or without Islands. CoRR (2014)
Mikkel Abrahamsen
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon. CCCG (2013)
Mikkel Abrahamsen, Søren Eilers
On the Asymptotic Enumeration of LEGO Structures. Exp. Math. 20 (2) (2011)