Mikkel Abrahamsen
Associate Professor
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
ORCID: 0000-0003-2734-4690
1 - 3 out of 3Page size: 50
- 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
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