Mikkel Abrahamsen

Mikkel Abrahamsen

Associate Professor


  1. 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 proceedingArticle in proceedingsResearchpeer-review

  2. Published

    An optimal algorithm for the separating common tangents of two polygons

    Abrahamsen, Mikkel, 2015, In: Leibniz International Proceedings in Informatics. 34, p. 198-208 11 p.

    Research output: Contribution to journalConference articleResearchpeer-review

  3. 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 proceedingArticle in proceedingsResearchpeer-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 journalJournal articleResearchpeer-review

  5. 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 proceedingArticle in proceedingsResearchpeer-review

  6. Published

    Classifying convex bodies by their contact and intersection graphs

    Aamand, A., Abrahamsen, Mikkel, Houen, Jakob Bæk Tejs & 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 proceedingArticle in proceedingsResearchpeer-review

  7. Published

    Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace

    Abrahamsen, Mikkel & Walczak, B., 2019, In: ACM Transactions on Algorithms. 15, 1, p. 1-21 12.

    Research output: Contribution to journalJournal articleResearchpeer-review

  8. 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 proceedingArticle in proceedingsResearchpeer-review

  9. 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 proceedingArticle in proceedingsResearchpeer-review

  10. 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 proceedingArticle in proceedingsResearchpeer-review

Previous 1 2 3 4 Next

ID: 122742218