Mikkel Abrahamsen

Mikkel Abrahamsen

Associate Professor

ORCID: 0000-0003-2734-4690

Publication year:
All
1 - 10 out of 24Page size: 10
  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 proceeding › Article in proceedings › Research › peer-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 proceeding › Article in proceedings › Research › peer-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 proceeding › Article in proceedings › 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

    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

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

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

  10. 2021
  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., 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, 19 p. 5. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 189).

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

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

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

Previous 1 2 3 Next

ID: 122742218