1. Dechter, R.: Constraint Processing. Morgan Kaufmann, Burlington (2003)
2. Carbonnel, C., Cooper, M.C.: Tractability in constraint satisfaction problems: a survey. Constraints 21(2), 115–144 (2016)
3. Cooper, M.C., Jeavons, P.G., Salamon, A.Z.: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination. Artif. Intell. 174(9–10), 570–584 (2010)
4. Cohen, D.A., Cooper, M.C., Creed, P., Marx, D., Salamon, A.Z.: The tractability of CSP classes defined by forbidden patterns. J. Artif. Intell. Res. (JAIR) 45, 47–78 (2012)
5. Cohen, D.A., Cooper, M.C., Jeavons, P.G., Zivny, S.: Tractable classes of binary CSPs defined by excluded topological minors. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25–31 July 2015, pp. 1945–1951 (2015)