| Publication | Date of Publication | Type |
|---|
Fitting metrics and ultrametrics with minimum disagreements
SIAM Journal on Computing | 2025-01-23 | Paper |
| A PTAS for \(\ell_0\)-low rank approximation: solving dense CSPs over reals | 2024-11-28 | Paper |
Short topological decompositions of non-orientable surfaces
Discrete & Computational Geometry | 2024-10-25 | Paper |
| A structural approach to tree decompositions of knots and spatial graphs | 2024-10-16 | Paper |
Hard Diagrams of the Unknot
Experimental Mathematics | 2024-10-02 | Paper |
Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-17 | Paper |
| Voting algorithms for unique games on complete graphs | 2024-05-14 | Paper |
| Finding weakly simple closed quasigeodesics on polyhedral spheres | 2024-05-14 | Paper |
Finding weakly simple closed quasigeodesics on polyhedral spheres
Discrete & Computational Geometry | 2024-01-09 | Paper |
Tightening Curves on Surfaces Monotonically with Applications
ACM Transactions on Algorithms | 2023-10-31 | Paper |
| Degenerate crossing number and signed reversal distance | 2023-08-21 | Paper |
Algorithms for contractibility of compressed curves on 3-manifold boundaries
Discrete & Computational Geometry | 2023-08-17 | Paper |
| A Structural Approach to Tree Decompositions of Knots and Spatial Graphs | 2023-03-14 | Paper |
| Universal families of arcs and curves on surfaces | 2023-02-13 | Paper |
Distributed coloring and the local structure of unit-disk graphs
Theoretical Computer Science | 2023-01-30 | Paper |
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs
Journal of the ACM | 2022-12-08 | Paper |
| scientific article; zbMATH DE number 7559249 (Why is no real title available?) | 2022-07-18 | Paper |
Almost tight lower bounds for hard cutting problems in embedded graphs
(available as arXiv preprint) | 2022-07-18 | Paper |
Distributed coloring and the local structure of unit-disk graphs
Algorithms for Sensor Systems | 2022-06-24 | Paper |
| Knots, Reidemeister moves, and algorithms [after Lackenby] | 2022-04-05 | Paper |
| Short Topological Decompositions of Non-Orientable Surfaces | 2022-03-13 | Paper |
Constructing monotone homotopies and sweepouts
Journal of Differential Geometry | 2022-02-01 | Paper |
Constructing monotone homotopies and sweepouts
Journal of Differential Geometry | 2022-02-01 | Paper |
| Hard Diagrams of the Unknot | 2021-04-28 | Paper |
The unbearable hardness of unknotting
Advances in Mathematics | 2021-03-10 | Paper |
The unbearable hardness of unknotting
Advances in Mathematics | 2021-03-10 | Paper |
A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals
SIAM Journal on Computing | 2021-02-08 | Paper |
Tightening Curves on Surfaces Monotonically with Applications
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Embeddability in \(R^3\) is NP-hard
Journal of the ACM | 2020-11-11 | Paper |
Homotopy height, grid-major height and graph-drawing height
(available as arXiv preprint) | 2020-10-26 | Paper |
Link crossing number is NP-hard
Journal of Knot Theory and Its Ramifications | 2020-08-27 | Paper |
On the tree-width of knot diagrams
(available as arXiv preprint) | 2019-07-23 | Paper |
| Dimension reduction for finite trees in \(\ell_1\) | 2019-05-10 | Paper |
| Local and algorithmic moves of knots according to Lackenby | 2018-11-23 | Paper |
Discrete systolic inequalities and decompositions of triangulated surfaces
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Embeddability in \(\mathbb R^3\) is NP-hard | 2018-03-15 | Paper |
Embeddability in \(\mathbb R^3\) is NP-hard
(available as arXiv preprint) | 2018-03-15 | Paper |
| On the complexity of optimal homotopies | 2018-03-15 | Paper |
On the complexity of optimal homotopies
(available as arXiv preprint) | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6850339 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850339 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6850316 (Why is no real title available?) | 2018-03-15 | Paper |
| A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals | 2018-03-15 | Paper |
| Finding non-orientable surfaces in 3-manifolds | 2018-01-30 | Paper |
| Shortest path embeddings of graphs on surfaces | 2018-01-30 | Paper |
Finding non-orientable surfaces in 3-manifolds
Discrete & Computational Geometry | 2018-01-11 | Paper |
Finding non-orientable surfaces in 3-manifolds
Discrete & Computational Geometry | 2018-01-11 | Paper |
Shortest path embeddings of graphs on surfaces
Discrete & Computational Geometry | 2018-01-11 | Paper |
Shortest path embeddings of graphs on surfaces
Discrete & Computational Geometry | 2018-01-11 | Paper |
Constructing monotone homotopies and sweepouts
(available as arXiv preprint) | 2017-04-20 | Paper |
On the complexity of immersed normal surfaces
Geometry & Topology | 2016-05-10 | Paper |
A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Discrete systolic inequalities and decompositions of triangulated surfaces
Discrete & Computational Geometry | 2015-06-18 | Paper |
Testing graph isotopies on surfaces
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Testing graph isotopy on surfaces
Discrete & Computational Geometry | 2014-03-25 | Paper |
Dimension reduction for finite trees in \(\ell_1\)
Discrete & Computational Geometry | 2014-01-24 | Paper |
Representing Matroids over the Reals is $\exists \mathbb R$-complete
(available as arXiv preprint) | N/A | Paper |
Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect
(available as arXiv preprint) | N/A | Paper |
