Clément Maria

CoRR, July, 2025

Hardness of Computation of Quantum Invariants on 3-Manifolds with Restricted Topology.

[BibT_eX]

[DOI]

Henrique Ennes

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti Number.

[BibT_eX]

[DOI]

Colleen Delaney

Eric Samperton

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

Hard Diagrams of the Unknot.

[BibT_eX]

[DOI]

Exp. Math., July, 2024

2022

Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds.

[BibT_eX]

[DOI]

Owen Rouillé

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Computing complete hyperbolic structures on cusped 3-manifolds.

[BibT_eX]

[DOI]

Owen Rouillé

CoRR, 2021

Parameterized Complexity of Quantum Knot Invariants.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Computation of Large Asymptotics of 3-Manifold Quantum Invariants.

[BibT_eX]

[DOI]

Owen Rouillé

Proceedings of the 23rd Symposium on Algorithm Engineering and Experiments, 2021

2020

A Polynomial-Time Algorithm to Compute Turaev-Viro Invariants $\mathrm {TV}_{4, q}$ of 3-Manifolds with Bounded First Betti Number.

[BibT_eX]

[DOI]

Found. Comput. Math., 2020

Intrinsic Topological Transforms via the Distance Kernel Embedding.

[BibT_eX]

[DOI]

Steve Oudot

Elchanan Solomon

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Parameterized complexity of quantum invariants.

[BibT_eX]

[DOI]

CoRR, 2019

Discrete Morse Theory for Computing Zigzag Persistence.

[BibT_eX]

[DOI]

Hannah Schreiber

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2017

A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Computing Zigzag Persistent Cohomology.

[BibT_eX]

[DOI]

Steve Oudot

CoRR, 2016

Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Zigzag Persistence via Reflections and Transpositions.

[BibT_eX]

[DOI]

Steve Y. Oudot

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Algorithms and Complexity for Turaev-Viro Invariants.

[BibT_eX]

[DOI]

Benjamin A. Burton

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Algorithms and data structures in computational topology. (Algorithmes et structures de données en topologie algorithmique).

[BibT_eX]

[DOI]

PhD thesis, 2014

Introduction to the R package TDA.

[BibT_eX]

[DOI]

CoRR, 2014

The Gudhi Library: Simplicial Complexes and Persistent Homology.

[BibT_eX]

[DOI]

Marc Glisse

Mariette Yvinec

Proceedings of the Mathematical Software - ICMS 2014, 2014

Computing Persistent Homology with Various Coefficient Fields in a Single Pass.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology.

[BibT_eX]

[DOI]

Tamal K. Dey

Proceedings of the Algorithms - ESA 2013, 2013

2012

An Exponential Lower Bound on the Complexity of Regularization Paths.

[BibT_eX]

[DOI]

Bernd Gärtner

Martin Jaggi

J. Comput. Geom., 2012

The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes.

[BibT_eX]

[DOI]