A. Bulatov, Tractable conservative constraint satisfaction problems, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.321-330, 2003.
DOI : 10.1109/LICS.2003.1210072
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.9140

A. Bulatov, P. Jeavons, and A. Krokhin, Classifying the Complexity of Constraints Using Finite Algebras, SIAM Journal on Computing, vol.34, issue.3, pp.720-742, 2005.
DOI : 10.1137/S0097539700376676

R. E. Burkard, B. Klinz, and R. Rudolf, Perspectives of Monge properties in optimization, Discrete Applied Mathematics, vol.70, issue.2, pp.95-161, 1996.
DOI : 10.1016/0166-218X(95)00103-X

D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin, Identifying Efficiently Solvable Cases of Max CSP, STACS'04, pp.152-163, 2004.
DOI : 10.1007/978-3-540-24749-4_14

N. Creignou, S. Khanna, and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, of SIAM Monographs on Discrete Mathematics and Applications, 2001.
DOI : 10.1137/1.9780898718546

V. G. Deineko, R. Rudolf, and G. J. Woeginger, Ein allgemeiner Ansatz zur Vermeidung von 2??2 Untermatrizen, Computing, vol.66, issue.4, pp.371-388, 1994.
DOI : 10.1007/BF02276883

S. Fujishige, Submodular Functions and Optimization, 1991.

P. Hell and J. Ne?et?il, Graphs and Homomorphisms, 2004.
DOI : 10.1093/acprof:oso/9780198528173.001.0001

P. Jonsson, M. Klasson, and A. Krokhin, The Approximability of Three-valued MAX CSP, SIAM Journal on Computing, vol.35, issue.6, 2004.
DOI : 10.1137/S009753970444644X

B. Klinz, R. Rudolf, and G. Woeginger, Permuting matrices to avoid forbidden submatrices, Discrete Applied Mathematics, vol.60, issue.1-3, pp.223-248, 1995.
DOI : 10.1016/0166-218X(94)00054-H
URL : http://doi.org/10.1016/0166-218x(94)00054-h

D. Topkis, Supermodularity and Complementarity, 1998.
DOI : 10.1515/9781400822539