Stanislav Živný
Scholar

Stanislav Živný

Google Scholar ID: pAS_AlQAAAAJ
Professor of Computer Science, University of Oxford
constraint satisfactioncomputational complexitycombinatorial optimisationdiscrete optimisation
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
942
 
H-index
17
 
i10-index
29
 
Publications
20
 
Co-authors
41
list available
Contact
No contact links provided.
Publications
10 items
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
Satisfiability of commutative vs. non-commutative CSPs
International Colloquium on Automata, Languages and Programming · 2024
Cited
1
Resume (English only)
Co-authors
41 total
Co-author 1
Co-author 1
Martin Cooper
Martin Cooper
Professor of Computer Science, IRIT, University of Toulouse
Co-author 3
Co-author 3
Co-author 4
Co-author 4
Co-author 5
Co-author 5
Marcin Wrochna
Marcin Wrochna
Institute of Informatics, University of Warsaw
Andrei Krokhin
Andrei Krokhin
Professor of Computer Science, Durham University, UK
Co-author 8
Co-author 8