M. Adamaszek and J. Stacho, Complexity of simplicial homology and independence complexes of chordal graphs, Computational Geometry: Theory and Applications, vol.57, pp.8-18, 2016.

D. Attali, A. Lieutier, and D. Salinas, Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes, Computational Geometry, vol.46, issue.4, pp.448-465, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00785072

J. A. Barmak and E. G. Minian, Strong homotopy types, nerves and collapses. Discrete and Computational Geometry, vol.47, pp.301-328, 2012.

U. Bauer and . Ripser,

U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, PHAT -persistent homology algorithms toolbox, Journal of Symbolic Computation, vol.78, 2017.

U. Bauer, M. Kerber, and J. Reininghaus, Clear and compress: Computing persistent homology in chunks, pp.103-117, 2014.

J. Boissonnat and C. S. Karthik, An efficient representation for filtrations of simplicial complexes, In ACM Transactions on Algorithms, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01416683

J. Boissonnat, C. S. Karthik, and S. Tavenas, Building efficient and compact data structures for simplicial complexes, Algorithmica, vol.79, pp.530-567, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01145407

J. Boissonnat and S. Pritam, Computing persistent homology of flag complexes via strong collapses, International Symposium on Computational Geometry (SoCG), 2019.
URL : https://hal.archives-ouvertes.fr/hal-01950074

J. Boissonnat, S. Pritam, and D. Pareek, Strong Collapse for Persistence, 26th Annual European Symposium on Algorithms (ESA 2018), vol.112, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01886165

M. Botnan and G. Spreemann, Approximating persistent homology in euclidean space through collapses, Applicable Algebra in Engineering, Communication and Computing, vol.26, pp.73-101

G. Carlsson and V. Silva, Zigzag persistence, Found Comput Math, vol.10, 2010.

G. Carlsson, V. Silva, and D. Morozov, Zigzag persistent homology and real-valued functions, International Symposium on Computational Geometry (SoCG), pp.247-256, 2009.

F. Chazal and S. Oudot, Towards persistence-based reconstruction in Euclidean spaces, International Symposium on Computational Geometry (SoCG), 2008.
URL : https://hal.archives-ouvertes.fr/inria-00197543

A. Choudhary, M. Kerber, and S. Raghvendra, Polynomial-Sized Topological Approximations Using The Permutahedron. International Symposium on Computational Geometry (SoCG), 2016.

A. Choudhary, M. Kerber, and S. Raghvendra, Improved topological approximations by digitization, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019.

H. Edelsbrunner, D. Cohen-steiner, and J. Harer, Stability of persistence diagrams. Discrete and Compututaional Geometry, vol.37, pp.103-120, 2007.

. Datasets and . Url,

D. Vin-de-silva, M. Morozov, and . Vejdemo-johansson, Persistent cohomology and circular coordinates, pp.737-759, 2011.

H. Derksen and J. Weyman, Quiver representations. Notices of the, vol.52, pp.200-206, 2005.

T. K. Dey, H. Edelsbrunner, S. Guha, and D. Nekhayev, , vol.60, pp.23-45, 1999.

T. K. Dey, F. Fan, and Y. Wang, Computing topological persistence for simplicial maps, International Symposium on Computational Geometry (SoCG), pp.345-354, 2014.

T. K. Dey, D. Shi, and Y. Wang, SimBa: An efficient tool for approximating Ripsfiltration persistence via Simplicial Batch-collapse, European Symp. on Algorithms (ESA), vol.35, p.16, 2016.

T. K. Dey and R. Slechta, Filtration simplification for persistent homology via edge contraction, International Conference on Discrete Geometry for Computer Imagery, 2019.

P. D?otko and H. Wagner, Simplification of complexes for persistent homology computations, Homology, Homotopy and Applications, vol.16, pp.49-63, 2014.

H. Edelsbrunner and J. Harer, Computational Topology: An Introduction, 2010.

H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological persistence and simplification. Discrete and Compututational Geometry, vol.28, pp.511-533, 2002.

E. Fieux and J. Lacaze, Foldings in graphs and relations with simplicial complexes and posets, Discrete Mathematics, vol.312, issue.17, pp.2639-2651, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00769072

F. and L. Gall, Powers of tensors and fast matrix multiplication, vol.14, pp.296-303, 2014.

, Gudhi: Geometry understanding in higher dimensions

A. Hatcher, Algebraic Topology, 2001.

B. Hudson, G. L. Miller, S. Oudot, and D. R. Sheehy, Topological inference via meshing, International Symposium on Computational Geometry (SoCG), 2010.
URL : https://hal.archives-ouvertes.fr/inria-00436891

M. Kahle, Random simplicial complexes, 2016.

M. Kerber and H. Schreiber, Barcodes of towers and a streaming algorithm for persistent homology, International Symposium on Computational Geometry (SoCG), 2017.

M. Kerber and R. Sharathkumar, Approximate?ech complex in low and high dimensions, Algorithms and Computation, vol.8283, pp.666-676, 2013.

M. Lesnick and M. Wright, Computing minimal presentations and betti numbers of 2-parameter persistent homology. CoRR, 2019.

C. Maria and S. Oudot, Zigzag persistence via reflections and transpositions, Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA) pp, pp.181-199, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01091949

C. Maria and H. Schreiber, Algorithms and data structures -16th international symposium, WADS, pp.538-552, 2019.

N. Milosavljevic, D. Morozov, and P. Skraba, Zigzag persistent homology in matrix multiplication time, International Symposium on Computational Geometry (SoCG), 2011.
URL : https://hal.archives-ouvertes.fr/inria-00520171

K. Mischaikow and V. Nanda, Morse theory for filtrations and efficient computation of persistent homology. Discrete and Computational Geometry, vol.50, pp.330-353, 2013.

D. Mozozov and . Dionysus,

J. Munkres, Elements of Algebraic Topology, 1984.

N. Otter, M. Porter, U. Tillmann, P. Grindrod, and H. Harrington, A roadmap for the computation of persistent homology, EPJ Data Science, p.17, 2017.

H. Schreiber and . Sophia,

D. Sheehy, Linear-size approximations to the Vietoris-Rips filtration, Discrete and Computational Geometry, vol.49, pp.778-796, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01111878

V. Welker, Constructions preserving evasiveness and collapsibility, Discrete Mathematics, vol.207, issue.1, pp.243-255, 1999.

J. H. Whitehead, Simplicial spaces nuclei and m-groups, Proc. London Math. Soc, vol.45, pp.243-327, 1939.

A. C. Wilkerson, H. Chintakunta, and H. Krim, Computing persistent features in big data: A distributed dimension reduction approach, International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp.11-15, 2014.

A. C. Wilkerson, T. J. Moore, A. Swami, and A. H. Krim, Simplifying the homology of networks via strong collapses, International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp.11-15, 2013.

A. Zomorodian and G. Carlsson, Computing persistent homology. Discrete and Computational Geometry, vol.33, pp.249-274, 2005.

A. Zomorodian and G. Carlsson, The theory of multidimensional persistence, Discrete and Computational Geometry, vol.42, pp.71-93, 2009.