Mikkel Abrahamsen

Mikkel Abrahamsen

Associate Professor

ORCID: 0000-0003-2734-4690

Publication year:
All
1 - 4 out of 4Page size: 10
  1. 2022
  2. 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 journal › Journal article › Research › peer-review

  3. 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 journal › Journal article › Research › peer-review

  4. 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 proceeding › Article in proceedings › Research › peer-review

  5. Published

    Tiling with Squares and Packing Dominos in Polynomial Time

    Aamand, Anders, Abrahamsen, Mikkel, Ahle, T. & Rasmussen, Peter Michael Reichstein, 2022, 38th International Symposium on Computational Geometry, SoCG 2022. Goaoc, X. & Kerber, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 1. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 224).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

ID: 122742218