G. Arévalo, A. Berry, M. Huchard, G. Perrot, and A. Sigayret, Comparison of performances of Galois sub-hierarchy-building algorithms, Proc. of ICFCA'07, pp.166-180, 2007.

A. Berry, J. Bordat, and A. Sigayret, A local approach to concept generation, Annals of Mathematics and Artificial Intelligence, vol.256, issue.3, pp.117-136, 2007.
DOI : 10.1007/s10472-007-9063-4

A. Berry, M. Huchard, R. M. Mcconnell, and J. P. Spinrad, Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice, Proc. of ICFCA'05, 2005.
DOI : 10.1007/978-3-540-32262-7_14
URL : https://hal.archives-ouvertes.fr/lirmm-00106459

A. Berry and A. Sigayret, Maintaining Class Membership Information. Workshop Maspeghi, proc. OOIS'02 (Conference on Object-Oriented Information Systems), 2002.
DOI : 10.1007/3-540-46105-1_3
URL : https://hal.archives-ouvertes.fr/hal-00522346

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

D. Coppersmith and W. S. , Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.1-6, 1987.
DOI : 10.1145/28395.28396
URL : http://doi.org/10.1016/s0747-7171(08)80013-2

H. Dicky, C. Dony, and M. Huchard, Ares, adding a class and restructuring inheritance hierarchies, Proc. BDA'95, pp.25-42, 1995.

E. Eschen, N. Pinet, and A. Sigayret, Consecutive-ones: handling lattice planarity efficiently, Proc. CLA'07, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00522407

B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations, 1999.

R. Godin and H. Mili, Building and Maintaining Analysis-Level Class Hierarchies Using Galois Lattices, Proc. OOPSLA'93, pp.394-410, 1993.
DOI : 10.1145/167962.165931
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.4242

R. Godin and T. Chau, Comparaison d'algorithmes de construction de hiérarchies de classes, Journal L'OBJET, vol.5, pp.3-4, 1999.

P. Hitzer, Default reasoning over Domains and Concepts Hierarchies, Proc. KI'04, pp.351-365, 2004.

W. Hsu and M. , Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs, SIAM Journal on Computing, vol.28, issue.3, pp.1004-1020, 1999.
DOI : 10.1137/S0097539792224814

M. Huchard, H. Dicky, and H. Leblanc, Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms, Theoretical Informatics and Applications, pp.521-548, 2000.
DOI : 10.1051/ita:2000129

M. Huchard and H. Leblanc, Computing interfaces in Java, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering, pp.317-320, 2000.
DOI : 10.1109/ASE.2000.873687

H. Leblanc, Sous-hiérarchies de Galois: un modèle pour la construction et l'´ evolution des hiérarchies d'objets (in French), 2000.

A. Lubiw, Doubly Lexical Orderings of Matrices, SIAM Journal on Computing, vol.16, issue.5, pp.854-879, 1987.
DOI : 10.1137/0216057

R. Osswald and W. Petersen, Introduction of Classification from Linguistic Data, Proc. ECAI'02, pp.75-84, 2002.

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

W. Petersen, A Set-Theoretical Approach for the Induction of Inheritance Hierarchies, Electronic Notes in Theoretical Computer Science, vol.53, p.51, 2001.
DOI : 10.1016/S1571-0661(05)82590-3

U. Ryssel, J. Ploennigs, and K. Kabitzsch, Extraction of feature models from formal contexts, Proceedings of the 15th International Software Product Line Conference on, SPLC '11, 2011.
DOI : 10.1145/2019136.2019141

A. Sigayret, Data mining: une approche par les graphes (in French), 2002.

J. Spinrad, Doubly lexical ordering of dense 0???1 matrices, Information Processing Letters, vol.45, issue.5, pp.229-235, 1993.
DOI : 10.1016/0020-0190(93)90209-R