Mikkel Abrahamsen

Mikkel Abrahamsen

Associate Professor

ORCID: 0000-0003-2734-4690

Publication year:
All
11 - 20 out of 37Page size: 10
Sort by: 1st author
  1. 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

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

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

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

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

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

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

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

  9. Published

    Fast fencing

    Abrahamsen, Mikkel, Adamaszek, A., Bringmann, K., Cohen-Addad, V., Mehr, M., Rotenberg, E., Roytman, A. & Thorup, Mikkel, 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 564-573

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

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

Previous 1 2 3 4 Next

ID: 122742218