The Expressive Power of Valued Constraints: Hierarchies and Collapses. - David A. Cohen; Peter Jeavons 001; Stanislav Zivný (CP, 2007)

Classes of Submodular Constraints Expressible by Graph Cuts. - Stanislav Zivný; Peter Jeavons 001 (CP, 2008)

Same-Relation Constraints. - Christopher Jefferson; Serdar Kadioglu; Karen E. Petrie; Meinolf Sellmann; Stanislav Zivný (CP, 2009)

The Complexity of Valued Constraint Models. - Stanislav Zivný; Peter G. Jeavons (CP, 2009)

The Expressive Power of Binary Submodular Functions. - Stanislav Zivný; David A. Cohen; Peter G. Jeavons (MFCS, 2009)

A note on some collapse results of valued constraints. - Bruno Zanuttini; Stanislav Zivný (Inf. Process. Lett., 2009)

Structural properties of oracle classes. - Stanislav Zivný (Inf. Process. Lett., 2009)

The complexity and expressive power of valued constraints. - Stanislav Zivný (2009)

A New Hybrid Tractable Class of Soft Constraint Problems. - Martin C. Cooper; Stanislav Zivný (CP, 2010)

The complexity of conservative finite-valued CSPs - Vladimir Kolmogorov; Stanislav Zivný (CoRR, 2010)

Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms - Vladimir Kolmogorov; Stanislav Zivný (CoRR, 2010)

Hybrid tractability of soft constraint problems - Martin C. Cooper; Stanislav Zivný (CoRR, 2010)

Hierarchically Nested Convex VCSP. - Martin C. Cooper; Stanislav Zivný (CP, 2011)

Tractable Triangles. - Martin C. Cooper; Stanislav Zivný (CP, 2011)

On Minimal Weighted Clones. - Páidí Creed; Stanislav Zivný (CP, 2011)

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. - David A. Cohen; Páidí Creed; Peter G. Jeavons; Stanislav Zivný (MFCS, 2011)

Hybrid tractability of valued constraint problems. - Martin C. Cooper; Stanislav Zivný (Artif. Intell., 2011)

A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. - Martin C. Cooper; Guillaume Escamocher; Stanislav Zivný (CP, 2012)

Relating Proof Complexity Measures and Practical Hardness of SAT. - Matti Järvisalo; Arie Matsliah; Jakob Nordström; Stanislav Zivný (CP, 2012)

The Power of Linear Programming for Valued CSPs. - Johan Thapper; Stanislav Zivný (FOCS, 2012)

The complexity of conservative valued CSPs. - Vladimir Kolmogorov; Stanislav Zivný (SODA, 2012)

An Algebraic Theory of Complexity for Discrete Optimisation - David A. Cohen; Martin C. Cooper; Páidí Creed; Peter G. Jeavons; Stanislav Zivný (CoRR, 2012)

Tractable Triangles and Cross-Free Convexity in Discrete Optimisation. - Martin C. Cooper; Stanislav Zivný (J. Artif. Intell. Res., 2012)

The Complexity of Valued Constraint Satisfaction Problems - Stanislav Zivný (Springer, 2012)

Tractable Combinations of Global Constraints. - David A. Cohen; Peter G. Jeavons; Evgenij Thorstensen; Stanislav Zivný (CP, 2013)

Variable Elimination in Binary CSP via Forbidden Patterns. - David A. Cohen; Martin C. Cooper; Guillaume Escamocher; Stanislav Zivný (IJCAI, 2013)

The complexity of finite-valued CSPs. - Johan Thapper; Stanislav Zivný (STOC, 2013)

An Algebraic Theory of Complexity for Discrete Optimization. - David A. Cohen; Martin C. Cooper; Páidí Creed; Peter G. Jeavons; Stanislav Zivný (SIAM J. Comput., 2013)

Tractable Valued Constraints. - Peter G. Jeavons; Stanislav Zivný (Tractability, 2014)

Backdoors into Heterogeneous Classes of SAT and CSP. - Serge Gaspers; Neeldhara Misra; Sebastian Ordyniak; Stefan Szeider; Stanislav Zivný (AAAI, 2014)

Maximizing Bisubmodular and k-Submodular Functions. - Justin Ward; Stanislav Zivný (SODA, 2014)

