1. On digraph coloring problems and treewidth duality;Atserias,2005
2. L. Barto, M. Kozik, Constraint satisfaction problems of bounded width, in: Proceedings of the 50th Symposium on Foundations of Computer Science, FOCS’09, pp. 595–603.
3. L. Barto, M. Kozik, Robust satisfiability of constraint satisfaction problems, in: Proceedings of the 44th ACM Symposium on Theory of Computing, STOC’12, pp. 931–940.
4. CSP dichotomy holds for digraphs with no sink and source;Barto;SIAM J. Comput.,2009
5. Tractability and learnability arising from algebras with few subpowers;Berman,2007