( en | de | ru )

 

Disambiguation of "de Mesmay, Arnaud"

Author of the publication

copydeleteadd this publication to your clipboard
Tightening Curves on Surfaces Monotonically with Applications.

, and . SODA, page 747-766. SIAM, (2020)

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.

Arnaud Mende

Arnaud Moris

Julien Arnaud

Arnaud Dewalque

Arnaud Casteigts

 

Other publications of authors with the same name

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs., , , and . J. ACM, 68 (4): 30:1-30:26 (2021)On the Complexity of Immersed Normal Surfaces., , and . CoRR, (2014)Embeddability in R3 is NP-hard., , , and . CoRR, (2017)Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries., , , and . Discret. Comput. Geom., 70 (2): 323-354 (September 2023)Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres., and . Discret. Comput. Geom., 71 (1): 95-120 (January 2024)Interactions between algorithms, geometry and topology in low dimensions. (Interactions entre les algorithmes, la géométrie et la topologie en basse dimension).. (2022)Embeddability in ℝ3 is NP-hard., , , and . SODA, page 1316-1329. SIAM, (2018)Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces., , and . SoCG, page 335. ACM, (2014)Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs., , , and . SoCG, volume 129 of LIPIcs, page 27:1-27:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the tree-width of knot diagrams., , , and . J. Comput. Geom., 10 (1): 164-180 (2019)