Stanislav Zivný

210 papers A* 37A 19B 7Journal 137Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. SODA Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivný
2026	J	`jnl`	New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. CoRR Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivný
2025	J	`jnl`	1-in-3 vs. Not-All-Equal: Dichotomy of a Broken Promise. ACM Trans. Comput. Log. Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
2025	J	`jnl`	Approximate Graph Coloring and the Crystal with a Hollow Shadow. SIAM J. Comput. Lorenzo Ciardo, Stanislav Zivný
2025	J	`jnl`	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. ACM Trans. Algorithms Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2025	A*	`conf`	Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings. ICALP Tamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna, Stanislav Zivný
2025	J	`jnl`	Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings. CoRR Tamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna, Stanislav Zivný
2025	J	`jnl`	Equations over Finite Monoids with Infinite Promises. CoRR Alberto Larrauri, Antoine Mottet, Stanislav Zivný
2025	A	`conf`	Maximum And- vs. Even-SAT. APPROX/RANDOM Tamio-Vesa Nakajima, Stanislav Zivný
2025	A*	`conf`	Maximum Bipartite vs. Triangle-Free Subgraph. ICALP Tamio-Vesa Nakajima, Stanislav Zivný
2025	A*	`conf`	Optimal Inapproximability of Promise Equations over Finite Groups. ICALP Silvia Butti, Alberto Larrauri, Stanislav Zivný
2025	A*	`conf`	Satisfiability of Commutative vs. Non-Commutative CSPs. ICALP Andrei A. Bulatov, Stanislav Zivný
2025	J	`jnl`	Semidefinite Programming and Linear Equations vs. Homomorphism Problems. SIAM J. Comput. Lorenzo Ciardo, Stanislav Zivný
2025	J	`jnl`	Solving Promise Equations over Monoids and Groups. ACM Trans. Comput. Log. Alberto Larrauri, Stanislav Zivný
2025	A*	`conf`	Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa. FOCS Benjamin Bedert, Tamio-Vesa Nakajima, Karolina Okrasa, Stanislav Zivný
2025	J	`jnl`	Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa. CoRR Benjamin Bedert, Tamio-Vesa Nakajima, Karolina Okrasa, Stanislav Zivný
2025	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 25211). Dagstuhl Reports Manuel Bodirsky, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný, Zaneta Semanisinová
2024	A*	`conf`	1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. LICS Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
2024	A	`conf`	A Logarithmic Approximation of Linearly-Ordered Colourings. APPROX/RANDOM Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	A logarithmic approximation of linearly-ordered colourings. CoRR Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	Additive Sparsification of CSPs. ACM Trans. Algorithms Eden Pelleg, Stanislav Zivný
2024	A*	`conf`	Algebraic Approach to Approximation. LICS Libor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivný
2024	J	`jnl`	Algebraic Approach to Approximation. CoRR Libor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivný
2024	J	`jnl`	An approximation algorithm for Maximum DiCut vs. Cut. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. Proc. ACM Manag. Data Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2024	J	`jnl`	Maximum And- vs. Even-SAT. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	Maximum Bipartite vs. Triangle-Free Subgraph. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	On the Complexity of Symmetric vs. Functional PCSPs. ACM Trans. Algorithms Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	Optimal Inapproximability of Promise Equations over Finite Groups. CoRR Silvia Butti, Alberto Larrauri, Stanislav Zivný
2024	J	`jnl`	Satisfiability of commutative vs. non-commutative CSPs. CoRR Andrei A. Bulatov, Stanislav Zivný
2024	A*	`conf`	Semidefinite Programming and Linear Equations vs. Homomorphism Problems. STOC Lorenzo Ciardo, Stanislav Zivný
2024	A*	`conf`	Solving Promise Equations over Monoids and Groups. ICALP Alberto Larrauri, Stanislav Zivný
2024	J	`jnl`	Solving promise equations over monoids and groups. CoRR Alberto Larrauri, Stanislav Zivný
2024	J	`jnl`	The periodic structure of local consistency. CoRR Lorenzo Ciardo, Stanislav Zivný
2023	B	`conf`	A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. ISAAC Shuai Shao, Stanislav Zivný
2023	J	`jnl`	A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. CoRR Shuai Shao, Stanislav Zivný
2023	A*	`conf`	Approximate Graph Colouring and Crystals. SODA Lorenzo Ciardo, Stanislav Zivný
2023	A*	`conf`	Approximate Graph Colouring and the Hollow Shadow. STOC Lorenzo Ciardo, Stanislav Zivný
2023	A*	`conf`	Boolean symmetric vs. functional PCSP dichotomy. LICS Tamio-Vesa Nakajima, Stanislav Zivný
2023	J	`jnl`	CLAP: A New Algorithm for Promise CSPs. SIAM J. Comput. Lorenzo Ciardo, Stanislav Zivný
2023	J	`jnl`	Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. CoRR Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2023	A*	`conf`	Hierarchies of Minion Tests for PCSPs through Tensors. SODA Lorenzo Ciardo, Stanislav Zivný
2023	J	`jnl`	Maximum k- vs. 𝓁-colourings of graphs. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2023	J	`jnl`	On the complexity of the approximate hypergraph homomorphism problem. CoRR Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
2023	J	`jnl`	PTAS for Sparse General-valued CSPs. ACM Trans. Algorithms Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný
2023	J	`jnl`	Pliability and Approximating Max-CSPs. J. ACM Miguel Romero, Marcin Wrochna, Stanislav Zivný
2023	J	`jnl`	Semidefinite programming and linear equations vs. homomorphism problems. CoRR Lorenzo Ciardo, Stanislav Zivný
2023	J	`jnl`	Sparsification of Monotone k-Submodular Functions of Low Curvature. CoRR Jannik Kudla, Stanislav Zivný
2023	J	`jnl`	Topology and Adjunction in Promise Constraint Satisfaction. SIAM J. Comput. Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný
2022	J	`jnl`	Approximate Graph Colouring and Crystals. CoRR Lorenzo Ciardo, Stanislav Zivný
2022	J	`jnl`	Approximate Graph Colouring and the Hollow Shadow. CoRR Lorenzo Ciardo, Stanislav Zivný
2022	A*	`conf`	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. PODS Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2022	J	`jnl`	Beyond PCSP(1-in-3, NAE). Inf. Comput. Alex Brandts, Stanislav Zivný
2022	J	`jnl`	Boolean symmetric vs. functional PCSP dichotomy. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2022	A*	`conf`	CLAP: A New Algorithm for Promise CSPs. SODA Lorenzo Ciardo, Stanislav Zivný
2022	J	`jnl`	Hierarchies of Minion Tests for PCSPs through Tensors. CoRR Lorenzo Ciardo, Stanislav Zivný
2022	A*	`conf`	Linearly Ordered Colourings of Hypergraphs. ICALP Tamio-Vesa Nakajima, Stanislav Zivný
2022	J	`jnl`	Linearly Ordered Colourings of Hypergraphs. ACM Trans. Comput. Theory Tamio-Vesa Nakajima, Stanislav Zivný
2022	J	`jnl`	Linearly ordered colourings of hypergraphs. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2022	J	`jnl`	QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný
2022	J	`jnl`	The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side. SIAM J. Comput. Clément Carbonnel, Miguel Romero, Stanislav Zivný
2022	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). Dagstuhl Reports Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný
2022	J	`jnl`	The Sherali-Adams Hierarchy for Promise CSPs through Tensors. CoRR Lorenzo Ciardo, Stanislav Zivný
2021	A	`conf`	Additive Sparsification of CSPs. ESA Eden Pelleg, Stanislav Zivný
2021	J	`jnl`	Additive Sparsification of CSPs. CoRR Eden Pelleg, Stanislav Zivný
2021	J	`jnl`	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. CoRR Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2021	A*	`conf`	Beyond PCSP(1-in-3, NAE). ICALP Alex Brandts, Stanislav Zivný
2021	J	`jnl`	Beyond PCSP(1-in-3, NAE). CoRR Alex Brandts, Stanislav Zivný
2021	J	`jnl`	CLAP: A New Algorithm for Promise CSPs. CoRR Lorenzo Ciardo, Stanislav Zivný
2021	A*	`conf`	Counting Homomorphisms to SODA Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2021	J	`jnl`	Counting Homomorphisms to K SIAM J. Discret. Math. Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2021	J	`jnl`	On rainbow-free colourings of uniform hypergraphs. CoRR Ragnar Groot Koerkamp, Stanislav Zivný
2021	J	`jnl`	On rainbow-free colourings of uniform hypergraphs. Theor. Comput. Sci. Ragnar Groot Koerkamp, Stanislav Zivný
2021	A*	`conf`	PTAS for Sparse General-Valued CSPs. LICS Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný
2021	A	`conf`	QCSP on Reflexive Tournaments. ESA Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
2021	J	`jnl`	QCSP on Reflexive Tournaments. CoRR Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
2021	J	`jnl`	The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. ACM Trans. Algorithms Caterina Viola, Stanislav Zivný
2021	J	`jnl`	The Complexity of Approximately Counting Retractions to Square-free Graphs. ACM Trans. Algorithms Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2021	J	`jnl`	The Complexity of Promise SAT on Non-Boolean Domains. ACM Trans. Comput. Theory Alex Brandts, Marcin Wrochna, Stanislav Zivný
2021	A*	`conf`	Treewidth-Pliability and PTAS for Max-CSPs. SODA Miguel Romero, Marcin Wrochna, Stanislav Zivný
2020	J	`jnl`	Approximate Counting CSP Seen from the Other Side. ACM Trans. Comput. Theory Andrei A. Bulatov, Stanislav Zivný
2020	J	`jnl`	Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. J. Comput. Syst. Sci. Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivný
2020	J	`jnl`	Counting Homomorphisms to K CoRR Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2020	—	`conf`	Galois Connections for Patterns: An Algebra of Labelled Graphs. GKR David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný
2020	A*	`conf`	Improved hardness for SODA Marcin Wrochna, Stanislav Zivný
2020	J	`jnl`	PTAS for Sparse General-Valued CSPs. CoRR Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný
2020	J	`jnl`	Point-Width and Max-CSPs. ACM Trans. Algorithms Clément Carbonnel, Miguel Romero, Stanislav Zivný
2020	J	`jnl`	Sparsification of Binary CSPs. SIAM J. Discret. Math. Silvia Butti, Stanislav Zivný
2020	B	`conf`	The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. MFCS Caterina Viola, Stanislav Zivný
2020	J	`jnl`	The Complexity of Approximately Counting Retractions. ACM Trans. Comput. Theory Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2020	A*	`conf`	The Complexity of Promise SAT on Non-Boolean Domains. ICALP Alex Brandts, Marcin Wrochna, Stanislav Zivný
2020	J	`jnl`	The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs. Electron. Colloquium Comput. Complex. Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Zivný
2020	J	`jnl`	The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems. SIAM J. Comput. Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Zivný
2020	J	`jnl`	The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains. CoRR Caterina Viola, Stanislav Zivný
2020	J	`jnl`	Topology and adjunction in promise constraint satisfaction. CoRR Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný
2020	J	`jnl`	Topology and adjunction in promise constraint satisfaction. Electron. Colloquium Comput. Complex. Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný
2020	J	`jnl`	Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs. Algorithmica Gregor Matl, Stanislav Zivný
2019	J	`jnl`	A Tractable Class of Binary VCSPs via M-Convex Intersection. ACM Trans. Algorithms Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2019	B	`conf`	Approximate Counting CSP Seen from the Other Side. MFCS Andrei A. Bulatov, Stanislav Zivný
2019	J	`jnl`	Approximate counting CSP seen from the other side. CoRR Andrei A. Bulatov, Stanislav Zivný
2019	A	`conf`	Beyond Boolean Surjective VCSPs. STACS Gregor Matl, Stanislav Zivný
2019	J	`jnl`	Beyond Boolean Surjective VCSPs. CoRR Gregor Matl, Stanislav Zivný
2019	J	`jnl`	Binary constraint satisfaction problems defined by excluded topological minors. Inf. Comput. David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný
2019	J	`jnl`	Improved hardness for H-colourings of G-colourable graphs. CoRR Marcin Wrochna, Stanislav Zivný
2019	J	`jnl`	On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. Algorithmica Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný
2019	A*	`conf`	Point-width and Max-CSPs. LICS Clément Carbonnel, Miguel Romero, Stanislav Zivný
2019	J	`jnl`	Point-width and Max-CSPs. CoRR Clément Carbonnel, Miguel Romero, Stanislav Zivný
2019	A	`conf`	Sparsification of Binary CSPs. STACS Silvia Butti, Stanislav Zivný
2019	J	`jnl`	Sparsification of Binary CSPs. CoRR Silvia Butti, Stanislav Zivný
2019	J	`jnl`	The Complexity of Approximately Counting Retractions to Square-Free Graphs. CoRR Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2019	A*	`conf`	The Complexity of Approximately Counting Retractions. SODA Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2019	J	`jnl`	The Complexity of Boolean Surjective General-Valued CSPs. ACM Trans. Comput. Theory Peter Fulla, Hannes Uppman, Stanislav Zivný
2019	J	`jnl`	The Complexity of Counting Surjective Homomorphisms and Compactions. SIAM J. Discret. Math. Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2019	J	`jnl`	The complexity of promise SAT on non-Boolean domains. CoRR Alex Brandts, Marcin Wrochna, Stanislav Zivný
2019	J	`jnl`	Treewidth-Pliability and PTAS for Max-CSPs. CoRR Miguel Romero, Marcin Wrochna, Stanislav Zivný
2018	J	`jnl`	A tractable class of binary VCSPs via M-convex intersection. CoRR Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2018	A	`conf`	Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. STACS Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2018	J	`jnl`	Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. CoRR Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivný
2018	J	`jnl`	Discrete convexity in joint winner property. Discret. Optim. Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2018	A	`conf`	On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. STACS Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný
2018	J	`jnl`	The Complexity of Approximately Counting Retractions. CoRR Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2018	A*	`conf`	The Complexity of Counting Surjective Homomorphisms and Compactions. SODA Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2018	A*	`conf`	The Complexity of General-Valued CSPs Seen from the Other Side. FOCS Clément Carbonnel, Miguel Romero, Stanislav Zivný
2018	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231). Dagstuhl Reports Martin Grohe, Venkatesan Guruswami, Stanislav Zivný
2018	J	`jnl`	The Limits of SDP Relaxations for General-Valued CSPs. ACM Trans. Comput. Theory Johan Thapper, Stanislav Zivný
2017	J	`jnl`	Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2017	J	`jnl`	Binarisation for Valued Constraint Satisfaction Problems. SIAM J. Discret. Math. David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný
2017	J	`jnl`	Discrete Convexity in Joint Winner Property. CoRR Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2017	J	`jnl`	Functional clones and expressibility of partition functions. Theor. Comput. Sci. Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný
2017	—	`ch.`	Hybrid Tractable Classes of Constraint Problems. The Constraint Satisfaction Problem Martin C. Cooper, Stanislav Zivný
2017	J	`jnl`	On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns. CoRR Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný
2017	J	`jnl`	On planar valued CSPs. J. Comput. Syst. Sci. Peter Fulla, Stanislav Zivný
2017	B	`conf`	The Complexity of Boolean Surjective General-Valued CSPs. MFCS Peter Fulla, Stanislav Zivný
2017	J	`jnl`	The Complexity of Counting Surjective Homomorphisms and Compactions. CoRR Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
2017	—	`ch.`	The Complexity of Valued CSPs. The Constraint Satisfaction Problem Andrei A. Krokhin, Stanislav Zivný
2017	—	`book`	The Constraint Satisfaction Problem: Complexity and Approximability The Constraint Satisfaction Problem Andrei A. Krokhin, Stanislav Zivný
2017	J	`jnl`	The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. Log. Methods Comput. Sci. Martin C. Cooper, Stanislav Zivný
2017	J	`jnl`	The Power of Sherali-Adams Relaxations for General-Valued CSPs. SIAM J. Comput. Johan Thapper, Stanislav Zivný
2017	J	`jnl`	The complexity of Boolean surjective general-valued CSPs. CoRR Peter Fulla, Stanislav Zivný
2017	J	`jnl`	The complexity of general-valued CSPs seen from the other side. CoRR Clément Carbonnel, Miguel Romero, Stanislav Zivný
2017	A*	`conf`	The limits of SDP relaxations for general-valued CSPs. LICS Johan Thapper, Stanislav Zivný
2016	J	`jnl`	A Galois Connection for Weighted (Relational) Clones of Infinite Size. ACM Trans. Comput. Theory Peter Fulla, Stanislav Zivný
2016	J	`jnl`	Binarisation for Valued Constraint Satisfaction Problems. CoRR David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný
2016	J	`jnl`	Binary Constraint Satisfaction Problems Defined by Excluded Topological Minors. CoRR David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný
2016	J	`jnl`	Functional Clones and Expressibility of Partition Functions. CoRR Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný
2016	J	`jnl`	Maximizing ACM Trans. Algorithms Justin Ward, Stanislav Zivný
2016	—	`conf`	Minimal Weighted Clones with Boolean Support. ISMVL Peter G. Jeavons, Andrius Vaicenavicius, Stanislav Zivný
2016	B	`conf`	On Planar Valued CSPs. MFCS Peter Fulla, Stanislav Zivný
2016	J	`jnl`	On Planar Valued CSPs. CoRR Peter Fulla, Stanislav Zivný
2016	J	`jnl`	The Complexity of Finite-Valued CSPs. J. ACM Johan Thapper, Stanislav Zivný
2016	A*	`conf`	The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. LICS Martin C. Cooper, Stanislav Zivný
2016	J	`jnl`	The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. CoRR Martin C. Cooper, Stanislav Zivný
2016	J	`jnl`	The limits of SDP relaxations for general-valued CSPs. CoRR Johan Thapper, Stanislav Zivný
2016	J	`jnl`	The power of Sherali-Adams relaxations for general-valued CSPs. CoRR Johan Thapper, Stanislav Zivný
2015	—	`conf`	A Galois Connection for Valued Constraint Languages of Infinite Size. ICALP (1) Peter Fulla, Stanislav Zivný
2015	J	`jnl`	A Galois Connection for Valued Constraint Languages of Infinite Size. CoRR Peter Fulla, Stanislav Zivný
2015	J	`jnl`	Backdoors into Heterogeneous Classes of SAT and CSP. CoRR Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2015	A*	`conf`	Binarisation via Dualisation for Valued Constraints. AAAI David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný
2015	J	`jnl`	Necessary Conditions for Tractability of Valued CSPs. SIAM J. Discret. Math. Johan Thapper, Stanislav Zivný
2015	J	`jnl`	Necessary conditions for tractability of valued CSPs. CoRR Johan Thapper, Stanislav Zivný
2015	—	`conf`	Sherali-Adams Relaxations for Valued CSPs. ICALP (1) Johan Thapper, Stanislav Zivný
2015	J	`jnl`	Sherali-Adams relaxations for valued CSPs. CoRR Johan Thapper, Stanislav Zivný
2015	J	`jnl`	The Power of Linear Programming for General-Valued CSPs. SIAM J. Comput. Vladimir Kolmogorov, Johan Thapper, Stanislav Zivný
2015	A*	`conf`	Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. IJCAI David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný
2015	J	`jnl`	Variable and value elimination in binary constraint satisfaction via forbidden patterns. CoRR David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný
2015	J	`jnl`	Variable and value elimination in binary constraint satisfaction via forbidden patterns. J. Comput. Syst. Sci. David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný
2014	A*	`conf`	Backdoors into Heterogeneous Classes of SAT and CSP. AAAI Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2014	A*	`conf`	Maximizing Bisubmodular and SODA Justin Ward, Stanislav Zivný
2014	J	`jnl`	Maximizing k-Submodular Functions and Beyond. CoRR Justin Ward, Stanislav Zivný
2014	J	`jnl`	The Complexity of Valued Constraint Satisfaction. Bull. EATCS Peter Jeavons, Andrei A. Krokhin, Stanislav Zivný
2014	J	`jnl`	Tractable Triangles and Cross-Free Convexity in Discrete Optimisation. CoRR Martin C. Cooper, Stanislav Zivný
2014	—	`ch.`	Tractable Valued Constraints. Tractability Peter G. Jeavons, Stanislav Zivný
2013	J	`jnl`	An Algebraic Theory of Complexity for Discrete Optimization. SIAM J. Comput. David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný
2013	J	`jnl`	The complexity of conservative valued CSPs. J. ACM Vladimir Kolmogorov, Stanislav Zivný
2013	A*	`conf`	The complexity of finite-valued CSPs. STOC Johan Thapper, Stanislav Zivný
2013	J	`jnl`	The power of linear programming for general-valued CSPs. CoRR Vladimir Kolmogorov, Johan Thapper, Stanislav Zivný
2013	A	`conf`	Tractable Combinations of Global Constraints. CP David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivný
2013	J	`jnl`	Tractable Combinations of Global Constraints. CoRR David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivný
2013	A*	`conf`	Variable Elimination in Binary CSP via Forbidden Patterns. IJCAI David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný
2012	A	`conf`	A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. CP Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný
2012	J	`jnl`	An Algebraic Theory of Complexity for Discrete Optimisation CoRR David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný
2012	A	`conf`	Relating Proof Complexity Measures and Practical Hardness of SAT. CP Matti Järvisalo, Arie Matsliah, Jakob Nordström, Stanislav Zivný
2012	—	`book`	The Complexity of Valued Constraint Satisfaction Problems Stanislav Zivný
2012	J	`jnl`	The Power of Linear Programming for Valued CSPs CoRR Johan Thapper, Stanislav Zivný
2012	A*	`conf`	The Power of Linear Programming for Valued CSPs. FOCS Johan Thapper, Stanislav Zivný
2012	A*	`conf`	The complexity of conservative valued CSPs. SODA Vladimir Kolmogorov, Stanislav Zivný
2012	J	`jnl`	The complexity of finite-valued CSPs CoRR Johan Thapper, Stanislav Zivný
2012	J	`jnl`	Tractable Triangles and Cross-Free Convexity in Discrete Optimisation. J. Artif. Intell. Res. Martin C. Cooper, Stanislav Zivný
2011	B	`conf`	An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. MFCS David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivný
2011	A	`conf`	Hierarchically Nested Convex VCSP. CP Martin C. Cooper, Stanislav Zivný
2011	J	`jnl`	Hybrid tractability of valued constraint problems. Artif. Intell. Martin C. Cooper, Stanislav Zivný
2011	A	`conf`	On Minimal Weighted Clones. CP Páidí Creed, Stanislav Zivný
2011	J	`jnl`	The complexity of conservative valued CSPs CoRR Vladimir Kolmogorov, Stanislav Zivný
2011	A	`conf`	Tractable Triangles. CP Martin C. Cooper, Stanislav Zivný
2010	A	`conf`	A New Hybrid Tractable Class of Soft Constraint Problems. CP Martin C. Cooper, Stanislav Zivný
2010	J	`jnl`	Classes of submodular constraints expressible by graph cuts. Constraints An Int. J. Stanislav Zivný, Peter G. Jeavons
2010	J	`jnl`	Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms CoRR Vladimir Kolmogorov, Stanislav Zivný
2010	J	`jnl`	Hybrid tractability of soft constraint problems CoRR Martin C. Cooper, Stanislav Zivný
2010	J	`jnl`	The complexity of conservative finite-valued CSPs CoRR Vladimir Kolmogorov, Stanislav Zivný
2009	J	`jnl`	A note on some collapse results of valued constraints. Inf. Process. Lett. Bruno Zanuttini, Stanislav Zivný
2009	A	`conf`	Same-Relation Constraints. CP Christopher Jefferson, Serdar Kadioglu, Karen E. Petrie, Meinolf Sellmann, Stanislav Zivný
2009	J	`jnl`	Structural properties of oracle classes. Inf. Process. Lett. Stanislav Zivný
2009	A	`conf`	The Complexity of Valued Constraint Models. CP Stanislav Zivný, Peter G. Jeavons
2009	B	`conf`	The Expressive Power of Binary Submodular Functions. MFCS Stanislav Zivný, David A. Cohen, Peter G. Jeavons
2009	—	`—`	The complexity and expressive power of valued constraints. Stanislav Zivný
2009	J	`jnl`	The expressive power of binary submodular functions. Discret. Appl. Math. Stanislav Zivný, David A. Cohen, Peter G. Jeavons
2008	A	`conf`	Classes of Submodular Constraints Expressible by Graph Cuts. CP Stanislav Zivný, Peter Jeavons
2008	J	`jnl`	The Expressive Power of Binary Submodular Functions CoRR Stanislav Zivný, David A. Cohen, Peter G. Jeavons
2008	J	`jnl`	The expressive power of valued constraints: Hierarchies and collapses. Theor. Comput. Sci. David A. Cohen, Peter G. Jeavons, Stanislav Zivný
2007	A	`conf`	The Expressive Power of Valued Constraints: Hierarchies and Collapses. CP David A. Cohen, Peter Jeavons, Stanislav Zivný