Mikkel Abrahamsen

Mikkel Abrahamsen

Associate Professor


  1. 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

  2. Published

    Irrational Guards are Sometimes Needed

    Abrahamsen, Mikkel, Adamaszek, A. & Miltzow, T., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-15 3. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 77).

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

  3. Published

    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, p. 483–505

    Research output: Contribution to journalJournal articleResearchpeer-review

  4. Published

    Minimum perimeter-sum partitions in the plane

    Abrahamsen, Mikkel, de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 4. (Leibniz International Proceedings in Informatics, Vol. 77).

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

  5. Published

    Near-Optimal Induced Universal Graphs for Bounded Degree Graphs

    Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2017, 44th International Colloquium on Automata, Languages, and Programming (ICALP 201. Chatzigiannaki, I., Indyk, P., Kuhn, F. & Muscholl, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-14 128. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 80).

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

  6. Published

    Near-optimal induced universal graphs for cycles and paths

    Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2020, In: Discrete Applied Mathematics. 282, p. 1-13 13 p.

    Research output: Contribution to journalJournal articleResearchpeer-review

  7. Published

    New results on classical problems in computational geometry in the plane

    Abrahamsen, Mikkel, 2017, Department of Computer Science, Faculty of Science, University of Copenhagen.

    Research output: Book/ReportPh.D. thesisResearch

  8. 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

  9. Published

    Online packing to minimize area or perimeter

    Abrahamsen, Mikkel & Beretta, Lorenzo, 2021, 37th International Symposium on Computational Geometry, SoCG 2021. Buchin, K. & de Verdiere, E. C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 p. 6. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 189).

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

  10. Published

    Outer common tangents and nesting of convex hulls in linear time and constant workspace

    Abrahamsen, Mikkel & Walczak, B., 2016, 24th Annual European Symposium on Algorithms (ESA 2016). Sankowski, P. & Zaroliagis, C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 4. (Leibniz International Proceedings in Informatics, Vol. 57).

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

ID: 122742218