B. Bui-xuan, M. Habib, and M. Rao, Representing partitive crossing Families and union-difference Families, with Application to Sesquimodular Decomposition
URL : https://hal.archives-ouvertes.fr/lirmm-00199916

C. Capelle and M. Habib, Graph decompositions and factorizing permutations, 5th Israel Symposium on Theory of Computing and Systems (ISTCS'97), pp.132-143, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00958972

M. Chein, M. Habib, and M. C. Maurer, Partitive hypergraphs. Discrete Mathematics, vol.37, pp.35-50, 1981.

D. A. Cohen, M. C. Cooper, and P. G. Jeavons, Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms, 2006.

C. Crespelle, Représentations dynamiques de graphes, 2007.

W. Cunningham, Decomposition of directed graphs, SIAM Journal on Algebraic and Discrete Methods, vol.3, pp.214-228, 1982.

W. Cunningham and J. Edmonds, A combinatorial decomposition theory, Canadian Journal of Mathematics, vol.32, pp.734-765, 1980.

J. Edmonds and R. Giles, A min-max relation for submodular functions on graphs, Annals of Discrete Mathematics, vol.1, pp.185-204, 1977.

A. Ehrenfeucht, T. Harju, and G. Rozenberg, The Theory of 2-Structures-A Framework for Decomposition and Transformation of Graphs, 1999.

M. G. Everett and S. P. Borgatti, Regular Equivalence: General Theory, Journal of Mathematical Sociology, vol.18, pp.29-52, 1994.

J. Fiala and D. Paulusma, A complete complexity classification of the role assignment problem, Theoretical Computer Science, vol.349, issue.1, pp.67-81, 2005.

H. Gabow, Centroids, Representations, and Submodular Flows, Journal of Algorithms, vol.18, issue.3, pp.586-628, 1995.

J. Gagneur, R. Krause, T. Bouwmeester, and G. Casari, Modular decomposition of protein-protein interaction networks, Genome Biology, vol.5, issue.8, 2004.

T. Gallai, Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungaricae, vol.18, pp.25-66, 1967.

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.2, pp.147-170, 1999.

W. Hsu and R. M. Mcconnell, PC-trees and circular-ones arrangements. Theoretical Computer Science, vol.296, pp.99-116, 2003.

J. Lanlignel, Autour de la décomposition en coupes, 2001.

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.

F. De-mongolfier and M. Rao, The bi-join decomposition, 7th International Colloquium on Graph Theory (ICGT'05), 2005.

A. Schrijver, Combinatorial Optimization -Polyhedra and Efficiency, 2003.

C. Semple and M. Steel, Phylogenetics. Oxford Lecture Series in Mathematics and Its Applications, p.24, 2003.

D. R. White and K. P. Reitz, Graph and Semigroup Homomorphisms on Networks of Relations, Social Networks, vol.5, pp.193-234, 1983.