Mikkel Abrahamsen

Mikkel Abrahamsen

Associate Professor

ORCID: 0000-0003-2734-4690

Publication year:
All
1 - 10 out of 24Page size: 10
Sort by: 1st author
  1. Published

    Classifying convex bodies by their contact and intersection graphs

    Aamand, Anders, Abrahamsen, Mikkel, Knudsen, J. B. T. & Rasmussen, Peter Michael Reichstein, 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, 16 p. 3. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 189).

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

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

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

  4. Published

    Best laid plans of lions and men

    Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 6. (Leibniz International Proceedings in Informatics, Vol. 77).

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

  5. Published

    Range-clustering queries

    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, 16 p. 5. (Leibniz International Proceedings in Informatics, Vol. 77).

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

  6. Published

    An optimal algorithm computing edge-to-edge visibility in a simple polygon

    Abrahamsen, Mikkel, 2013, Proceedings of the 25th Canadian Conference on Computational Geometry: CCCG 2013. p. 157-162 6 p.

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

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

  8. Published

    Finding the maximum subset with bounded convex curvature

    Abrahamsen, Mikkel & Thorup, Mikkel, 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 17 p. 4. (Leibniz International Proceedings in Informatics, Vol. 51).

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

  9. Published

    The art gallery problem is ∃ ℝ-complete

    Abrahamsen, Mikkel, Adamaszek, A. & Miltzow, T., 2018, STOC 2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 65-73

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

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

Previous 1 2 3 Next

ID: 122742218