( en | de | ru )

 

Disambiguation of "Abrahamsen, Mikkel"

Author of the publication

copydeleteadd this publication to your clipboard
Geometric Embeddability of Complexes Is ∃ℝ-Complete.

, , and . SoCG, volume 258 of LIPIcs, page 1:1-1:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Haike Abrahamsen

Ole Abrahamsen

Mikkel Leth Jespersen

Mikkel Skou Christensen

 

Other publications of authors with the same name

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs., , , , and . CoRR, (2016)On the Asymptotic Enumeration of LEGO Structures., and . Experimental Mathematics, 20 (2): 145-152 (2011)Classifying Convex Bodies by their Contact and Intersection Graphs., , , and . CoRR, (2019)Classifying Convex Bodies by Their Contact and Intersection Graphs., , , and . SoCG, volume 189 of LIPIcs, page 3:1-3:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Finding the Maximum Subset with Bounded Convex Curvature., and . SoCG, volume 51 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Constructing Concise Convex Covers via Clique Covers (CG Challenge)., , and . SoCG, volume 258 of LIPIcs, page 66:1-66:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks., and . SoCG, volume 258 of LIPIcs, page 2:1-2:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace., and . ACM Trans. Algorithms, 15 (1): 12:1-12:21 (2019)Minimum Star Partitions of Simple Polygons in Polynomial Time., , , and . CoRR, (2023)Geometric Embeddability of Complexes is ∃R-complete., , and . CoRR, (2021)