Mikkel Abrahamsen

Mikkel Abrahamsen

Associate Professor


  1. 2023
  2. Published

    Constructing Concise Convex Covers via Clique Covers

    Abrahamsen, Mikkel, Meyling, William Bille & Nusser, André Fritz, 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-9 66. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 258).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  3. Published

    Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity

    Abrahamsen, Mikkel, Geft, T., Halperin, D. & Ugav, B., 2023, AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems. Association for Computing Machinery, p. 932-940

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  4. Published

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

    Abrahamsen, Mikkel & Walczak, B., 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-16 2. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 258).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  5. Published

    Geometric Embeddability of Complexes Is ∃R-Complete

    Abrahamsen, Mikkel, Kleist, L. & Miltzow, T., 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 1. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 258).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  6. Published

    How to Cut Corners and Get Bounded Convex Curvature

    Abrahamsen, Mikkel & Thorup, Mikkel, 2023, In: Discrete and Computational Geometry. 69, p. 1195–1231,

    Research output: Contribution to journalJournal articleResearchpeer-review

  7. Published

    Online Sorting and Translational Packing of Convex Polygons

    Aamand, A., Abrahamsen, Mikkel, Beretta, Lorenzo & Kleist, L., 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Bansal, N. & Nagarajan, V. (eds.). Society for Industrial and Applied Mathematics, p. 1806-1833

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  8. Published

    Tiling with Squares and Packing Dominos in Polynomial Time

    Aamand, A., Abrahamsen, Mikkel, Rasmussen, Peter Michael Reichstein & Ahle, T. D., 2023, In: ACM Transactions on Algorithms. 19, 3, p. 1-28 30.

    Research output: Contribution to journalJournal articleResearchpeer-review

  9. 2022
  10. Published

    The Art Gallery Problem is ∃ℝ-complete

    Abrahamsen, Mikkel, Adamaszek, A. & Miltzow, T., 28 Feb 2022, In: Journal of the ACM. 69, 1, p. 1-70 4.

    Research output: Contribution to journalJournal articleResearchpeer-review

  11. Published

    Chasing Puppies: Mobile Beacon Routing on Closed Curves

    Abrahamsen, Mikkel, Erickson, J., Kostitsyna, I., Löffler, M., Miltzow, T., Urhausen, J., Vermeulen, J. & Viglietta, G., 2022, In: Journal of Computational Geometry. 13, 2, p. 115-150

    Research output: Contribution to journalJournal articleResearchpeer-review

  12. Published

    Covering Polygons is Even Harder

    Abrahamsen, Mikkel, 2022, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 375-386

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Previous 1 2 3 4 Next

ID: 122742218