Mikkel Abrahamsen

Mikkel Abrahamsen is an Associate Professor at the Department of Computer Science, University of Copenhagen. His research focuses on computational geometry and theoretical computer science, particularly in packing, covering, and partitioning problems.

• Education: MSc in Datalogi, University of Copenhagen (2013).

His research interests include ∃ℝ-completeness, geometric algorithms, clustering, and online algorithm design. He has contributed to understanding the complexity of problems like PSPACE-hardness in geometric reconfiguration and polynomial-time solutions for star partitions.

His recent work spans computational geometry, clustering optimization, and online sorting algorithms, with acceptance at top venues like FOCS, STOC, and SODA. His 2024 publications include advancements in unit square packing and geometric reconfiguration.

Scientific awards include the Carlsberg Semper Ardens grant and the Sapere Aude research leader grant, highlighting his impact in theoretical computer science.

He advises PhD students such as Florestan Brunck, Jack Stade, and Hanwen Zhang. His outreach has been featured in Inside Science, Atlas Obscura, and Danish media outlets like Ingeniøren and Datatech.