Mikkel Abrahamsen

According to our database, Mikkel Abrahamsen authored at least 45 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

CoRR, 2024

Ten Problems in Geobotics.

Mikkel Abrahamsen, Dan Halperin

CoRR, 2024

Minimum Star Partitions of Simple Polygons in Polynomial Time.

Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares.

Mikkel Abrahamsen, Jack Stade

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional.

Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Clustering with Few Disks to Minimize the Sum of Radii.

Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Tiling with Squares and Packing Dominos in Polynomial Time.

Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen

ACM Trans. Algorithms, July, 2023

How to Cut Corners and Get Bounded Convex Curvature.

Mikkel Abrahamsen, Mikkel Thorup

Discret. Comput. Geom., June, 2023

Online Sorting and Translational Packing of Convex Polygons.

Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist

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

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

Mikkel Abrahamsen, Bartosz Walczak

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

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

Mikkel Abrahamsen, William Bille Meyling, André Nusser

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

Geometric Embeddability of Complexes Is ∃ℝ-Complete.

Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow

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

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

Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav

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

2022

The Art Gallery Problem is ∃ℝ-complete.

Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow

J. ACM, 2022

Partitioning a Polygon Into Small Pieces.

Mikkel Abrahamsen, Nichlas Langhoff Rasmussen

CoRR, 2022

Degree of Convexity and Expected Distances in Polygons.

Mikkel Abrahamsen, Viktor Fredslund-Hansen

CoRR, 2022

2021

Chasing Puppies: Mobile Beacon Routing on Closed Curves.

Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Till Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta

J. Comput. Geom., 2021

Training Neural Networks is ER-complete.

Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow

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

Covering Polygons is Even Harder.

Mikkel Abrahamsen

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

Online Packing to Minimize Area or Perimeter.

Mikkel Abrahamsen, Lorenzo Beretta

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

Classifying Convex Bodies by Their Contact and Intersection Graphs.

Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen

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

2020

Escaping an Infinitude of Lions.

Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen

Am. Math. Mon., 2020

Disks in Curves of Bounded Convex Curvature.

Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup

Am. Math. Mon., 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

Minimum Perimeter-Sum Partitions in the Plane.

Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi

Discret. Comput. Geom., 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

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

Mikkel Abrahamsen, Tillmann Miltzow, 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.

Mikkel Abrahamsen, Bartosz Walczak

ACM Trans. Algorithms, 2019

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

Mikkel Abrahamsen

J. Comput. Des. Eng., 2019

Dynamic Toolbox for ETRINV.

Mikkel Abrahamsen, Tillmann Miltzow

CoRR, 2019

Geometric Multicut.

Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote

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

2018

Fast fencing.

Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup

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

2017

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs.

Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, 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.

Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen

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

Range-Clustering Queries.

Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi

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

Irrational Guards are Sometimes Needed.

Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow

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.

Mikkel Abrahamsen, Bartosz Walczak

CoRR, 2016

Graph Reconstruction with a Betweenness Oracle.

Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel

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.

Mikkel Abrahamsen, Bartosz Walczak

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

Finding the Maximum Subset with Bounded Convex Curvature.

Mikkel Abrahamsen, Mikkel Thorup

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

2015

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

Mikkel Abrahamsen

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

2014

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

Mikkel Abrahamsen

CoRR, 2014

2013

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

Mikkel Abrahamsen

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

2011

On the Asymptotic Enumeration of LEGO Structures.

Mikkel Abrahamsen, Søren Eilers

Exp. Math., 2011