Parameterized complexity of quantum knot invariants -
M.
- Proceedings of the International Symposium on Computational Geometry (SoCG 2021), extended abstract
- preprint arXiv:1910.00477 (2019)
Computation of large asymptotics of 3-manifold quantum invariants -
M., Rouillé
- Proceedings of SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2021), extended abstract
- preprint arXiv:2010.14316 (2020)
Intrinsic topological transforms via the distance kernel embedding -
M., Oudot, Solomon
- Proceedings of the International Symposium on Computational Geometry (SoCG 2020), extended abstract
- preprint arXiv:1912.02225 (2019)
A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number -
M., Spreer
- Foundations of Computational Mathematics FoCM (2020)
- Symposium on Discrete Algorithms SoDA: 2721-2732 (2017)
Treewidth, crushing and hyperbolic volume -
M., Purcell
- Algebraic & Geometric Topology 19: 2625–2652 (2019)
Discrete Morse theory for computing zigzag persistence -
M., Schreiber
- Prodceedings of the Algorithms and Data Structures Conference WADS: 538-552 (2019), extended abstract
Computing persistent homology with various coefficient fields in a single pass -
Boissonnat, M.
- Journal of Applied and Computational Topology JACT 3(1-2): 59-84 (2019)
- European Symposium on Algorithms ESA: 185-196 (2015)
Algorithms and complexity for Turaev-Viro invariants -
Burton, Maria, Spreer
- Journal of Applied and Computational Topology JACT 2(1-2): 33-53 (2018)
- International Colloquium on Automata, Languages and Programming ICALP (1): 281-293 (2015)
Admissible colourings of 3-manifold triangulations for Turaev-Viro type invariants -
M., Spreer
- European Symposium on Algorithms ESA: 64:1-64:16 (2016)
The compressed annotation matrix: An efficient data structure for computing persistent cohomology -
Boissonnat, Dey, M.
- Algorithmica 73(3): 607-619 (2015)
- European Symposium on Algorithms ESA: 695-706 (2013)
The simplex tree: An efficient data structure for general simplicial complexes -
Boissonnat, M.
- Algorithmica 70(3): 406-427 (2014)
- European Symposium on Algorithms ESA: 731-742 (2012)
Zigzag persistence via reflections and transpositions -
M., Oudot
- Symposium on Discrete Algorithms SoDA: 181-199 (2014)
The Gudhi library: Simplicial complexes and persistent homology -
M., Boissonnat, Glisse, Yvinec
- International Conference on Mathematical Software ICMS: 167-174 (2014)
An exponential lower bound on the complexity of regularization paths -
Gärtner, Jaggi, M.
- Journal of Computational Geometry JoCG 3(1): 168-195 (2012)
Computing zigzag persistent cohomology -
M., Oudot
- preprint arXiv:1608.06039 (2016)
Other documents (short articles, popularisation of science, etc).