Arnaud de Mesmay

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 54

Top Topics

Tree Decompositions

Principal Curves

Top Venues

Discret. Comput. Geom.

Publications

Jean Chartier, Arnaud de Mesmay
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. Discret. Comput. Geom. 71 (1) (2024)
Maike Buchin, Jean Cardinal, Arnaud de Mesmay, Jonathan Spreer, Alex He
Triangulations in Geometry and Topology (Dagstuhl Seminar 24072). Dagstuhl Reports 14 (2) (2024)
Pierre Dehornoy, Corentin Lunel, Arnaud de Mesmay
Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect. SoCG (2024)
Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang
-Low Rank Approximation: Solving Dense CSPs over Reals. SODA (2024)
Corentin Lunel, Arnaud de Mesmay
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs. SoCG (2023)
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. Discret. Comput. Geom. 70 (2) (2023)
Corentin Lunel, Arnaud de Mesmay
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs. CoRR (2023)
Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman
Voting algorithms for unique games on complete graphs. SOSA (2023)
Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay
Degenerate Crossing Number and Signed Reversal Distance. GD (1) (2023)
Pierre Dehornoy, Corentin Lunel, Arnaud de Mesmay
Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect. CoRR (2023)
Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang
-Low Rank Approximation: Solving Dense CSPs over Reals. CoRR (2023)
Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay
Degenerate crossing number and signed reversal distance. CoRR (2023)
Louis Esperet, Sébastien Julliot, Arnaud de Mesmay
Distributed coloring and the local structure of unit-disk graphs. Theor. Comput. Sci. 944 (2023)
Eunjung Kim, Arnaud de Mesmay, Tillmann Miltzow
Representing Matroids over the Reals is ∃R-complete. CoRR (2023)
Hsien-Chih Chang, Arnaud de Mesmay
Tightening Curves on Surfaces Monotonically with Applications. ACM Trans. Algorithms 18 (4) (2022)
Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay
Short Topological Decompositions of Non-Orientable Surfaces. SoCG (2022)
Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay
Fitting Metrics and Ultrametrics with Minimum Disagreements. FOCS (2022)
Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay
Short Topological Decompositions of Non-Orientable Surfaces. CoRR (2022)
Jean Chartier, Arnaud de Mesmay
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. CoRR (2022)
Jean Chartier, Arnaud de Mesmay
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. SoCG (2022)
Maike Buchin, Anna Lubiw, Arnaud de Mesmay, Saul Schleimer
Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062). Dagstuhl Reports 12 (2) (2022)
Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay
Fitting Metrics and Ultrametrics with Minimum Disagreements. CoRR (2022)
Louis Esperet, Sébastien Julliot, Arnaud de Mesmay
Distributed Coloring and the Local Structure of Unit-Disk Graphs. ALGOSENSORS (2021)
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. J. ACM 68 (4) (2021)
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. SoCG (2021)
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. SIAM J. Comput. 50 (1) (2021)
Louis Esperet, Sébastien Julliot, Arnaud de Mesmay
Distributed coloring and the local structure of unit-disk graphs. CoRR (2021)
Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman
Voting algorithms for unique games on complete graphs. CoRR (2021)
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
is NP-hard. J. ACM 67 (4) (2020)
Hsien-Chih Chang, Arnaud de Mesmay
Tightening Curves on Surfaces Monotonically with Applications. CoRR (2020)
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. CoRR (2020)
Hsien-Chih Chang, Arnaud de Mesmay
Tightening Curves on Surfaces Monotonically with Applications. SODA (2020)
Therese C. Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
Homotopy Height, Grid-Major Height and Graph-Drawing Height. Graph Drawing (2019)
Saul Schleimer, Arnaud de Mesmay, Jessica S. Purcell, Eric Sedgwick
On the tree-width of knot diagrams. J. Comput. Geom. 10 (1) (2019)
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
The Unbearable Hardness of Unknotting. SoCG (2019)
Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
Link Crossing Number is NP-hard. CoRR (2019)
Therese C. Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
Homotopy height, grid-major height and graph-drawing height. CoRR (2019)
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. SoCG (2019)
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. CoRR (2019)
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
is NP-hard. SODA (2018)
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. SODA (2018)
Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Dylan Thurston, Stephan Tillmann
Tightening Curves on Surfaces via Local Moves. SODA (2018)
Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman
The Bane of Low-Dimensionality Clustering. SODA (2018)
Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders
On the complexity of optimal homotopies. SODA (2018)
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
is NP-hard. CoRR (2017)
Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman
The Bane of Low-Dimensionality Clustering. CoRR (2017)
Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner
Finding Non-orientable Surfaces in 3-Manifolds. Discret. Comput. Geom. 58 (4) (2017)
Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer
Shortest Path Embeddings of Graphs on Surfaces. Discret. Comput. Geom. 58 (4) (2017)
Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders
On the complexity of optimal homotopies. CoRR (2017)
Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner
Finding non-orientable surfaces in 3-manifolds. CoRR (2016)
Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer
Shortest Path Embeddings of Graphs on Surfaces. SoCG (2016)
Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer
Shortest path embeddings of graphs on surfaces. CoRR (2016)
Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner
Finding Non-Orientable Surfaces in 3-Manifolds. SoCG (2016)
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. CoRR (2016)
Vincent Cohen-Addad, Arnaud de Mesmay
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. ESA (2015)
Vincent Cohen-Addad, Arnaud de Mesmay
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. CoRR (2015)
Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. Discret. Comput. Geom. 53 (3) (2015)
Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. CoRR (2014)
Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. SoCG (2014)
Benjamin A. Burton, Éric Colin de Verdière, Arnaud de Mesmay
On the Complexity of Immersed Normal Surfaces. CoRR (2014)
Éric Colin de Verdière, Arnaud de Mesmay
Testing Graph Isotopy on Surfaces. Discret. Comput. Geom. 51 (1) (2014)
James R. Lee, Arnaud de Mesmay, Mohammad Moharrami
Dimension Reduction for Finite Trees in ℓ 1. Discret. Comput. Geom. 50 (4) (2013)
Éric Colin de Verdière, Arnaud de Mesmay
Testing Graph Isotopy on Surfaces. CoRR (2013)
James R. Lee, Arnaud de Mesmay, Mohammad Moharrami
. SODA (2012)
Arnaud de Mesmay, Éric Colin de Verdière
Testing graph isotopies on surfaces. SCG (2012)
James R. Lee, Arnaud de Mesmay, Mohammad Moharrami
Dimension reduction for finite trees in L_1 CoRR (2011)