Arnaud de Mesmay

From MaRDI portal
Person:280917

Available identifiers

zbMath Open de-mesmay.arnaudMaRDI QIDQ280917

List of research outcomes





PublicationDate of PublicationType
Fitting metrics and ultrametrics with minimum disagreements2025-01-23Paper
A PTAS for \(\ell_0\)-low rank approximation: solving dense CSPs over reals2024-11-28Paper
Short topological decompositions of non-orientable surfaces2024-10-25Paper
A structural approach to tree decompositions of knots and spatial graphs2024-10-16Paper
Hard Diagrams of the Unknot2024-10-02Paper
Representing matroids over the reals is \(\exists \mathbb{R}\)-complete2024-09-17Paper
Voting algorithms for unique games on complete graphs2024-05-14Paper
Finding weakly simple closed quasigeodesics on polyhedral spheres2024-05-14Paper
Finding weakly simple closed quasigeodesics on polyhedral spheres2024-01-09Paper
Tightening Curves on Surfaces Monotonically with Applications2023-10-31Paper
Degenerate crossing number and signed reversal distance2023-08-21Paper
Algorithms for contractibility of compressed curves on 3-manifold boundaries2023-08-17Paper
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs2023-03-14Paper
Universal families of arcs and curves on surfaces2023-02-13Paper
Distributed coloring and the local structure of unit-disk graphs2023-01-30Paper
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs2022-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50889812022-07-18Paper
Almost tight lower bounds for hard cutting problems in embedded graphs2022-07-18Paper
Distributed coloring and the local structure of unit-disk graphs2022-06-24Paper
Knots, Reidemeister moves, and algorithms [after Lackenby]2022-04-05Paper
Short Topological Decompositions of Non-Orientable Surfaces2022-03-13Paper
Constructing monotone homotopies and sweepouts2022-02-01Paper
Hard Diagrams of the Unknot2021-04-28Paper
The unbearable hardness of unknotting2021-03-10Paper
A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals2021-02-08Paper
Tightening Curves on Surfaces Monotonically with Applications2021-02-02Paper
Embeddability in \(R^3\) is NP-hard2020-11-11Paper
Homotopy height, grid-major height and graph-drawing height2020-10-26Paper
Link crossing number is NP-hard2020-08-27Paper
On the tree-width of knot diagrams2019-07-23Paper
Dimension reduction for finite trees in \(\ell_1\)2019-05-10Paper
Local and algorithmic moves of knots according to Lackenby2018-11-23Paper
Discrete systolic inequalities and decompositions of triangulated surfaces2018-04-23Paper
Embeddability in \(\mathbb R^3\) is NP-hard2018-03-15Paper
On the complexity of optimal homotopies2018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q46079082018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q46078812018-03-15Paper
A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals2018-03-15Paper
Finding non-orientable surfaces in 3-manifolds2018-01-30Paper
Shortest path embeddings of graphs on surfaces2018-01-30Paper
Finding non-orientable surfaces in 3-manifolds2018-01-11Paper
Shortest path embeddings of graphs on surfaces2018-01-11Paper
Constructing monotone homotopies and sweepouts2017-04-20Paper
On the complexity of immersed normal surfaces2016-05-10Paper
A fixed parameter tractable approximation scheme for the optimal cut graph of a surface2015-11-19Paper
Discrete systolic inequalities and decompositions of triangulated surfaces2015-06-18Paper
Testing graph isotopies on surfaces2014-08-07Paper
Testing graph isotopy on surfaces2014-03-25Paper
Dimension reduction for finite trees in \(\ell_1\)2014-01-24Paper
Representing Matroids over the Reals is $\exists \mathbb R$-completeN/APaper
Hopf Arborescent Links, Minor Theory, and Decidability of the Genus DefectN/APaper

Research outcomes over time

This page was built for person: Arnaud de Mesmay