Scholar
Stanislav Živný
Google Scholar ID: pAS_AlQAAAAJ
Professor of Computer Science, University of Oxford
constraint satisfaction
computational complexity
combinatorial optimisation
discrete optimisation
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
942
H-index
17
i10-index
29
Publications
20
Co-authors
41
list available
Publications
11 items
Constant-factor approximation of MinCostCSP with a conservative majority polymorphism
2026
Cited
0
New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
2026
Cited
0
Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
2025
Cited
0
Equations over Finite Monoids with Infinite Promises
2025
Cited
0
Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
2025
Cited
0
Optimal Inapproximability of Promise Equations over Finite Groups
arXiv.org · 2024
Cited
2
Maximum And- vs. Even-SAT
arXiv.org · 2024
Cited
0
Maximum Bipartite vs. Triangle-Free Subgraph
arXiv.org · 2024
Cited
2
Load more
Co-authors
10 total
Martin Cooper
Professor of Computer Science, IRIT, University of Toulouse
Marcin Wrochna
Institute of Informatics, University of Warsaw
Andrei Krokhin
Professor of Computer Science, Durham University, UK
Vladimir Kolmogorov
IST Austria
Leslie Ann Goldberg
Professor of Computer Science, University of Oxford
Miguel Romero Orth
Department of Computer Science, Pontificia Universidad Católica de Chile
Justin Ward
Queen Mary University of London
Venkatesan Guruswami
University of California, Berkeley
