| 2026 | COCOON | Discrete Homotopy and Promise Constraint Satisfaction Problem. | Arash Beikmohammadi, Andrei A. Bulatov |
| 2026 | STACS | Modular Counting over 3-Element and Conservative Domains. | Andrei A. Bulatov, Amirhossein Kazeminia |
| 2025 | ICALP | Satisfiability of Commutative vs. Non-Commutative CSPs. | Andrei A. Bulatov, Stanislav Zivn |
| 2025 | STACS | Modular Counting CSP: Reductions and Algorithms. | Amirhossein Kazeminia, Andrei A. Bulatov |
| 2022 | AAAI | Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution. | Oleksii Omelchenko, Andrei A. Bulatov |
| 2022 | STOC | Complexity classification of counting graph homomorphisms modulo a prime number. | Andrei A. Bulatov, Amirhossein Kazeminia |
| 2022 | STOC | On the complexity of CSP-based ideal membership problems. | Andrei A. Bulatov, Akbar Rafiey |
| 2022 | STACS | The Ideal Membership Problem and Abelian Groups. | Andrei A. Bulatov, Akbar Rafiey |
| 2021 | ICALP | Symmetries and Complexity (Invited Talk). | Andrei A. Bulatov |
| 2020 | ICALP | Counting Homomorphisms in Plain Exponential Time. | Andrei A. Bulatov, Amineh Dadsetan |
| 2019 | ICALP | Dismantlability, Connectedness, and Mixing in Relational Structures. | Raimundo Briceo, Andrei A. Bulatov, Vctor Dalmau, Benot Larose |
| 2019 | LICS | A short story of the CSP dichotomy conjecture. | Andrei A. Bulatov |
| 2019 | MFCS | Approximate Counting CSP Seen from the Other Side. | Andrei A. Bulatov, Stanislav Zivn |
| 2019 | MFCS | Counting Homomorphisms Modulo a Prime Number. | Amirhossein Kazeminia, Andrei A. Bulatov |
| 2019 | SAT | Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model. | Oleksii Omelchenko, Andrei A. Bulatov |
| 2018 | LATA | Constraint Satisfaction Problems: Complexity and Algorithms. | Andrei A. Bulatov |
| 2017 | FOCS | A Dichotomy Theorem for Nonuniform CSPs. | Andrei A. Bulatov |
| 2017 | LICS | Constraint satisfaction problems over semilattice block Mal'tsev algebras. | Andrei A. Bulatov |
| 2016 | LICS | Graphs of relational structures: restricted types. | Andrei A. Bulatov |
| 2015 | MFCS | Phase Transition for Local Search on Planted SAT. | Andrei A. Bulatov, Evgeny S. Skvortsov |
| 2014 | PAKDD | Inferring Attitude in Online Social Networks Based on Quadratic Correlation. | Cong Wang, Andrei A. Bulatov |
| 2014 | SAT | Approximating Highly Satisfiable Random 2-SAT. | Andrei A. Bulatov, Cong Wang |
| 2013 | CSL | Descriptive complexity of approximate counting CSPs. | Andrei A. Bulatov, Vctor Dalmau, Marc Thurley |
| 2012 | STACS | Log-supermodular functions, functional clones and counting CSPs. | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
| 2011 | CSR | On the CSP Dichotomy Conjecture. | Andrei A. Bulatov |
| 2011 | ICALP | Constraint Satisfaction Parameterized by Solution Size. | Andrei A. Bulatov, Dniel Marx |
| 2009 | LICS | The Complexity of Global Cardinality Constraints. | Andrei A. Bulatov, Dniel Marx |
| 2009 | STACS | Enumerating Homomorphisms. | Andrei A. Bulatov, Vctor Dalmau, Martin Grohe, Dniel Marx |
| 2008 | ICALP | The Complexity of the Counting Constraint Satisfaction Problem. | Andrei A. Bulatov |
| 2007 | ICALP | On the Power of | Albert Atserias, Andrei A. Bulatov, Vctor Dalmau |
| 2007 | ICALP | Affine Systems of Equations and Counting Infinitary Logic. | Albert Atserias, Andrei A. Bulatov, Anuj Dawar |
| 2006 | SAT | Efficiency of Local Search. | Andrei A. Bulatov, Evgeny S. Skvortsov |
| 2004 | ALT | Learnability of Relatively Quantified Generalized Formulas. | Andrei A. Bulatov, Hubie Chen, Vctor Dalmau |
| 2004 | ICALP | The Complexity of Partition Functions. | Andrei A. Bulatov, Martin Grohe |
| 2004 | LICS | A Graph of a Relational Structure and Constraint Satisfaction Problems. | Andrei A. Bulatov |
| 2003 | CP | An Algebraic Approach to Multi-sorted Constraints. | Andrei A. Bulatov, Peter Jeavons |
| 2003 | CSL | Quantified Constraints: Algorithms and Complexity. | Ferdinand Brner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin |
| 2003 | FOCS | Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. | Andrei A. Bulatov, Vctor Dalmau |
| 2003 | IJCAI | Amalgams of Constraint Satisfaction Problems. | Andrei A. Bulatov, Evgeny S. Skvortsov |
| 2003 | LICS | Tractable conservative Constraint Satisfaction Problems. | Andrei A. Bulatov |
| 2002 | FOCS | A Dichotomy Theorem for Constraints on a Three-Element Set. | Andrei A. Bulatov |
| 2001 | STOC | The complexity of maximal constraint languages. | Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons |
| 2000 | ICALP | Constraint Satisfaction Problems and Finite Algebras. | Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons |