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