C. Bessière, J. Régin, R. H. Yap, and Y. Zhang, An optimal coarse-grained arc consistency algorithm, Artificial Intelligence, vol.165, issue.2, pp.165-185, 2005.
DOI : 10.1016/j.artint.2005.02.004

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

A. A. Bulatov, A dichotomy theorem for constraint satisfaction problems on a 3-element set, Journal of the ACM, vol.53, issue.1, pp.66-120, 2006.
DOI : 10.1145/1120582.1120584

D. A. Cohen, M. C. Cooper, M. J. Green, and D. Marx, On Guaranteeing Polynomially Bounded Search Tree Size, LNCS, vol.6876, issue.11, pp.160-171, 2011.
DOI : 10.1007/978-3-642-23786-7_14

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

M. C. Cooper, Fundamental properties of neighbourhood substitution in constraint satisfaction problems, Artificial Intelligence, vol.90, issue.1-2, p.24, 1997.
DOI : 10.1016/S0004-3702(96)00018-5

M. C. Cooper, D. A. Cohen, and P. G. Jeavons, Characterising tractable constraints, Artificial Intelligence, vol.65, issue.2, pp.347-361, 1994.
DOI : 10.1016/0004-3702(94)90021-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.80

M. C. Cooper and G. Escamocher, A dichotomy for 2-constraint forbidden CSP patterns, p.3868, 1201.

M. C. Cooper, P. G. Jeavons, and A. Z. Salamon, Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination, Artificial Intelligence, vol.174, issue.9-10, pp.9-10, 2010.
DOI : 10.1016/j.artint.2010.03.002
URL : http://doi.org/10.1016/j.artint.2010.03.002

M. C. Cooper and S. ?ivný, Hybrid tractability of valued constraint problems, Artificial Intelligence, vol.175, issue.9-10, pp.1555-1569, 2011.
DOI : 10.1016/j.artint.2011.02.003

M. C. Cooper, ?. Zivný, and S. , Hierarchically Nested Convex VCSP, CP 2011, pp.187-194, 2011.
DOI : 10.1007/978-3-642-23786-7_16

E. C. Freuder, Eliminating interchangeable values in constraint satisfaction problems, AAAI-91, pp.227-233, 1991.

M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, 1979.

M. Grohe, The complexity of homomorphism and constraint satisfaction problems seen from the other side, Journal of the ACM, vol.54, issue.1, pp.1-24, 2007.
DOI : 10.1145/1206035.1206036

D. Marx, Can You Beat Treewidth ?, Theory of Computing, pp.85-112, 2010.

D. Marx, Tractable hypergraph properties for constraint satisfaction and conjunctive queries, pp.735-744, 2010.