Stanislav Zivný

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 142

Top Venues

CoRR

SODA

ACM Trans. Comput. Theory

ACM Trans. Algorithms

Publications

Lorenzo Ciardo, Stanislav Zivný
Semidefinite Programming and Linear Equations vs. Homomorphism Problems. STOC (2024)
Lorenzo Ciardo, Stanislav Zivný
The periodic structure of local consistency. CoRR (2024)
Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, Stanislav Zivný
A logarithmic approximation of linearly-ordered colourings. CoRR (2024)
Andrei A. Bulatov, Stanislav Zivný
Satisfiability of commutative vs. non-commutative CSPs. CoRR (2024)
Eden Pelleg, Stanislav Zivný
Additive Sparsification of CSPs. ACM Trans. Algorithms 20 (1) (2024)
Libor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivný
Algebraic Approach to Approximation. CoRR (2024)
Alberto Larrauri, Stanislav Zivný
Solving Promise Equations over Monoids and Groups. ICALP (2024)
Libor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivný
Algebraic Approach to Approximation. LICS (2024)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. Proc. ACM Manag. Data 2 (2) (2024)
Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. LICS (2024)
Tamio-Vesa Nakajima, Stanislav Zivný
Maximum Bipartite vs. Triangle-Free Subgraph. CoRR (2024)
Alberto Larrauri, Stanislav Zivný
Solving promise equations over monoids and groups. CoRR (2024)
Tamio-Vesa Nakajima, Stanislav Zivný
An approximation algorithm for Maximum DiCut vs. Cut. CoRR (2024)
Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný
PTAS for Sparse General-valued CSPs. ACM Trans. Algorithms 19 (2) (2023)
Shuai Shao, Stanislav Zivný
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. ISAAC (2023)
Lorenzo Ciardo, Stanislav Zivný
CLAP: A New Algorithm for Promise CSPs. SIAM J. Comput. 52 (1) (2023)
Lorenzo Ciardo, Stanislav Zivný
Approximate Graph Colouring and Crystals. SODA (2023)
Tamio-Vesa Nakajima, Stanislav Zivný
Maximum k- vs. 𝓁-colourings of graphs. CoRR (2023)
Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný
Topology and Adjunction in Promise Constraint Satisfaction. SIAM J. Comput. 52 (1) (2023)
Miguel Romero, Marcin Wrochna, Stanislav Zivný
Pliability and Approximating Max-CSPs. J. ACM 70 (6) (2023)
Shuai Shao, Stanislav Zivný
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. CoRR (2023)
Tamio-Vesa Nakajima, Stanislav Zivný
Boolean symmetric vs. functional PCSP dichotomy. LICS (2023)
Jannik Kudla, Stanislav Zivný
Sparsification of Monotone k-Submodular Functions of Low Curvature. CoRR (2023)
Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
On the complexity of the approximate hypergraph homomorphism problem. CoRR (2023)
Lorenzo Ciardo, Stanislav Zivný
Hierarchies of Minion Tests for PCSPs through Tensors. SODA (2023)
Lorenzo Ciardo, Stanislav Zivný
Approximate Graph Colouring and the Hollow Shadow. STOC (2023)
Lorenzo Ciardo, Stanislav Zivný
Semidefinite programming and linear equations vs. homomorphism problems. CoRR (2023)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. CoRR (2023)
Clément Carbonnel, Miguel Romero, Stanislav Zivný
The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side. SIAM J. Comput. 51 (1) (2022)
Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). Dagstuhl Reports 12 (5) (2022)
Tamio-Vesa Nakajima, Stanislav Zivný
Boolean symmetric vs. functional PCSP dichotomy. CoRR (2022)
Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. 23 (3) (2022)
Lorenzo Ciardo, Stanislav Zivný
Approximate Graph Colouring and the Hollow Shadow. CoRR (2022)
Tamio-Vesa Nakajima, Stanislav Zivný
Linearly Ordered Colourings of Hypergraphs. ACM Trans. Comput. Theory 14 (3-4) (2022)
Tamio-Vesa Nakajima, Stanislav Zivný
Linearly ordered colourings of hypergraphs. CoRR (2022)
Lorenzo Ciardo, Stanislav Zivný
Approximate Graph Colouring and Crystals. CoRR (2022)
Lorenzo Ciardo, Stanislav Zivný
The Sherali-Adams Hierarchy for Promise CSPs through Tensors. CoRR (2022)
Tamio-Vesa Nakajima, Stanislav Zivný
Linearly Ordered Colourings of Hypergraphs. ICALP (2022)
Lorenzo Ciardo, Stanislav Zivný
Hierarchies of Minion Tests for PCSPs through Tensors. CoRR (2022)
Lorenzo Ciardo, Stanislav Zivný
CLAP: A New Algorithm for Promise CSPs. SODA (2022)
Alex Brandts, Stanislav Zivný
Beyond PCSP(1-in-3, NAE). Inf. Comput. 289 (Part) (2022)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. PODS (2022)
Caterina Viola, Stanislav Zivný
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. ACM Trans. Algorithms 17 (3) (2021)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. CoRR (2021)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions to Square-free Graphs. ACM Trans. Algorithms 17 (3) (2021)
Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný
PTAS for Sparse General-Valued CSPs. LICS (2021)
Ragnar Groot Koerkamp, Stanislav Zivný
On rainbow-free colourings of uniform hypergraphs. CoRR (2021)
Alex Brandts, Stanislav Zivný
Beyond PCSP(1-in-3, NAE). ICALP (2021)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
-minor-free Graphs, modulo 2. SODA (2021)
Alex Brandts, Marcin Wrochna, Stanislav Zivný
The Complexity of Promise SAT on Non-Boolean Domains. ACM Trans. Comput. Theory 13 (4) (2021)
Miguel Romero, Marcin Wrochna, Stanislav Zivný
Treewidth-Pliability and PTAS for Max-CSPs. SODA (2021)
Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. ESA (2021)
Lorenzo Ciardo, Stanislav Zivný
CLAP: A New Algorithm for Promise CSPs. CoRR (2021)
Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. CoRR (2021)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
-Minor-Free Graphs, Modulo 2. SIAM J. Discret. Math. 35 (4) (2021)
Eden Pelleg, Stanislav Zivný
Additive Sparsification of CSPs. ESA (2021)
Alex Brandts, Stanislav Zivný
Beyond PCSP(1-in-3, NAE). CoRR (2021)
Ragnar Groot Koerkamp, Stanislav Zivný
On rainbow-free colourings of uniform hypergraphs. Theor. Comput. Sci. 885 (2021)
Eden Pelleg, Stanislav Zivný
Additive Sparsification of CSPs. CoRR (2021)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions. ACM Trans. Comput. Theory 12 (3) (2020)
Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný
PTAS for Sparse General-Valued CSPs. CoRR (2020)
Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Zivný
The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs. Electron. Colloquium Comput. Complex. 27 (2020)
David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný
Galois Connections for Patterns: An Algebra of Labelled Graphs. GKR (2020)
Alex Brandts, Marcin Wrochna, Stanislav Zivný
The Complexity of Promise SAT on Non-Boolean Domains. ICALP (2020)
Caterina Viola, Stanislav Zivný
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. MFCS (2020)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
-minor-free Graphs, modulo 2. CoRR (2020)
Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný
Topology and adjunction in promise constraint satisfaction. Electron. Colloquium Comput. Complex. 27 (2020)
Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivný
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. J. Comput. Syst. Sci. 109 (2020)
Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný
Topology and adjunction in promise constraint satisfaction. CoRR (2020)
Silvia Butti, Stanislav Zivný
Sparsification of Binary CSPs. SIAM J. Discret. Math. 34 (1) (2020)
Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Zivný
The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems. SIAM J. Comput. 49 (6) (2020)
Clément Carbonnel, Miguel Romero, Stanislav Zivný
Point-Width and Max-CSPs. ACM Trans. Algorithms 16 (4) (2020)
Caterina Viola, Stanislav Zivný
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains. CoRR (2020)
Marcin Wrochna, Stanislav Zivný
-colourable graphs. SODA (2020)
Gregor Matl, Stanislav Zivný
Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs. Algorithmica 82 (12) (2020)
Andrei A. Bulatov, Stanislav Zivný
Approximate Counting CSP Seen from the Other Side. ACM Trans. Comput. Theory 12 (2) (2020)
Andrei A. Bulatov, Stanislav Zivný
Approximate Counting CSP Seen from the Other Side. MFCS (2019)
Peter Fulla, Hannes Uppman, Stanislav Zivný
The Complexity of Boolean Surjective General-Valued CSPs. ACM Trans. Comput. Theory 11 (1) (2019)
Marcin Wrochna, Stanislav Zivný
Improved hardness for H-colourings of G-colourable graphs. CoRR (2019)
Gregor Matl, Stanislav Zivný
Beyond Boolean Surjective VCSPs. CoRR (2019)
Clément Carbonnel, Miguel Romero, Stanislav Zivný
Point-width and Max-CSPs. CoRR (2019)
Gregor Matl, Stanislav Zivný
Beyond Boolean Surjective VCSPs. STACS (2019)
Andrei A. Bulatov, Stanislav Zivný
Approximate counting CSP seen from the other side. CoRR (2019)
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
A Tractable Class of Binary VCSPs via M-Convex Intersection. ACM Trans. Algorithms 15 (3) (2019)
Miguel Romero, Marcin Wrochna, Stanislav Zivný
Treewidth-Pliability and PTAS for Max-CSPs. CoRR (2019)
David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný
Binary constraint satisfaction problems defined by excluded topological minors. Inf. Comput. 264 (2019)
Clément Carbonnel, Miguel Romero, Stanislav Zivný
Point-width and Max-CSPs. LICS (2019)
Silvia Butti, Stanislav Zivný
Sparsification of Binary CSPs. CoRR (2019)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions. SODA (2019)
Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. Algorithmica 81 (4) (2019)
Silvia Butti, Stanislav Zivný
Sparsification of Binary CSPs. STACS (2019)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Counting Surjective Homomorphisms and Compactions. SIAM J. Discret. Math. 33 (2) (2019)
Alex Brandts, Marcin Wrochna, Stanislav Zivný
The complexity of promise SAT on non-Boolean domains. CoRR (2019)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions to Square-Free Graphs. CoRR (2019)
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. STACS (2018)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions. CoRR (2018)
Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
Discrete convexity in joint winner property. Discret. Optim. 28 (2018)
Johan Thapper, Stanislav Zivný
The Limits of SDP Relaxations for General-Valued CSPs. ACM Trans. Comput. Theory 10 (3) (2018)
Clément Carbonnel, Miguel Romero, Stanislav Zivný
The Complexity of General-Valued CSPs Seen from the Other Side. FOCS (2018)
Martin Grohe, Venkatesan Guruswami, Stanislav Zivný
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231). Dagstuhl Reports 8 (6) (2018)

Stanislav Zivný.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stanislav Zivný