From post

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.

 

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

Embeddability in ℝ3 is NP-hard., , , и . SODA, стр. 1316-1329. SIAM, (2018)Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces., , и . SoCG, стр. 335. ACM, (2014)Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs., , , и . SoCG, том 129 из LIPIcs, стр. 27:1-27:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Embeddability in R3 is NP-hard., , , и . CoRR, (2017)Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries., , , и . CoRR, (2020)A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals., , и . SODA, стр. 1439-1458. SIAM, (2018)Testing graph isotopies on surfaces., и . SCG, стр. 141-150. ACM, (2012)Finding Non-Orientable Surfaces in 3-Manifolds., , и . SoCG, том 51 из LIPIcs, стр. 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Triangulations in Geometry and Topology (Dagstuhl Seminar 24072)., , , , и . Dagstuhl Reports, 14 (2): 120-163 (2024)Topics in Low-Dimensional Computational Topology. (Problèmes de topologie algorithmique en basse dimension).. École Normale Supérieure, Paris, France, (2014)