| Publication | Date of Publication | Type |
|---|
Hard Diagrams of the Unknot
Experimental Mathematics | 2024-10-02 | Paper |
Discrete Morse theory for computing zigzag persistence
Discrete & Computational Geometry | 2024-02-09 | Paper |
| An algorithm for Tambara-Yamagami quantum invariants of 3-manifolds, parameterized by the first Betti number | 2023-11-14 | Paper |
Intrinsic topological transforms via the distance kernel embedding
(available as arXiv preprint) | 2023-11-02 | Paper |
| Computing complete hyperbolic structures on cusped 3-manifolds | 2021-12-12 | Paper |
| Hard Diagrams of the Unknot | 2021-04-28 | Paper |
Computation of Large Asymptotics of 3-Manifold Quantum Invariants
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
A polynomial-time algorithm to compute Turaev-Viro invariants \(\mathrm{TV}_{4,q}\) of 3-manifolds with bounded first Betti number
Foundations of Computational Mathematics | 2020-12-15 | Paper |
Discrete Morse theory for computing zigzag persistence
(available as arXiv preprint) | 2020-01-16 | Paper |
Treewidth, crushing and hyperbolic volume
Algebraic & Geometric Topology | 2019-12-12 | Paper |
| Parameterized complexity of quantum invariants | 2019-10-01 | Paper |
Computing persistent homology with various coefficient fields in a single pass
Journal of Applied and Computational Topology | 2019-09-11 | Paper |
Algorithms and complexity for Turaev-Viro invariants
Journal of Applied and Computational Topology | 2019-08-06 | Paper |
A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Discrete Morse Theory for Computing Zigzag Persistence
(available as arXiv preprint) | 2018-07-13 | Paper |
Admissible colourings of 3-manifold triangulations for Turaev-Viro type invariants
(available as arXiv preprint) | 2018-03-02 | Paper |
Zigzag Persistence via Reflections and Transpositions
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS
(available as arXiv preprint) | 2017-03-09 | Paper |
The compressed annotation matrix: an efficient data structure for computing persistent cohomology
Algorithmica | 2015-11-19 | Paper |
Algorithms and complexity for Turaev-Viro invariants
Automata, Languages, and Programming | 2015-10-27 | Paper |
The simplex tree: an efficient data structure for general simplicial complexes
Algorithmica | 2015-01-19 | Paper |
Computing persistent homology with various coefficient fields in a single pass
Lecture Notes in Computer Science | 2014-10-08 | Paper |
The Gudhi library: simplicial complexes and persistent homology
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
The compressed annotation matrix: an efficient data structure for computing persistent cohomology
Lecture Notes in Computer Science | 2013-09-17 | Paper |
The simplex tree: an efficient data structure for general simplicial complexes
Lecture Notes in Computer Science | 2012-09-25 | Paper |
