Mikkel Abrahamsen
Tenure track adjunkt
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø, Sydfløj, Bygning: 003-1-03
Primary field of research
My primary field of research is computational geometry, which is devoted to the study of algorithms that can be stated in terms of geometry. Most of my work so far has been about problems where the input is points or polygons in the plane.
See also Google scholar profile:
https://scholar.google.com/citations?user=AYGv9T8AAAAJ&hl=en
Selected papers
• Framework for ∃ℝ-Completeness of Two-Dimensional Packing Problems
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth, FOCS 2020.
• The art gallery problem is ∃ℝ-complete
Abrahamsen, Mikkel, Adamaszek, A. & Miltzow, T., 2018, STOC 2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, s. 65-73
• Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace
Abrahamsen, Mikkel & Walczak, B., 2019, I : ACM Transactions on Algorithms. 15, 1, s. 1-21 12.
• Minimum perimeter-sum partitions in the plane
Abrahamsen, Mikkel, de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 2020, In : Discrete & Computational Geometry. 63, s. 483–505
• Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane
Abrahamsen, Mikkel, Giannopoulos, P., Löffler, M. & Rote, G., 2020, In : Discrete & Computational Geometry. 64, p. 575–607
Video recording of talk
ID: 122742218
Flest downloads
-
116
downloads
Spiral tool paths for high-speed machining of 2D pockets with or without islands
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Udgivet -
99
downloads
Graph reconstruction with a betweenness oracle
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Udgivet -
86
downloads
Finding the maximum subset with bounded convex curvature
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Udgivet