Maximizing k-Submodular Functions and Beyond. - Justin Ward; Stanislav Zivný (CoRR, 2014)

The Complexity of Valued Constraint Satisfaction. - Peter Jeavons 001; Andrei A. Krokhin; Stanislav Zivný (Bull. EATCS, 2014)

Binarisation via Dualisation for Valued Constraints. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Stanislav Zivný (AAAI, 2015)

A Galois Connection for Valued Constraint Languages of Infinite Size. - Peter Fulla; Stanislav Zivný (ICALP (1), 2015)

Sherali-Adams Relaxations for Valued CSPs. - Johan Thapper; Stanislav Zivný (ICALP (1), 2015)

Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Stanislav Zivný (IJCAI, 2015)

Variable and value elimination in binary constraint satisfaction via forbidden patterns. - David A. Cohen; Martin C. Cooper; Guillaume Escamocher; Stanislav Zivný (J. Comput. Syst. Sci., 2015)

The Power of Linear Programming for General-Valued CSPs. - Vladimir Kolmogorov; Johan Thapper; Stanislav Zivný (SIAM J. Comput., 2015)

Necessary Conditions for Tractability of Valued CSPs. - Johan Thapper; Stanislav Zivný (SIAM J. Discret. Math., 2015)

Minimal Weighted Clones with Boolean Support. - Peter G. Jeavons; Andrius Vaicenavicius; Stanislav Zivný (ISMVL, 2016)

The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. - Martin C. Cooper; Stanislav Zivný (LICS, 2016)

On Planar Valued CSPs. - Peter Fulla; Stanislav Zivný (MFCS, 2016)

Maximizing k-Submodular Functions and Beyond. - Justin Ward; Stanislav Zivný (ACM Trans. Algorithms, 2016)

A Galois Connection for Weighted (Relational) Clones of Infinite Size. - Peter Fulla; Stanislav Zivný (ACM Trans. Comput. Theory, 2016)

Hybrid Tractable Classes of Constraint Problems. - Martin C. Cooper; Stanislav Zivný (The Constraint Satisfaction Problem, 2017)

The Complexity of Valued CSPs. - Andrei A. Krokhin; Stanislav Zivný (The Constraint Satisfaction Problem, 2017)

The limits of SDP relaxations for general-valued CSPs. - Johan Thapper; Stanislav Zivný (LICS, 2017)

The Complexity of Boolean Surjective General-Valued CSPs. - Peter Fulla; Stanislav Zivný (MFCS, 2017)

On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns. - Clément Carbonnel; David A. Cohen; Martin C. Cooper; Stanislav Zivný (CoRR, 2017)

The Power of Sherali-Adams Relaxations for General-Valued CSPs. - Johan Thapper; Stanislav Zivný (SIAM J. Comput., 2017)

Binarisation for Valued Constraint Satisfaction Problems. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Andrei A. Krokhin; Robert Powell; Stanislav Zivný (SIAM J. Discret. Math., 2017)

Functional clones and expressibility of partition functions. - Andrei Bulatov 001; Leslie Ann Goldberg; Mark Jerrum; David Richerby; Stanislav Zivný (Theor. Comput. Sci., 2017)

The Complexity of General-Valued CSPs Seen from the Other Side. - Clément Carbonnel; Miguel Romero 001; Stanislav Zivný (FOCS, 2018)

The Complexity of Counting Surjective Homomorphisms and Compactions. - Jacob Focke; Leslie Ann Goldberg; Stanislav Zivný (SODA, 2018)

Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. - Hiroshi Hirai 001; Yuni Iwamasa; Kazuo Murota; Stanislav Zivný (STACS, 2018)

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. - Clément Carbonnel; David A. Cohen; Martin C. Cooper; Stanislav Zivný (STACS, 2018)

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231). - Martin Grohe; Venkatesan Guruswami; Stanislav Zivný (Dagstuhl Reports, 2018)

Discrete convexity in joint winner property. - Yuni Iwamasa; Kazuo Murota; Stanislav Zivný (Discret. Optim., 2018)

Point-width and Max-CSPs. - Clément Carbonnel; Miguel Romero 001; Stanislav Zivný (LICS, 2019)

