Clément Maria

According to our database1, Clément Maria authored at least 22 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hard Diagrams of the Unknot.
Exp. Math., July, 2024

Discrete Morse Theory for Computing Zigzag Persistence.
Discret. Comput. Geom., March, 2024

2023
An algorithm for Tambara-Yamagami quantum invariants of 3-manifolds, parameterized by the first Betti number.
CoRR, 2023

2022
Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Computing complete hyperbolic structures on cusped 3-manifolds.
CoRR, 2021

Parameterized Complexity of Quantum Knot Invariants.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

Computation of Large Asymptotics of 3-Manifold Quantum Invariants.
Proceedings of the 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.
Found. Comput. Math., 2020

Intrinsic Topological Transforms via the Distance Kernel Embedding.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Computing persistent homology with various coefficient fields in a single pass.
J. Appl. Comput. Topol., 2019

Parameterized complexity of quantum invariants.
CoRR, 2019

2018
Algorithms and complexity for Turaev-Viro invariants.
J. Appl. Comput. Topol., 2018

2017
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, 2017

2016
Computing Zigzag Persistent Cohomology.
CoRR, 2016

Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

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

Zigzag Persistence via Reflections and Transpositions.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

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

Introduction to the R package TDA.
CoRR, 2014

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

The Gudhi Library: Simplicial Complexes and Persistent Homology.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2012
An Exponential Lower Bound on the Complexity of Regularization Paths.
J. Comput. Geom., 2012


  Loading...