Arnaud DE MESMAY
Chargé de Recherche CNRS
Equipe Architecture, Géométrie, Perception, Images, Gestes
Département Images et Signal
ME CONTACTER / CONTACT ME
Mail : arnaud.de-mesmay@gipsa-lab.grenoble-inp.fr

11 rue des mathématiques
Domaine Universitaire
BP 46
38402 Saint Martin d'Hères cedex

Bureau D1115
Tél.33 (0)4 76 82 62 67
Fax : 33 (0)4 76 57 47 90
PUBLICATIONS RECENTES / RECENT PUBLICATIONS
Les derniéres publications de la collection Gipsa dans HAL

Almost tight lower bounds for hard cutting problems in embedded graphs

Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay. Almost tight lower bounds for hard cutting problems in embedded graphs. 35th International Symposium on Computational Geometry (SoCG 2019), Jun 2019, Portland, OR, United States. ⟨hal-02136928⟩

The unbearable hardness of unknotting

Arnaud de Mesmay, Yoav Rieck, Eric Sedgwick, Martin Tancer. The unbearable hardness of unknotting. 35th International Symposium on Computational Geometry (SoCG 2019), Jun 2019, Portland, United States. ⟨hal-02136935⟩

Tightening Curves on Surfaces Via Local Moves

Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, et al.. Tightening Curves on Surfaces Via Local Moves. ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. ⟨hal-01649785⟩

On the complexity of optimal homotopies

Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders. On the complexity of optimal homotopies. ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. ⟨hal-01649771⟩

Embeddability in R^3 is NP-hard

Arnaud de Mesmay, Yoav Rieck, Eric Sedgwick, Martin Tancer. Embeddability in R^3 is NP-hard. ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. ⟨hal-01649774⟩

A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals

Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay. A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. ⟨hal-01649756⟩

The Bane of Low-Dimensionality Clustering

Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman. The Bane of Low-Dimensionality Clustering. ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. ⟨hal-01649763⟩

Finding Non-orientable Surfaces in 3-Manifolds

Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner. Finding Non-orientable Surfaces in 3-Manifolds. Discrete and Computational Geometry, Springer Verlag, 2017, 58 (4), pp.871--888. ⟨10.1007/s00454-017-9900-0⟩. ⟨hal-01539682⟩

Shortest path embeddings of graphs on surfaces

Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer. Shortest path embeddings of graphs on surfaces. Discrete and Computational Geometry, Springer Verlag, 2017, 58 (4), pp.921--945. ⟨10.1007/s00454-017-9898-3⟩. ⟨hal-01539791⟩

Finding non-orientable surfaces in 3-manifolds

Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner. Finding non-orientable surfaces in 3-manifolds. 32nd International Symposium on Computational Geometry (SoCG 2016), Jun 2016, Boston, United States. pp.24:1--24:15, ⟨10.4230/LIPIcs.SoCG.2016.24⟩. ⟨hal-01355133⟩

Grenoble Images Parole Signal Automatique laboratoire

UMR 5216 CNRS - Grenoble INP - Université Joseph Fourier - Université Stendhal