Approximate Counting CSP Seen from the Other Side. - Andrei A. Bulatov; Stanislav Zivný (MFCS, 2019)

The Complexity of Approximately Counting Retractions. - Jacob Focke; Leslie Ann Goldberg; Stanislav Zivný (SODA, 2019)

Sparsification of Binary CSPs. - Silvia Butti; Stanislav Zivný (STACS, 2019)

Beyond Boolean Surjective VCSPs. - Gregor Matl; Stanislav Zivný (STACS, 2019)

Improved hardness for H-colourings of G-colourable graphs. - Marcin Wrochna; Stanislav Zivný (CoRR, 2019)

Binary constraint satisfaction problems defined by excluded topological minors. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Stanislav Zivný (Inf. Comput., 2019)

A Tractable Class of Binary VCSPs via M-Convex Intersection. - Hiroshi Hirai 001; Yuni Iwamasa; Kazuo Murota; Stanislav Zivný (ACM Trans. Algorithms, 2019)

The Complexity of Boolean Surjective General-Valued CSPs. - Peter Fulla; Hannes Uppman; Stanislav Zivný (ACM Trans. Comput. Theory, 2019)

Galois Connections for Patterns: An Algebra of Labelled Graphs. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Stanislav Zivný (GKR, 2020)

The Complexity of Promise SAT on Non-Boolean Domains. - Alex Brandts; Marcin Wrochna; Stanislav Zivný (ICALP, 2020)

The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. - Caterina Viola; Stanislav Zivný (MFCS, 2020)

Improved hardness for H-colourings of G-colourable graphs. - Marcin Wrochna; Stanislav Zivný (SODA, 2020)

Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs. - Gregor Matl; Stanislav Zivný (Algorithmica, 2020)

The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs. - Joshua Brakensiek; Venkatesan Guruswami; Marcin Wrochna; Stanislav Zivný (Electron. Colloquium Comput. Complex., 2020)

Topology and adjunction in promise constraint satisfaction. - Andrei A. Krokhin; Jakub Oprsal; Marcin Wrochna; Stanislav Zivný (Electron. Colloquium Comput. Complex., 2020)

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. - Miriam Backens; Andrei Bulatov 001; Leslie Ann Goldberg; Colin McQuillan; Stanislav Zivný (J. Comput. Syst. Sci., 2020)

The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems. - Joshua Brakensiek; Venkatesan Guruswami; Marcin Wrochna; Stanislav Zivný (SIAM J. Comput., 2020)

QCSP on Reflexive Tournaments. - Benoît Larose; Petar Markovic; Barnaby Martin; Daniël Paulusma; Siani Smith; Stanislav Zivný (ESA, 2021)

Additive Sparsification of CSPs. - Eden Pelleg; Stanislav Zivný (ESA, 2021)

Beyond PCSP(1-in-3, NAE). - Alex Brandts; Stanislav Zivný (ICALP, 2021)

PTAS for Sparse General-Valued CSPs. - Balázs F. Mezei; Marcin Wrochna; Stanislav Zivný (LICS, 2021)

Counting Homomorphisms to K4-minor-free Graphs, modulo 2. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (SODA, 2021)

Treewidth-Pliability and PTAS for Max-CSPs. - Miguel Romero 001; Marcin Wrochna; Stanislav Zivný (SODA, 2021)

Counting Homomorphisms to K4-Minor-Free Graphs, Modulo 2. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (SIAM J. Discret. Math., 2021)

The Complexity of Approximately Counting Retractions to Square-free Graphs. - Jacob Focke; Leslie Ann Goldberg; Stanislav Zivný (ACM Trans. Algorithms, 2021)

On rainbow-free colourings of uniform hypergraphs. - Ragnar Groot Koerkamp; Stanislav Zivný (Theor. Comput. Sci., 2021)

Linearly Ordered Colourings of Hypergraphs. - Tamio-Vesa Nakajima; Stanislav Zivný (ICALP, 2022)

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (PODS, 2022)

CLAP: A New Algorithm for Promise CSPs. - Lorenzo Ciardo; Stanislav Zivný (SODA, 2022)

