Mikkel Abrahamsen

Mikkel Abrahamsen

Associate Professor

ORCID: 0000-0003-2734-4690

Publication year:
All
1 - 25 out of 37Page size: 25
  1. 2023
  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, A., Abrahamsen, Mikkel, Rasmussen, Peter Michael Reichstein & Ahle, T. D., 2023, In: ACM Transactions on Algorithms. 19, 3, p. 1-28 30.

    Research output: Contribution to journal › Journal article › Research › peer-review

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

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

  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

    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

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

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

  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., 2022, In: Journal of Computational Geometry. 13, 2, p. 115-150

    Research output: Contribution to journal › Journal article › Research › peer-review

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

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

  14. 2021
  15. 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

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

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

  18. 2020
  19. Published

    Disks in Curves of Bounded Convex Curvature

    Aamand, Anders, Abrahamsen, Mikkel & Thorup, Mikkel, 2020, In: American Mathematical Monthly. 127, 7, p. 579-593 15 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  20. Published

    Escaping an Infinitude of Lions

    Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2020, In: The American Mathematical Monthly. 127, 10, p. 880-896

    Research output: Contribution to journal › Journal article › Research › peer-review

  21. Published

    Framework for er-completeness of two-dimensional packing problems

    Abrahamsen, Mikkel, Miltzow, T. & Seiferth, N., 2020, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE Computer Society Press, p. 1014-1021 9317895

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

  22. Published

    Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane

    Abrahamsen, Mikkel, Giannopoulos, P., Löffler, M. & Rote, G., 2020, In: Discrete & Computational Geometry. 64, p. 575–607

    Research output: Contribution to journal › Journal article › Research › peer-review

  23. Published

    Minimum perimeter-sum partitions in the plane

    Abrahamsen, Mikkel, de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 2020, In: Discrete & Computational Geometry. 63, p. 483–505

    Research output: Contribution to journal › Journal article › Research › peer-review

  24. Published

    Near-optimal induced universal graphs for cycles and paths

    Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2020, In: Discrete Applied Mathematics. 282, p. 1-13 13 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

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

  27. Published

    Geometric multicut

    Abrahamsen, Mikkel, Giannopoulos, P., Löffler, M. & Rote, G., 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 p. 9. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 132).

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

  28. Published

    Spiral tool paths for high-speed machining of 2D pockets with or without islands

    Abrahamsen, Mikkel, 1 Jan 2019, In: Journal of Computational Design and Engineering. 6, 1, p. 105-117

    Research output: Contribution to journal › Journal article › Research › peer-review

  29. 2018
  30. 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

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

Previous 1 2 Next

ID: 122742218