Follow
Mikkel Abrahamsen
Mikkel Abrahamsen
Associate Professor of Computer Science, University of Copenhagen
Verified email at di.ku.dk - Homepage
Title
Cited by
Cited by
Year
The Art Gallery Problem is ∃ℝ-complete
M Abrahamsen, A Adamaszek, T Miltzow
ACM Journal of the ACM (JACM) 69 (1), 1-70, 2021
1212021
Training neural networks is ∃ℝ-complete
M Abrahamsen, L Kleist, T Miltzow
Advances in Neural Information Processing Systems 34, 18293-18306, 2021
412021
Framework for ∃ℝ-completeness of two-dimensional packing problems
M Abrahamsen, T Miltzow, N Seiferth
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
41*2020
Covering polygons is even harder
M Abrahamsen
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
302022
Irrational guards are sometimes needed
M Abrahamsen, A Adamaszek, T Miltzow
Symposiun on Computational Geometry 2017, 2017
272017
Spiral Toolpaths for High-Speed Machining of 2D Pockets With or Without Islands
M Abrahamsen
Journal of Computational Design and Engineering 6 (1), 105-117, 2019
192019
Graph reconstruction with a betweenness oracle
M Abrahamsen, G Bodwin, E Rotenberg, M Stöckel
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) 47, 5 …, 2016
192016
Geometric Embeddability of Complexes is -complete
M Abrahamsen, L Kleist, T Miltzow
Symposium on Computational Geometry (SoCG), 2021
152021
On the asymptotic enumeration of LEGO structures
M Abrahamsen, S Eilers
Experimental Mathematics 20 (2), 145-152, 2011
152011
Range-clustering queries
M Abrahamsen, M de Berg, K Buchin, M Mehr, AD Mehrabi
Symposium on Computational Geometry (SoCG 2017), 2017
122017
Common tangents of two disjoint polygons in linear time and constant workspace
M Abrahamsen, B Walczak
ACM Transactions on Algorithms (TALG) 15 (1), 1-21, 2018
10*2018
Fast fencing
M Abrahamsen, A Adamaszek, K Bringmann, V Cohen-Addad, M Mehr, ...
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
102018
Best laid plans of lions and men
M Abrahamsen, J Holm, E Rotenberg, C Wulff-Nilsen
Symposiun on Computational Geometry 2017, 2017
102017
Near-optimal induced universal graphs for bounded degree graphs
M Abrahamsen, S Alstrup, J Holm, MBT Knudsen, M Stöckel
ICALP, 2016
102016
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon
M Abrahamsen
Canadian Conference on Computational Geometry (CCCG), 2013
102013
Constant-workspace algorithms for visibility problems in the plane
M Abrahamsen
Master's thesis, University of Copenhagen, 2013
82013
Geometric multicut: Shortest fences for separating groups of objects in the plane
M Abrahamsen, P Giannopoulos, M Löffler, G Rote
Discrete & Computational Geometry 64 (3), 575-607, 2020
62020
Constructing concise convex covers via clique covers (cg challenge)
M Abrahamsen, W Bille Meyling, A Nusser
39th International Symposium on Computational Geometry (SoCG 2023), 2023
52023
Near-optimal induced universal graphs for cycles and paths
M Abrahamsen, S Alstrup, J Holm, MBT Knudsen, M Stöckel
Discrete Applied Mathematics 282, 1-13, 2020
52020
Dynamic Toolbox for ETRINV
M Abrahamsen, T Miltzow
arXiv preprint arXiv:1912.08674, 2019
52019
The system can't perform the operation now. Try again later.
Articles 1–20