default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikkel Abrahamsen
Person information
- affiliation: University of Copenhagen, Department of Computer Science, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth:
Framework for ∃ ℝ-Completeness of Two-Dimensional Packing Problems. TheoretiCS 3 (2024)- [c29]Mikkel Abrahamsen, Sarita de Berg
, Lucas Meijer, André Nusser, Leonidas Theocharous:
Clustering with Few Disks to Minimize the Sum of Radii. SoCG 2024: 2:1-2:15 - [c28]Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma:
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. ESA 2024: 5:1-5:15 - [c27]Mikkel Abrahamsen, Jack Stade:
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares. FOCS 2024: 1355-1371 - [c26]Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang:
Minimum Star Partitions of Simple Polygons in Polynomial Time. STOC 2024: 904-910 - [i34]Mikkel Abrahamsen, Jack Stade:
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares. CoRR abs/2404.09835 (2024) - [i33]Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma:
Online sorting and online TSP: randomized, stochastic, and high-dimensional. CoRR abs/2406.19257 (2024) - [i32]Mikkel Abrahamsen, Dan Halperin:
Ten Problems in Geobotics. CoRR abs/2408.12657 (2024) - [i31]Mikkel Abrahamsen:
ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting. CoRR abs/2409.00794 (2024) - 2023
- [j12]Mikkel Abrahamsen, Mikkel Thorup:
How to Cut Corners and Get Bounded Convex Curvature. Discret. Comput. Geom. 69(4): 1195-1231 (2023) - [j11]Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. ACM Trans. Algorithms 19(3): 30:1-30:28 (2023) - [c25]Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav:
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. AAMAS 2023: 932-940 - [c24]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Geometric Embeddability of Complexes Is ∃ℝ-Complete. SoCG 2023: 1:1-1:19 - [c23]Mikkel Abrahamsen, Bartosz Walczak:
Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks. SoCG 2023: 2:1-2:16 - [c22]Mikkel Abrahamsen, William Bille Meyling, André Nusser:
Constructing Concise Convex Covers via Clique Covers (CG Challenge). SoCG 2023: 66:1-66:9 - [c21]Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist:
Online Sorting and Translational Packing of Convex Polygons. SODA 2023: 1806-1833 - [i30]Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav:
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. CoRR abs/2303.00745 (2023) - [i29]Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang:
Minimum Star Partitions of Simple Polygons in Polynomial Time. CoRR abs/2311.10631 (2023) - [i28]Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous:
Clustering with Few Disks to Minimize the Sum of Radii. CoRR abs/2312.08803 (2023) - 2022
- [j10]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
The Art Gallery Problem is ∃ℝ-complete. J. ACM 69(1): 4:1-4:70 (2022) - [c20]Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. SoCG 2022: 1:1-1:17 - [i27]Mikkel Abrahamsen, Viktor Fredslund-Hansen:
Degree of Convexity and Expected Distances in Polygons. CoRR abs/2208.07106 (2022) - [i26]Mikkel Abrahamsen, Nichlas Langhoff Rasmussen:
Partitioning a Polygon Into Small Pieces. CoRR abs/2211.01359 (2022) - 2021
- [j9]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Till Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. J. Comput. Geom. 13(2): 115-150 (2021) - [c19]Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen:
Classifying Convex Bodies by Their Contact and Intersection Graphs. SoCG 2021: 3:1-3:16 - [c18]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG 2021: 5:1-5:19 - [c17]Mikkel Abrahamsen, Lorenzo Beretta:
Online Packing to Minimize Area or Perimeter. SoCG 2021: 6:1-6:15 - [c16]Mikkel Abrahamsen:
Covering Polygons is Even Harder. FOCS 2021: 375-386 - [c15]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Training Neural Networks is ER-complete. NeurIPS 2021: 18293-18306 - [i25]Mikkel Abrahamsen, Lorenzo Beretta:
Online Packing to Minimize Area or Perimeter. CoRR abs/2101.09024 (2021) - [i24]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Training Neural Networks is ER-complete. CoRR abs/2102.09798 (2021) - [i23]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. CoRR abs/2103.09811 (2021) - [i22]Mikkel Abrahamsen:
Covering Polygons is Even Harder. CoRR abs/2106.02335 (2021) - [i21]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Geometric Embeddability of Complexes is ∃R-complete. CoRR abs/2108.02585 (2021) - [i20]Mikkel Abrahamsen, Bartosz Walczak:
Distinguishing classes of intersection graphs of homothets or similarities of two convex disks. CoRR abs/2108.04588 (2021) - [i19]Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist:
Online Sorting and Translational Packing of Convex Polygons. CoRR abs/2112.03791 (2021) - 2020
- [j8]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282: 1-13 (2020) - [j7]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. Discret. Comput. Geom. 63(2): 483-505 (2020) - [j6]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. 64(3): 575-607 (2020) - [j5]Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup:
Disks in Curves of Bounded Convex Curvature. Am. Math. Mon. 127(7): 579-593 (2020) - [j4]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Escaping an Infinitude of Lions. Am. Math. Mon. 127(10): 880-896 (2020) - [c14]Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth:
Framework for ER-Completeness of Two-Dimensional Packing Problems. FOCS 2020: 1014-1021 - [i18]Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth:
Framework for ∃R-Completeness of Two-Dimensional Packing Problems. CoRR abs/2004.07558 (2020) - [i17]Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. CoRR abs/2011.10983 (2020) - [i16]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Escaping an Infinitude of Lions. CoRR abs/2012.11181 (2020)
2010 – 2019
- 2019
- [j3]Mikkel Abrahamsen:
Spiral tool paths for high-speed machining of 2D pockets with or without islands. J. Comput. Des. Eng. 6(1): 105-117 (2019) - [j2]Mikkel Abrahamsen, Bartosz Walczak:
Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace. ACM Trans. Algorithms 15(1): 12:1-12:21 (2019) - [c13]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut. ICALP 2019: 9:1-9:15 - [i15]Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen:
Classifying Convex Bodies by their Contact and Intersection Graphs. CoRR abs/1902.01732 (2019) - [i14]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut. CoRR abs/1902.04045 (2019) - [i13]Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup:
Disks in Curves of Bounded Convex Curvature. CoRR abs/1909.00852 (2019) - [i12]Mikkel Abrahamsen, Tillmann Miltzow:
Dynamic Toolbox for ETRINV. CoRR abs/1912.08674 (2019) - 2018
- [c12]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
The art gallery problem is ∃ ℝ-complete. STOC 2018: 65-73 - [c11]Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup:
Fast fencing. STOC 2018: 564-573 - [i11]Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup:
Fast Fencing. CoRR abs/1804.00101 (2018) - 2017
- [c10]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
Irrational Guards are Sometimes Needed. SoCG 2017: 3:1-3:15 - [c9]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. SoCG 2017: 4:1-4:15 - [c8]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Range-Clustering Queries. SoCG 2017: 5:1-5:16 - [c7]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. SoCG 2017: 6:1-6:16 - [c6]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. ICALP 2017: 128:1-128:14 - [i10]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
Irrational Guards are Sometimes Needed. CoRR abs/1701.05475 (2017) - [i9]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. CoRR abs/1703.03687 (2017) - [i8]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. CoRR abs/1703.05549 (2017) - [i7]Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
The Art Gallery Problem is ∃ℝ-complete. CoRR abs/1704.06969 (2017) - [i6]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Range-Clustering Queries. CoRR abs/1705.06242 (2017) - 2016
- [c5]Mikkel Abrahamsen, Mikkel Thorup:
Finding the Maximum Subset with Bounded Convex Curvature. SoCG 2016: 4:1-4:17 - [c4]Mikkel Abrahamsen, Bartosz Walczak:
Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace. ESA 2016: 4:1-4:15 - [c3]Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel:
Graph Reconstruction with a Betweenness Oracle. STACS 2016: 5:1-5:14 - [i5]Mikkel Abrahamsen, Bartosz Walczak:
Outer common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace. CoRR abs/1601.01816 (2016) - [i4]Mikkel Abrahamsen, Mikkel Thorup:
Finding the Maximum Subset with Bounded Convex Curvature. CoRR abs/1603.02080 (2016) - [i3]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. CoRR abs/1607.04911 (2016) - 2015
- [c2]Mikkel Abrahamsen:
An Optimal Algorithm for the Separating Common Tangents of Two Polygons. SoCG 2015: 198-208 - [i2]Mikkel Abrahamsen:
An Optimal Algorithm for the Separating Common Tangents of two Polygons. CoRR abs/1511.04036 (2015) - 2014
- [i1]Mikkel Abrahamsen:
Spiral Toolpaths for High-Speed Machining of 2D Pockets with or without Islands. CoRR abs/1412.5034 (2014) - 2013
- [c1]Mikkel Abrahamsen:
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon. CCCG 2013 - 2011
- [j1]Mikkel Abrahamsen, Søren Eilers:
On the Asymptotic Enumeration of LEGO Structures. Exp. Math. 20(2): 145-152 (2011)
Coauthor Index
aka: Till Miltzow
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 01:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
