Research output per year
Research output per year
Personal profile
Short presentation
See my website.
Education/Academic qualification
Datalogi, Cand.scient., University of Copenhagen
Award Date: 12 Aug 2013
External positions
Algorithms Development Engineer, 3Shape A/S
1 Sept 2017 → 30 Nov 2017
Software development engineer, Autodesk ApS
2011 → 31 Aug 2014
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Geometric Embeddability of Complexes is ∃ℝ-complete
Abrahamsen, M., Kleist, L. & Miltzow, T., 2025, In: Journal of the ACM. 72, 1, 26 p., 9.Research output: Contribution to journal › Journal article › Research › peer-review
Open AccessFile2 Downloads (Pure) -
Partitioning a Polygon Into Small Pieces
Abrahamsen, M. & Rasmussen, N. L., 2025, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Azar, Y. & Panigrahi, D. (eds.). Society for Industrial and Applied Mathematics, p. 3562-3589Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
File1 Downloads (Pure) -
Clustering with Few Disks to Minimize the Sum of Radii
Abrahamsen, M., de Berg, S., Meijer, L., Nusser, A. & Theocharous, L., 2024, In: Leibniz International Proceedings in Informatics, LIPIcs. 293, 15 p., 2.Research output: Contribution to journal › Conference article › Research › peer-review
Open AccessFile1 Citation (Scopus)3 Downloads (Pure) -
ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
Abrahamsen, M., 2024, In: S I G A C T News. 55, 4, p. 108-111Research output: Contribution to journal › Journal article › Research › peer-review
File -
Framework for ∃R-Completeness of Two-Dimensional Packing Problems
Abrahamsen, M., Miltzow, T. & Seiferth, N., 2024, In: TheoretiCS. 3, p. 1-78 11.Research output: Contribution to journal › Journal article › Research › peer-review
Open AccessFile1 Downloads (Pure) -
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
Abrahamsen, M. & Stade, J., 2024, Proceedings - 2024 IEEE 65th Annual Symposium on Foundations of Computer Science, FOCS 2024. IEEE Computer Society Press, p. 1355-1371 17 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Open AccessFile6 Downloads (Pure) -
Minimum Star Partitions of Simple Polygons in Polynomial Time
Abrahamsen, M., Blikstad, J., Nusser, A. & Zhang, H., 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). Association for Computing Machinery, p. 904-910 7 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Open AccessFile3 Downloads (Pure) -
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional
Abrahamsen, M., Bercea, I. O., Beretta, L., Klausen, J. & Kozma, L., 2024, In: Leibniz International Proceedings in Informatics, LIPIcs. 308, 15 p., 5.Research output: Contribution to journal › Conference article › Research › peer-review
Open AccessFile2 Downloads (Pure)