Dimension reduction for finite trees in L_1 - James R. Lee; Arnaud de Mesmay; Mohammad Moharrami (CoRR, 2011)

Testing graph isotopies on surfaces. - Arnaud de Mesmay; Éric Colin de Verdière (SCG, 2012)

Dimension reduction for finite trees in l1. - James R. Lee; Arnaud de Mesmay; Mohammad Moharrami (SODA, 2012)

Dimension Reduction for Finite Trees in ℓ 1. - James R. Lee; Arnaud de Mesmay; Mohammad Moharrami (Discret. Comput. Geom., 2013)

On the Complexity of Immersed Normal Surfaces. - Benjamin A. Burton; Éric Colin de Verdière; Arnaud de Mesmay (CoRR, 2014)

Testing Graph Isotopy on Surfaces. - Éric Colin de Verdière; Arnaud de Mesmay (Discret. Comput. Geom., 2014)

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

A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. - Vincent Cohen-Addad; Arnaud de Mesmay (ESA, 2015)

Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. - Éric Colin de Verdière; Alfredo Hubard; Arnaud de Mesmay (Discret. Comput. Geom., 2015)

Finding Non-orientable Surfaces in 3-Manifolds. - Benjamin A. Burton; Arnaud de Mesmay; Uli Wagner 001 (Discret. Comput. Geom., 2017)

Shortest Path Embeddings of Graphs on Surfaces. - Alfredo Hubard; Vojtech Kaluza; Arnaud de Mesmay; Martin Tancer (Discret. Comput. Geom., 2017)

On the complexity of optimal homotopies. - Erin Wolf Chambers; Arnaud de Mesmay; Tim Ophelders (SODA, 2018)

Tightening Curves on Surfaces via Local Moves. - Hsien-Chih Chang; Jeff Erickson 001; David Letscher; Arnaud de Mesmay; Saul Schleimer; Eric Sedgwick; Dylan Thurston; Stephan Tillmann (SODA, 2018)

The Bane of Low-Dimensionality Clustering. - Vincent Cohen-Addad; Arnaud de Mesmay; Eva Rotenberg; Alan Roytman (SODA, 2018)

The Unbearable Hardness of Unknotting. - Arnaud de Mesmay; Yo'av Rieck; Eric Sedgwick; Martin Tancer (SoCG, 2019)

Homotopy Height, Grid-Major Height and Graph-Drawing Height. - Therese Biedl; Erin Wolf Chambers; David Eppstein; Arnaud de Mesmay; Tim Ophelders (GD, 2019)

Link Crossing Number is NP-hard. - Arnaud de Mesmay; Marcus Schaefer 001; Eric Sedgwick (CoRR, 2019)

On the tree-width of knot diagrams. - Saul Schleimer; Arnaud de Mesmay; Jessica S. Purcell; Eric Sedgwick (J. Comput. Geom., 2019)

Embeddability in R3 is NP-hard. - Arnaud de Mesmay; Yo'av Rieck; Eric Sedgwick; Martin Tancer (J. ACM, 2020)

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 (J. ACM, 2021)

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 (SIAM J. Comput., 2021)

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

Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062). - Maike Buchin; Anna Lubiw; Arnaud de Mesmay; Saul Schleimer (Dagstuhl Reports, 2022)

Tightening Curves on Surfaces Monotonically with Applications. - Hsien-Chih Chang; Arnaud de Mesmay (ACM Trans. Algorithms, 2022)

A Structural Approach to Tree Decompositions of Knots and Spatial Graphs. - Corentin Lunel; Arnaud de Mesmay (SoCG, 2023)

Degenerate Crossing Number and Signed Reversal Distance. - Niloufar Fuladi; Alfredo Hubard; Arnaud de Mesmay (GD (1), 2023)

Voting algorithms for unique games on complete graphs. - Antoine Méot; Arnaud de Mesmay; Moritz Mühlenthaler; Alantha Newman (SOSA, 2023)

A PTAS for 𝓁0-Low Rank Approximation: Solving Dense CSPs over Reals. - Vincent Cohen-Addad; Chenglin Fan; Suprovat Ghoshal; Euiwoong Lee; Arnaud de Mesmay; Alantha Newman; Tony Chang Wang (CoRR, 2023)

Distributed coloring and the local structure of unit-disk graphs. - Louis Esperet; Sébastien Julliot; Arnaud de Mesmay (Theor. Comput. Sci., 2023)

Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. - Erin Wolf Chambers; Francis Lazarus; Arnaud de Mesmay; Salman Parsa (Discret. Comput. Geom., 2023)

Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect. - Pierre Dehornoy; Corentin Lunel; Arnaud de Mesmay (SoCG, 2024)

A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. - Vincent Cohen-Addad; Chenglin Fan; Suprovat Ghoshal; Euiwoong Lee; Arnaud de Mesmay; Alantha Newman; Tony Chang Wang (SODA, 2024)

Triangulations in Geometry and Topology (Dagstuhl Seminar 24072). - Maike Buchin; Jean Cardinal; Arnaud de Mesmay; Jonathan Spreer; Alex He (Dagstuhl Reports, 2024)

Representing Matroids over the Reals is ∃ℝ-complete. - Eun Jung Kim 002; Arnaud de Mesmay; Tillmann Miltzow (Discret. Math. Theor. Comput. Sci., 2024)

Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. - Jean Chartier; Arnaud de Mesmay (Discret. Comput. Geom., 2024)

Hard Diagrams of the Unknot. - Benjamin A. Burton; Hsien-Chih Chang; Maarten Löffler; Clément Maria; Arnaud de Mesmay; Saul Schleimer; Eric Sedgwick; Jonathan Spreer (Exp. Math., 2024)

Short Topological Decompositions of Non-orientable Surfaces. - Niloufar Fuladi; Alfredo Hubard; Arnaud de Mesmay (Discret. Comput. Geom., 2024)

Hard Diagrams of Split Links. - Corentin Lunel; Arnaud de Mesmay; Jonathan Spreer (SoCG, 2025)

Fitting Metrics and Ultrametrics with Minimum Disagreements. - Vincent Cohen-Addad; Chenglin Fan; Euiwoong Lee; Arnaud de Mesmay (SIAM J. Comput., 2025)

Crossing numbers of dense graphs on surfaces. - Alfredo Hubard; Arnaud de Mesmay; Hugo Parlier (CoRR, 2025)