C. Allauzen and M. Mohri, Efficient algorithms for testing the twins property, Journal of Automata, Languages and Combinatorics, vol.8, issue.2, pp.117-144, 2003.

J. Bioch, The complexity of modular decomposition of Boolean functions, Discrete Applied Mathematics, vol.149, issue.1-3, pp.1-13, 2005.
DOI : 10.1016/j.dam.2003.12.010

B. Bui-xuan, M. Habib, and C. Paul, Revisiting T. Uno and M. Yagiura's Algorithm, 16th International Symposium of Algorithms and Computation (ISAAC05), pp.146-155, 2006.
URL : https://hal.archives-ouvertes.fr/lirmm-00106693

C. Capelle, M. Habib, and F. De-montgolfier, Graph decompositions and factorizing permutations, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp.55-70, 2002.
DOI : 10.1109/ISTCS.1997.595165
URL : https://hal.archives-ouvertes.fr/hal-00958972

M. Chein, M. Habib, and M. C. Maurer, Partitive hypergraphs, Discrete Mathematics, vol.37, issue.1, pp.35-50, 1981.
DOI : 10.1016/0012-365X(81)90138-2

A. Cournier and M. Habib, A new linear algorithm for Modular Decomposition, Trees in algebra and programming (CAAP 94), pp.68-84, 1994.
DOI : 10.1007/BFb0017474

E. Dahlhaus, Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition, Journal of Algorithms, vol.36, issue.2, pp.205-240, 2000.
DOI : 10.1006/jagm.2000.1090

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, Efficient and Practical Algorithms for Sequential Modular Decomposition, Journal of Algorithms, vol.41, issue.2, pp.360-387, 2001.
DOI : 10.1006/jagm.2001.1185
URL : https://hal.archives-ouvertes.fr/inria-00072855

F. De-montgolfier, Décomposition modulaire des graphes. Théorie, extensions et algorithmes, 2003.

A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures, Theoretical Computer Science, vol.3, issue.70, pp.277-342, 1990.

J. Fouquet, M. Habib, F. De-montgolfier, and J. Vanherpe, Bimodular Decomposition of Bipartite Graphs, WG'04, 30th International Workshop on Graph-Theoretic Concepts in Computer Science, 2004.
DOI : 10.1007/978-3-540-30559-0_10
URL : https://hal.archives-ouvertes.fr/lirmm-00108942

S. Fujishige, Submodular Functions and Optimization, 1991.

M. Habib, F. De-montgolfier, and C. Paul, A simple linear-time modular decomposition algorithm, 9th Scandinavian Workshop on Algorithm Theory, pp.187-198, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00108788

M. Habib, C. Paul, and L. Viennot, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.
DOI : 10.1142/S0129054199000125

V. Lozin, On maximum induced matchings in bipartite graphs, Information Processing Letters, vol.81, issue.1, pp.7-11, 2002.
DOI : 10.1016/S0020-0190(01)00185-5

R. Mcconnell and J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.536-545, 1994.

R. M. Mcconnell and F. De-montgolfier, Linear-time modular decomposition of directed graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.189-209, 2005.
DOI : 10.1016/j.dam.2004.02.017
URL : https://hal.archives-ouvertes.fr/hal-00159571

R. M. Mcconnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1-3, pp.189-241, 1999.
DOI : 10.1016/S0012-365X(98)00319-7

R. H. Möhring and F. J. Radermacher, Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization, Annals of Discrete Mathematics, vol.19, pp.257-356, 1984.
DOI : 10.1016/S0304-0208(08)72966-9

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

T. Uno and M. Yagiura, Fast Algorithms to Enumerate All Common Intervals of Two Permutations, Algorithmica, vol.26, issue.2, pp.290-309, 2000.
DOI : 10.1007/s004539910014