1. On the approximation complexity hierarchy;Bordewich,2011
2. R. Bubley, M.E. Dyer, Graph orientations with no sink and an approximation for a hard case of #SAT, in: 8th ACM–SIAM Symp. on Discrete Algorithms (SODA 1997), 1997, pp. 248–257.
3. A dichotomy theorem for constraint satisfaction problems on a 3-element domain;Bulatov;J. ACM,2006
4. The complexity of the counting constraint satisfaction problem;Bulatov,2008
5. A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights;Cai,2010