I. Kanj and S. Szeider, “On the Subexponential Time Complexity of CSP”, AAAI, vol. 27, no. 1, pp. 459-465, Jun. 2013.