Mikkel Abrahamsen
Mikkel Abrahamsen
Department of Computer Science, University of Copenhagen
Bekræftet mail på di.ku.dk - Startside
Titel
Citeret af
Citeret af
År
The art gallery problem is ∃ℝ-complete
M Abrahamsen, A Adamaszek, T Miltzow
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
382018
On the asymptotic enumeration of LEGO structures
M Abrahamsen, S Eilers
Experimental Mathematics 20 (2), 145-152, 2011
142011
Irrational guards are sometimes needed
M Abrahamsen, A Adamaszek, T Miltzow
arXiv preprint arXiv:1701.05475, 2017
122017
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon
M Abrahamsen
CCCG, 2013
102013
Range-clustering queries
M Abrahamsen, M de Berg, K Buchin, M Mehr, AD Mehrabi
Symposium on Computational Geometry (SoCG 2017), 2017
82017
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
7*2019
Constant-workspace algorithms for visibility problems in the plane
M Abrahamsen
Master's thesis, University of Copenhagen, 2013
72013
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
6*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
62018
Minimum perimeter-sum partitions in the plane
M Abrahamsen, M de Berg, K Buchin, M Mehr, AD Mehrabi
arXiv preprint arXiv:1703.05549, 2017
52017
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
52016
Best laid plans of lions and men
M Abrahamsen, J Holm, E Rotenberg, C Wulff-Nilsen
arXiv preprint arXiv:1703.03687, 2017
42017
Near-optimal induced universal graphs for bounded degree graphs
M Abrahamsen, S Alstrup, J Holm, MBT Knudsen, M Stöckel
arXiv preprint arXiv:1607.04911, 2016
42016
Efficient counting of LEGO structures
M Abrahamsen, S Eilers
Citeseer, 2007
32007
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
2*2020
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
22020
A generic method for finding coresets for clustering problems
M Abrahamsen, M de Berg, K Buchin, M Mehr, AD Mehrabi
European Workshop on Computational Geometry, 249-252, 2017
22017
Dynamic Toolbox for ETRINV
M Abrahamsen, T Miltzow
arXiv preprint arXiv:1912.08674, 2019
12019
Classifying Convex Bodies by their Contact and Intersection Graphs
A Aamand, M Abrahamsen, JBT Knudsen, PMR Rasmussen
arXiv preprint arXiv:1902.01732, 2019
12019
Finding the Maximum Subset with Bounded Convex Curvature
M Abrahamsen, M Thorup
32nd International Symposium on Computational Geometry (SoCG 2016) 51, 4:1--4:17, 2016
12016
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20