Mikkel Abrahamsen

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