Mikkel Abrahamsen
Associate Professor
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
- 2013
- 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
- 2015
- 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 journal › Conference article › Research › peer-review
- Published
Spiral toolpaths for high-speed machining of 2d pockets with or without islands
Abrahamsen, Mikkel, 2015, Proceedings of the ASME 2015 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference IDETC/CIE 2015. American Society of Mechanical Engineers, Vol. 2B. 10 p. DETC2015-46255Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2016
- 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
- Published
Graph reconstruction with a betweenness oracle
Abrahamsen, Mikkel, Bodwin, G., Rotenberg, E. & Stöckel, M. D., 2016, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Ollinger, N. & Vollmer, H. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 5:1-5:14 14 p. 5. (Leibniz International Proceedings in Informatics, Vol. 47).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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
- 2017
- 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
- Published
Irrational Guards are Sometimes Needed
Abrahamsen, Mikkel, Adamaszek, A. & Miltzow, T., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-15 3. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 77).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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
- Published
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2017, 44th International Colloquium on Automata, Languages, and Programming (ICALP 201. Chatzigiannaki, I., Indyk, P., Kuhn, F. & Muscholl, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-14 128. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 80).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 122742218
Most downloads
-
216
downloads
Spiral tool paths for high-speed machining of 2D pockets with or without islands
Research output: Contribution to journal › Journal article › Research › peer-review
Published -
170
downloads
Graph reconstruction with a betweenness oracle
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
121
downloads
Best laid plans of lions and men
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published