A. W. Appel and G. J. Jacobson, The world's fastest Scrabble program, Communications of the ACM, vol.31, issue.5, 1988.
DOI : 10.1145/42411.42420

D. Attali, A. Lieutier, and D. Salinas, EFFICIENT DATA STRUCTURE FOR REPRESENTING AND SIMPLIFYING SIMPLICIAL COMPLEXES IN HIGH DIMENSIONS, International Journal of Computational Geometry & Applications, vol.22, issue.04, pp.279-303, 2012.
DOI : 10.1142/S0218195912600060
URL : https://hal.archives-ouvertes.fr/hal-00785082

A. Andersson and S. Nilsson, Improved behaviour of tries by adaptive branching, Information Processing Letters, vol.46, issue.6, pp.295-300, 1993.
DOI : 10.1016/0020-0190(93)90068-K

A. Acharya, H. Zhu, and K. Shen, Adaptive Algorithms for Cache-efficient Trie Search, Workshop on Algorithm Engineering and Experimentation ALENEX 99, 1999.
DOI : 10.1007/3-540-48518-X_18

L. J. Billera and A. Björner, Face Numbers of Polytopes and Complexes, Handbook of Discrete and Computational Geometry, pp.291-310, 1997.
DOI : 10.1201/9781420035315.ch18

A. Badr, V. Geffert, and I. Shipman, Hyper-minimizing minimized deterministic finite state automata, RAIRO Theoretical Informatics and Applications, pp.69-94, 2009.
DOI : 10.1051/ita:2007061

J. Boissonnat, C. S. Karthik, and S. Tavenas, Building Efficient and Compact Data Structures for Simplicial Complexes, Symposium on Computational Geometry, pp.642-656, 2015.
DOI : 10.1007/s00453-016-0207-y
URL : https://hal.archives-ouvertes.fr/hal-01145407

J. Boissonnat and C. Maria, The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes, Algorithmica, vol.132, issue.23, pp.406-427, 2014.
DOI : 10.1007/s00453-014-9887-3
URL : https://hal.archives-ouvertes.fr/hal-01108416

J. Boissonnat and D. Mazauric, On the complexity of the representation of simplicial complexes by trees, Theoretical Computer Science, pp.28-44, 2016.
DOI : 10.1016/j.tcs.2015.12.034
URL : https://hal.archives-ouvertes.fr/hal-01259806

J. L. Bentley and R. Sedgewick, Fast algorithms for sorting and searching strings, Proceedings of the eighth annual ACM-SIAM Symposium on Discrete Algorithms, pp.360-369, 1997.

R. Carrasco and M. Forcada, Incremental Construction and Maintenance of Minimal Finite-State Automata, Computational Linguistics, 2002.
DOI : 10.1162/089120100561601

D. Comer and R. Sethi, Complexity of Trie Index Construction, Proceedings of Foundations of Computer Science, pp.197-207, 1976.

C. Câmpeanu, N. Sântean, and S. Yu, Minimal cover-automata for finite languages, Theoretical Computer Science, vol.267, issue.1-2, pp.3-16, 2001.
DOI : 10.1016/S0304-3975(00)00292-9

J. Daciuk, S. Mihov, B. Watson, and R. Watson, Incremental Construction of Minimal Acyclic Finite-State Automata, Computational Linguistics, pp.3-16, 2000.
DOI : 10.1162/089120100561601

D. Eppstein, M. Löffler, and D. Strash, Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time, International Symposium on Algorithms and Computation, pp.403-414, 2010.
DOI : 10.1007/978-3-642-17517-6_36

M. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 2004.

M. R. Garey and D. S. Johnson, Computers and Intractability: a guide to the theory of NP-completeness. W. H. Freeman publishers, 1979.

M. Grohe, S. Kreutzer, and S. Siebertz, Characterisations of Nowhere Dense Graphs, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp.21-40, 2013.

J. Hopcroft, AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON, Theory of machines and computations, pp.189-196, 1971.
DOI : 10.1016/B978-0-12-417750-5.50022-1

R. M. Karp, Reducibility Among Combinatorial Problems, Complexity of Computer Computations, pp.85-103, 1972.

A. Maletti, Notes on hyper-minimization, Proceedings 13th International Conference Automata and Formal Languages, pp.34-49, 2011.

E. Maia, N. Moreira, and R. Reis, Incomplete Transition Complexity of Some Basic Operations, International Conference on Current Trends in Theory and Practice of Computer Science, pp.319-331, 2013.
DOI : 10.1007/978-3-642-35843-2_28

A. Nerode, Linear automaton transformations, Proceedings of the American Mathematical Society, pp.541-544, 1958.
DOI : 10.1090/S0002-9939-1958-0135681-9

D. Revuz, Minimisation of acyclic deterministic automata in linear time, Theoretical Computer Science, pp.181-189, 1992.
DOI : 10.1016/0304-3975(92)90142-3
URL : https://hal.archives-ouvertes.fr/hal-00619678

K. Sgarbas, N. Fakotakis, and G. , Kokkinakis: Optimal insertion in deterministic DAWGs, Theoretical Computer Science, pp.103-117, 2003.

J. Teuhola and T. Raita, Text compression using prediction, Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '86, pp.97-102, 1986.
DOI : 10.1145/253168.253192

D. Yellin, Algorithms for Subset Testing and Finding Maximal Sets, SODA, pp.386-392, 1992.