Welcome to the homepage of Mikkel Abrahamsen

I'm an associate professor at the Department of Computer Science at  University of Copenhagen. My research interests are discrete and computational geometry.

I received a Carlsberg Semper Ardens grant and am also a  Sapere Aude research leader.

Email: miab@di.ku.dk

dblp

Google Scholar

News:

• New paper on partitioning into small pieces at SoCG 2026. (June 2026)

• Jack received the best student paper award at STOC for his paper on NP-membership of the boundary-boundary art gallery problem!

• New paper on maximum polygon overlap at SODA 2026. (January 2026)

• Our paper on reconfiguration problems was presented at SoCG 2025! (June 2025)

• Our team won CG:SHOP 2025! (March 2025)

• New paper showing PSPACE hardness of simpler cases of geometric reconfiguration problems. (December 2024)

• I received DKK 7 mio. from the Carlsberg Foundation for my project IrregularFit. (December 2024)

• Our paper on Partitioning a Polygon into Small Pieces was accepted for SODA 2025! (October 2024)

• New paper suggesting ten problems in geobotics. (August 2024)

• Our new paper on Online Sorting was accepted for ESA 2024! (June 2024)

• Our paper showing hardness of packing unit squares in a simple polygon was accepted for FOCS 2024! (June 2024)

• New paper showing hardness of packing unit squares in a simple polygon, disproving a 20+ years old conjecture unless P = NP. (April 2024)

• Our paper on minimum star partitions was accepted to STOC! (February 2023)

• Our paper on the minimum radius sum clustering problem was accepted to SoCG! (February 2023)

• New paper about the minimum radius sum clustering problem for few clusters. (December 2023)

• New paper with an algorithm for computing a minimum star partition of a simple polygon, answering a 40+ years old question often repeated. (November 2023)

• Our paper on robot motion planning got accepted to AAMAS 2023. (May 2023)

• Two papers accepted for SoCG 2023! (February 2023)

• Our team won CG:SHOP 2023! (February 2023)

PhD students:

• Asbjørn Lind (since 2026)

• Florestan Brunck (since 2024)

• Jack Stade (since 2023)

• Hanwen Zhang (since 2022)

• Lorenzo Beretta (graduated 2024, now postdoc at IBM Cambridge, MA)

• Anders Aamand (graduated 2020, now assistant professor at Rice University, Texas)

• Stephan Sloth Lorenzen (graduated 2019, now at Aiomic)

• Niklas Hjuler (graduated 2019, now at Edlund)

Postdocs:

• Jacobus Conradi (since 2025)

• Sampson Wong (since 2023)

• Aurélien Ooms (2019-2020)

Member of program committees:

• ACM-SIAM Symposium on Discrete Algorithms (SODA 2026)

• European Symposium on Algorithms (ESA track S 2026)

• EATCS International Colloquium on Automata, Languages and Programming (ICALP 2026)

• European Workshop on Computational Geometry (EuroCG 2026)

• Symposium on Computational Geometry (SoCG 2025)

• Highlights of Algorithms (HALG 2023)

• EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)

• European Symposium on Algorithms (ESA track A 2022)

• Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)

• Computational Geometry: Young Researchers Forum (CG:YRF 2021)

• Symposium on Computational Geometry (SoCG 2020)

• Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)

• European Workshop on Computational Geometry (EuroCG 2018)

Recordings of research talks:

• The art gallery problem is ∃ℝ-complete (see Supplementary Material)

• Recent developments on ∃ℝ-completeness of packing and other problems

• Online Sorting and Translational Packing of Convex Polygons

• Covering Polygons is Even Harder

• Tiling with Squares and Packing Dominos in Polynomial Time

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

Outreach

• Inside Science: Mathematicians Scrutinize the Challenge of Efficient Christmas Cookie Cutting

• Atlas Obscura: The Satisfaction of Mathematically Efficient Christmas Cookies

• Ingeniøren (Danish): Julebagning og bevogtning af kunstmuseer er svært for dataloger

• Datatech (Danish): Dansk forsker: Neurale netværks kompleksitet kan sluge al energi i verden - »begræns anvendelsen«