A. V. Aho, M. R. Garey, and J. D. Ullman, The transitive reduction of a directed graph, SIAM J. Comput, vol.1, issue.2, pp.131-137, 1972.

A. Belfodil, S. Cazalens, P. Lamarre, and M. Plantevit, Flash points: Discovering exceptional pairwise behaviors in vote or rating data, ECML/PKDD, pp.442-458, 2017.
DOI : 10.1007/978-3-319-71246-8_27
URL : https://hal.archives-ouvertes.fr/hal-01587041

A. Belfodil, S. O. Kuznetsov, and M. Kaytoue, Pattern setups and their completions, CLA. pp, pp.243-253, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01818740

M. Boley, T. Horváth, A. Poigné, and S. Wrobel, Listing closed sets of strongly accessible set systems with applications to data mining, Theor. Comput. Sci, vol.411, issue.3, pp.691-700, 2010.

J. P. Bordat, Calcul pratique du treillis de galois d'une correspondance, Mathématiques et Sciences humaines, vol.96, pp.31-47, 1986.

P. Cellier, S. Ferré, O. Ridoux, and M. Ducassé, An algorithm to find frequent concepts of a formal context with taxonomy, CLA. pp, pp.226-231, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01119634

B. L. Dietrich, Matroids and antimatroidsa survey, Discrete Mathematics, vol.78, issue.3, pp.223-237, 1989.
DOI : 10.1016/0012-365x(89)90180-5
URL : https://doi.org/10.1016/0012-365x(89)90180-5

B. Ganter and R. Wille, Formal Concept Analysis, 1999.

B. Ganter, Two basic algorithms in concept analysis, 1984.

B. Ganter and S. O. Kuznetsov, Pattern structures and their projections, pp.129-142, 2001.
DOI : 10.1007/3-540-44583-8_10

B. Ganter and R. Wille, Conceptual scaling, Applications of combinatorics and graph theory to the biological and social sciences, pp.139-167, 1989.
DOI : 10.1007/978-1-4684-6381-1_6

A. Gély, A generic algorithm for generating closed sets of a binary relation, pp.223-234, 2005.

D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, On generating all maximal independent sets, Inf. Process. Lett, vol.27, issue.3, pp.119-123, 1988.

M. Kaytoue, S. O. Kuznetsov, and A. Napoli, Revisiting Numerical Pattern Mining with Formal Concept Analysis, pp.1342-1347, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00600222

B. Korte and L. Lovász, Mathematical structures underlying greedy algorithms, International Conference on Fundamentals of Computation Theory, pp.205-209, 1981.

P. Krajca, J. Outrata, and V. Vychodil, Advances in algorithms based on cbo, CLA. pp, pp.325-337, 2010.

S. O. Kuznetsov, A Fast Algorithm for Computing All Intersections of Objects in a Finite Semi-lattice. Nauchno-Tekhnicheskaya Informatsiya ser, vol.2, pp.17-20, 1993.

S. O. Kuznetsov, Learning of simple conceptual graphs from positive and negative examples, pp.384-391, 1999.

S. O. Kuznetsov, Pattern structures for analyzing complex data, RSFDGrC 2009, pp.33-44, 2009.

L. Gall and F. , Powers of tensors and fast matrix multiplication, Proceedings of the 39th international symposium on symbolic and algebraic computation, pp.296-303, 2014.

L. Lumpe and S. E. Schmidt, Pattern structures and their morphisms, In: CLA, vol.1466, pp.171-179, 2015.

S. Roman, Lattices and Ordered Sets, 2008.

A. Soulet and F. Rioult, Efficiently depth-first minimal pattern mining, PAKDD 2014, pp.28-39, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01021412

R. E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput, vol.1, issue.2, pp.146-160, 1972.

R. Wille, Restructuring lattice theory: an approach based on hierarchies of concepts, Ordered Sets, pp.445-470, 1982.