Kanj, I. and Szeider, S. (2013) “On the Subexponential Time Complexity of CSP”, Proceedings of the AAAI Conference on Artificial Intelligence, 27(1), pp. 459-465. doi: 10.1609/aaai.v27i1.8609.