The Sherali-Adams Hierarchy for Promise CSPs through Tensors. - Lorenzo Ciardo; Stanislav Zivný (CoRR, 2022)

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). - Martin Grohe; Venkatesan Guruswami; Dániel Marx; Stanislav Zivný (Dagstuhl Reports, 2022)

The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side. - Clément Carbonnel; Miguel Romero 001; Stanislav Zivný (SIAM J. Comput., 2022)

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. - Shuai Shao 001; Stanislav Zivný (ISAAC, 2023)

Boolean symmetric vs. functional PCSP dichotomy. - Tamio-Vesa Nakajima; Stanislav Zivný (LICS, 2023)

Hierarchies of Minion Tests for PCSPs through Tensors. - Lorenzo Ciardo; Stanislav Zivný (SODA, 2023)

Approximate Graph Colouring and Crystals. - Lorenzo Ciardo; Stanislav Zivný (SODA, 2023)

Approximate Graph Colouring and the Hollow Shadow. - Lorenzo Ciardo; Stanislav Zivný (STOC, 2023)

Sparsification of Monotone k-Submodular Functions of Low Curvature. - Jannik Kudla; Stanislav Zivný (CoRR, 2023)

On the complexity of the approximate hypergraph homomorphism problem. - Lorenzo Ciardo; Marcin Kozik; Andrei A. Krokhin; Tamio-Vesa Nakajima; Stanislav Zivný (CoRR, 2023)

Maximum k- vs. 𝓁-colourings of graphs. - Tamio-Vesa Nakajima; Stanislav Zivný (CoRR, 2023)

Pliability and Approximating Max-CSPs. - Miguel Romero 001; Marcin Wrochna; Stanislav Zivný (J. ACM, 2023)

A Logarithmic Approximation of Linearly-Ordered Colourings. - Johan Håstad; Björn Martinsson; Tamio-Vesa Nakajima; Stanislav Zivný (APPROX/RANDOM, 2024)

Solving Promise Equations over Monoids and Groups. - Alberto Larrauri; Stanislav Zivný (ICALP, 2024)

Algebraic Approach to Approximation. - Libor Barto; Silvia Butti; Alexandr Kazda; Caterina Viola; Stanislav Zivný (LICS, 2024)

1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. - Lorenzo Ciardo; Marcin Kozik; Andrei A. Krokhin; Tamio-Vesa Nakajima; Stanislav Zivný (LICS, 2024)

Semidefinite Programming and Linear Equations vs. Homomorphism Problems. - Lorenzo Ciardo; Stanislav Zivný (STOC, 2024)

An approximation algorithm for Maximum DiCut vs. Cut. - Tamio-Vesa Nakajima; Stanislav Zivný (CoRR, 2024)

The periodic structure of local consistency. - Lorenzo Ciardo; Stanislav Zivný (CoRR, 2024)

Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (Proc. ACM Manag. Data, 2024)

On the Complexity of Symmetric vs. Functional PCSPs. - Tamio-Vesa Nakajima; Stanislav Zivný (ACM Trans. Algorithms, 2024)

Maximum And- vs. Even-SAT. - Tamio-Vesa Nakajima; Stanislav Zivný (APPROX/RANDOM, 2025)

Satisfiability of Commutative vs. Non-Commutative CSPs. - Andrei A. Bulatov; Stanislav Zivný (ICALP, 2025)

Optimal Inapproximability of Promise Equations over Finite Groups. - Silvia Butti; Alberto Larrauri; Stanislav Zivný (ICALP, 2025)

Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings. - Tamio-Vesa Nakajima; Zephyr Verwimp; Marcin Wrochna; Stanislav Zivný (ICALP, 2025)

Maximum Bipartite vs. Triangle-Free Subgraph. - Tamio-Vesa Nakajima; Stanislav Zivný (ICALP, 2025)

Approximate Graph Coloring and the Crystal with a Hollow Shadow. - Lorenzo Ciardo; Stanislav Zivný (SIAM J. Comput., 2025)

Equations over Finite Monoids with Infinite Promises. - Alberto Larrauri; Antoine Mottet; Stanislav Zivný (CoRR, 2025)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa. - Benjamin Bedert; Tamio-Vesa Nakajima; Karolina Okrasa; Stanislav Zivný (CoRR, 2025)