Arnaud de Mesmay

Orcid: 0000-0002-7301-3799

Affiliations:
  • University Gustave Eiffel Marne-la-Vallée, France


According to our database1, Arnaud de Mesmay authored at least 36 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres.
Discret. Comput. Geom., January, 2024

A PTAS for <i>ℓ</i><sub>0</sub>-Low Rank Approximation: Solving Dense CSPs over Reals.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries.
Discret. Comput. Geom., September, 2023

Distributed coloring and the local structure of unit-disk graphs.
Theor. Comput. Sci., 2023

Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect.
CoRR, 2023

A PTAS for 𝓁<sub>0</sub>-Low Rank Approximation: Solving Dense CSPs over Reals.
CoRR, 2023

Representing Matroids over the Reals is ∃R-complete.
CoRR, 2023

Voting algorithms for unique games on complete graphs.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Degenerate Crossing Number and Signed Reversal Distance.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

A Structural Approach to Tree Decompositions of Knots and Spatial Graphs.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Tightening Curves on Surfaces Monotonically with Applications.
ACM Trans. Algorithms, 2022

Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062).
Dagstuhl Reports, 2022

Fitting Metrics and Ultrametrics with Minimum Disagreements.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Short Topological Decompositions of Non-Orientable Surfaces.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

Interactions between algorithms, geometry and topology in low dimensions. (Interactions entre les algorithmes, la géométrie et la topologie en basse dimension).
, 2022

2021
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals.
SIAM J. Comput., 2021

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.
J. ACM, 2021

2020
Embeddability in R<sup>3</sup> is NP-hard.
J. ACM, 2020

2019
On the tree-width of knot diagrams.
J. Comput. Geom., 2019

Link Crossing Number is NP-hard.
CoRR, 2019

Homotopy Height, Grid-Major Height and Graph-Drawing Height.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

The Unbearable Hardness of Unknotting.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
The Bane of Low-Dimensionality Clustering.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Tightening Curves on Surfaces via Local Moves.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On the complexity of optimal homotopies.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Shortest Path Embeddings of Graphs on Surfaces.
Discret. Comput. Geom., 2017

Finding Non-orientable Surfaces in 3-Manifolds.
Discret. Comput. Geom., 2017

2015
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.
Discret. Comput. Geom., 2015

A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Topics in Low-Dimensional Computational Topology. (Problèmes de topologie algorithmique en basse dimension).
PhD thesis, 2014

Testing Graph Isotopy on Surfaces.
Discret. Comput. Geom., 2014

On the Complexity of Immersed Normal Surfaces.
CoRR, 2014

2013
Dimension Reduction for Finite Trees in ℓ 1.
Discret. Comput. Geom., 2013

2012
Dimension reduction for finite trees in <i>l</i><sub>1</sub>.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Testing graph isotopies on surfaces.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011
Dimension reduction for finite trees in L_1
CoRR, 2011


  Loading...