( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimum Star Partitions of Simple Polygons in Polynomial Time.

, , , и . CoRR, (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.

Haike Abrahamsen

Ole Abrahamsen

Mikkel Skou Christensen

Mikkel Leth Jespersen

 

Другие публикации лиц с тем же именем

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