Author of the publication

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.

 

Other publications of authors with the same name

Embeddability in R3 is NP-hard., , , and . J. ACM, 67 (4): 20:1-20:29 (2020)The Unbearable Hardness of Unknotting., , , and . SoCG, volume 129 of LIPIcs, page 49:1-49:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Embeddability in R3 is NP-hard., , , and . CoRR, (2017)Embeddability in ℝ3 is NP-hard., , , and . SODA, page 1316-1329. SIAM, (2018)Finite planar emulators for K4, 5-4K2 and K1, 2, 2, 2 and Fellows' Conjecture., and . Eur. J. Comb., 31 (3): 903-907 (2010)