| 2026 | SODA | New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. | Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivn |
| 2025 | FOCS | Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa. | Benjamin Bedert, Tamio-Vesa Nakajima, Karolina Okrasa, Stanislav Zivn |
| 2025 | ICALP | Satisfiability of Commutative vs. Non-Commutative CSPs. | Andrei A. Bulatov, Stanislav Zivn |
| 2025 | ICALP | Optimal Inapproximability of Promise Equations over Finite Groups. | Silvia Butti, Alberto Larrauri, Stanislav Zivn |
| 2025 | ICALP | Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings. | Tamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna, Stanislav Zivn |
| 2025 | ICALP | Maximum Bipartite vs. Triangle-Free Subgraph. | Tamio-Vesa Nakajima, Stanislav Zivn |
| 2024 | ICALP | Solving Promise Equations over Monoids and Groups. | Alberto Larrauri, Stanislav Zivn |
| 2024 | LICS | Algebraic Approach to Approximation. | Libor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivn |
| 2024 | LICS | 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. | Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivn |
| 2024 | STOC | Semidefinite Programming and Linear Equations vs. Homomorphism Problems. | Lorenzo Ciardo, Stanislav Zivn |
| 2023 | ISAAC | A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. | Shuai Shao, Stanislav Zivn |
| 2023 | LICS | Boolean symmetric vs. functional PCSP dichotomy. | Tamio-Vesa Nakajima, Stanislav Zivn |
| 2023 | SODA | Hierarchies of Minion Tests for PCSPs through Tensors. | Lorenzo Ciardo, Stanislav Zivn |
| 2023 | SODA | Approximate Graph Colouring and Crystals. | Lorenzo Ciardo, Stanislav Zivn |
| 2023 | STOC | Approximate Graph Colouring and the Hollow Shadow. | Lorenzo Ciardo, Stanislav Zivn |
| 2022 | ICALP | Linearly Ordered Colourings of Hypergraphs. | Tamio-Vesa Nakajima, Stanislav Zivn |
| 2022 | PODS | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. | Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivn |
| 2022 | SODA | CLAP: A New Algorithm for Promise CSPs. | Lorenzo Ciardo, Stanislav Zivn |
| 2021 | ESA | QCSP on Reflexive Tournaments. | Benot Larose, Petar Markovic, Barnaby Martin, Danil Paulusma, Siani Smith, Stanislav Zivn |
| 2021 | ESA | Additive Sparsification of CSPs. | Eden Pelleg, Stanislav Zivn |
| 2021 | ICALP | Beyond PCSP(1-in-3, NAE). | Alex Brandts, Stanislav Zivn |
| 2021 | LICS | PTAS for Sparse General-Valued CSPs. | Balzs F. Mezei, Marcin Wrochna, Stanislav Zivn |
| 2021 | SODA | Counting Homomorphisms to | Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivn |
| 2021 | SODA | Treewidth-Pliability and PTAS for Max-CSPs. | Miguel Romero, Marcin Wrochna, Stanislav Zivn |
| 2020 | ICALP | The Complexity of Promise SAT on Non-Boolean Domains. | Alex Brandts, Marcin Wrochna, Stanislav Zivn |
| 2020 | MFCS | The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. | Caterina Viola, Stanislav Zivn |
| 2020 | SODA | Improved hardness for | Marcin Wrochna, Stanislav Zivn |
| 2019 | LICS | Point-width and Max-CSPs. | Clment Carbonnel, Miguel Romero, Stanislav Zivn |
| 2019 | MFCS | Approximate Counting CSP Seen from the Other Side. | Andrei A. Bulatov, Stanislav Zivn |
| 2019 | SODA | The Complexity of Approximately Counting Retractions. | Jacob Focke, Leslie Ann Goldberg, Stanislav Zivn |
| 2019 | STACS | Sparsification of Binary CSPs. | Silvia Butti, Stanislav Zivn |
| 2019 | STACS | Beyond Boolean Surjective VCSPs. | Gregor Matl, Stanislav Zivn |
| 2018 | FOCS | The Complexity of General-Valued CSPs Seen from the Other Side. | Clment Carbonnel, Miguel Romero, Stanislav Zivn |
| 2018 | SODA | The Complexity of Counting Surjective Homomorphisms and Compactions. | Jacob Focke, Leslie Ann Goldberg, Stanislav Zivn |
| 2018 | STACS | Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. | Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivn |
| 2018 | STACS | On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. | Clment Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivn |
| 2017 | LICS | The limits of SDP relaxations for general-valued CSPs. | Johan Thapper, Stanislav Zivn |
| 2017 | MFCS | The Complexity of Boolean Surjective General-Valued CSPs. | Peter Fulla, Stanislav Zivn |
| 2016 | LICS | The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. | Martin C. Cooper, Stanislav Zivn |
| 2016 | MFCS | On Planar Valued CSPs. | Peter Fulla, Stanislav Zivn |
| 2015 | AAAI | Binarisation via Dualisation for Valued Constraints. | David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivn |
| 2015 | ICALP | A Galois Connection for Valued Constraint Languages of Infinite Size. | Peter Fulla, Stanislav Zivn |
| 2015 | ICALP | Sherali-Adams Relaxations for Valued CSPs. | Johan Thapper, Stanislav Zivn |
| 2015 | IJCAI | Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. | David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivn |
| 2014 | AAAI | Backdoors into Heterogeneous Classes of SAT and CSP. | Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivn |
| 2014 | SODA | Maximizing Bisubmodular and | Justin Ward, Stanislav Zivn |
| 2013 | CP | Tractable Combinations of Global Constraints. | David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivn |
| 2013 | IJCAI | Variable Elimination in Binary CSP via Forbidden Patterns. | David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivn |
| 2013 | STOC | The complexity of finite-valued CSPs. | Johan Thapper, Stanislav Zivn |
| 2012 | CP | A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. | Martin C. Cooper, Guillaume Escamocher, Stanislav Zivn |
| 2012 | CP | Relating Proof Complexity Measures and Practical Hardness of SAT. | Matti Jrvisalo, Arie Matsliah, Jakob Nordstrm, Stanislav Zivn |
| 2012 | FOCS | The Power of Linear Programming for Valued CSPs. | Johan Thapper, Stanislav Zivn |
| 2012 | SODA | The complexity of conservative valued CSPs. | Vladimir Kolmogorov, Stanislav Zivn |
| 2011 | CP | Hierarchically Nested Convex VCSP. | Martin C. Cooper, Stanislav Zivn |
| 2011 | CP | Tractable Triangles. | Martin C. Cooper, Stanislav Zivn |
| 2011 | CP | On Minimal Weighted Clones. | Pid Creed, Stanislav Zivn |
| 2011 | MFCS | An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. | David A. Cohen, Pid Creed, Peter G. Jeavons, Stanislav Zivn |
| 2010 | CP | A New Hybrid Tractable Class of Soft Constraint Problems. | Martin C. Cooper, Stanislav Zivn |
| 2009 | CP | Same-Relation Constraints. | Christopher Jefferson, Serdar Kadioglu, Karen E. Petrie, Meinolf Sellmann, Stanislav Zivn |
| 2009 | CP | The Complexity of Valued Constraint Models. | Stanislav Zivn, Peter G. Jeavons |
| 2009 | MFCS | The Expressive Power of Binary Submodular Functions. | Stanislav Zivn, David A. Cohen, Peter G. Jeavons |
| 2008 | CP | Classes of Submodular Constraints Expressible by Graph Cuts. | Stanislav Zivn, Peter Jeavons |
| 2007 | CP | The Expressive Power of Valued Constraints: Hierarchies and Collapses. | David A. Cohen, Peter Jeavons, Stanislav Zivn |