The Art Gallery Problem is ∃ℝ-complete M Abrahamsen, A Adamaszek, T Miltzow ACM Journal of the ACM (JACM) 69 (1), 1-70, 2021 | 129 | 2021 |
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 | 44* | 2020 |
Training neural networks is ∃ℝ-complete M Abrahamsen, L Kleist, T Miltzow Advances in Neural Information Processing Systems 34, 18293-18306, 2021 | 43 | 2021 |
Covering polygons is even harder M Abrahamsen 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 32 | 2022 |
Irrational guards are sometimes needed M Abrahamsen, A Adamaszek, T Miltzow Symposiun on Computational Geometry 2017, 2017 | 29 | 2017 |
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 | 21 | 2016 |
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 | 20 | 2019 |
Geometric Embeddability of Complexes is -complete M Abrahamsen, L Kleist, T Miltzow Symposium on Computational Geometry (SoCG), 2021 | 16 | 2021 |
On the asymptotic enumeration of LEGO structures M Abrahamsen, S Eilers Experimental Mathematics 20 (2), 145-152, 2011 | 15 | 2011 |
Range-clustering queries M Abrahamsen, M de Berg, K Buchin, M Mehr, AD Mehrabi Symposium on Computational Geometry (SoCG 2017), 2017 | 12 | 2017 |
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 | 11 | 2018 |
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 |
Best laid plans of lions and men M Abrahamsen, J Holm, E Rotenberg, C Wulff-Nilsen Symposiun on Computational Geometry 2017, 2017 | 10 | 2017 |
Near-optimal induced universal graphs for bounded degree graphs M Abrahamsen, S Alstrup, J Holm, MBT Knudsen, M Stöckel ICALP, 2016 | 10 | 2016 |
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon M Abrahamsen Canadian Conference on Computational Geometry (CCCG), 2013 | 10 | 2013 |
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 | 8 | 2020 |
Constant-workspace algorithms for visibility problems in the plane M Abrahamsen Master's thesis, University of Copenhagen, 2013 | 8 | 2013 |
Dynamic toolbox for ETRINV M Abrahamsen, T Miltzow arXiv preprint arXiv:1912.08674, 2019 | 6 | 2019 |
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 | 5 | 2023 |
Escaping an infinitude of lions M Abrahamsen, J Holm, E Rotenberg, C Wulff-Nilsen The American Mathematical Monthly 127 (10), 880-896, 2020 | 5 | 2020 |