| Classifying the complexity of constraints using finite algebras A Bulatov, P Jeavons, A Krokhin SIAM journal on computing 34 (3), 720-742, 2005 | 604 | 2005 |
| A dichotomy theorem for constraint satisfaction problems on a 3-element set AA Bulatov Journal of the ACM (JACM) 53 (1), 66-120, 2006 | 348 | 2006 |
| Tractable conservative constraint satisfaction problems AA Bulatov 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003 | 250 | 2003 |
| A dichotomy theorem for nonuniform CSPs AA Bulatov 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 232 | 2017 |
| A dichotomy theorem for constraints on a three-element set AA Bulatov The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002 | 191 | 2002 |
| Constraint satisfaction problems and finite algebras AA Bulatov, AA Krokhin, P Jeavons International Colloquium on Automata, Languages, and Programming, 272-282, 2000 | 190 | 2000 |
| A simple algorithm for Mal'tsev constraints A Bulatov, V Dalmau SIAM Journal on Computing 36 (1), 16-27, 2006 | 162 | 2006 |
| The complexity of partition functions A Bulatov, M Grohe Theoretical Computer Science 348 (2-3), 148-186, 2005 | 153 | 2005 |
| Complexity of conservative constraint satisfaction problems AA Bulatov ACM Transactions on Computational Logic (TOCL) 12 (4), 1-66, 2011 | 139 | 2011 |
| The complexity of the counting constraint satisfaction problem AA Bulatov International Colloquium on Automata, Languages, and Programming, 646-661, 2008 | 105 | 2008 |
| Malt'sev constraints are tractable A Bulatov, V Dalmau Oxford University Computing Laboratory, 2002 | 101 | 2002 |
| The complexity of maximal constraint languages A Bulatov, A Krokhin, P Jeavons Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 97 | 2001 |
| H-coloring dichotomy revisited AA Bulatov Theoretical Computer Science 349 (1), 31-39, 2005 | 91 | 2005 |
| Algebraic structures in combinatorial problems A Bulatov, P Jeavons Technische Universitat Dresden, 2001 | 91 | 2001 |
| Quantified constraints: Algorithms and complexity F Börner, A Bulatov, P Jeavons, A Krokhin International Workshop on Computer Science Logic, 58-70, 2003 | 86 | 2003 |
| Towards a dichotomy theorem for the counting constraint satisfaction problem AA Bulatov, V Dalmau 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 81 | 2003 |
| Recent results on the algebraic approach to the CSP AA Bulatov, MA Valeriote Complexity of Constraints, 68-92, 2008 | 77 | 2008 |
| Towards a dichotomy theorem for the counting constraint satisfaction problem AA Bulatov, V Dalmau Information and Computation 205 (5), 651-678, 2007 | 77 | 2007 |
| The complexity of the counting constraint satisfaction problem AA Bulatov Journal of the ACM (JACM) 60 (5), 1-41, 2013 | 75 | 2013 |
| Dualities for constraint satisfaction problems AA Bulatov, A Krokhin, B Larose Complexity of Constraints, 93-124, 2008 | 72 | 2008 |
