Follow
Stanislav Živný
Stanislav Živný
Other namesStanda Živný, Stanislav Zivný, Standa Zivný
Professor of Computer Science, University of Oxford
Verified email at cs.ox.ac.uk - Homepage
Title
Cited by
Cited by
Year
The complexity of finite-valued CSPs
J Thapper, S Živný
Journal of the ACM (JACM) 63 (4), 2016
1572016
The power of linear programming for valued CSPs
J Thapper, S Živný
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12), 669-678, 2012
1022012
The power of linear programming for general-valued CSPs
V Kolmogorov, J Thapper, S Zivny
SIAM Journal on Computing 44 (1), 1-36, 2015
942015
Maximizing bisubmodular and k-submodular functions
J Ward, S Živný
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
87*2014
An algebraic theory of complexity for discrete optimisation
D Cohen, M Cooper, P Creed, P Jeavons, S Živný
SIAM Journal on Computing 42 (5), 1915-1939, 2013
84*2013
The complexity of conservative valued CSPs
V Kolmogorov, S Živný
Journal of the ACM (JACM) 60 (2), 2013
84*2013
The expressive power of binary submodular functions
S Živný, DA Cohen, PG Jeavons
Discrete Applied Mathematics 157 (15), 3347-3358, 2009
652009
The Complexity of Valued Constraint Satisfaction Problems
S Živný
Springer-Verlag New York Incorporated, 2012
63*2012
Hybrid tractability of valued constraint problems
MC Cooper, S Živný
Artificial Intelligence 175 (9-10), 1555-1569, 2011
59*2011
Relating proof complexity measures and practical hardness of SAT
M Järvisalo, A Matsliah, J Nordström, S Živný
International Conference on Principles and Practice of Constraint …, 2012
462012
The constraint satisfaction problem: Complexity and approximability
A Krokhin, S Zivny
constraint satisfaction problem: complexity and approximability, 2017
432017
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
MC Cooper, S Živný
Journal of Artificial Intelligence Research 44, 455-490, 2012
43*2012
Backdoors into heterogeneous classes of SAT and CSP
S Gaspers, N Misra, S Ordyniak, S Szeider, S Živný
Journal of Computer and System Sciences 85, 38-56, 2017
402017
The power of Sherali--Adams relaxations for general-valued CSPs
J Thapper, S Zivny
SIAM Journal on Computing 46 (4), 1241-1279, 2017
382017
The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
J Brakensiek, V Guruswami, M Wrochna, S Zivny
SIAM Journal on Computing 49 (6), 1232-1248, 2020
372020
The complexity of valued constraint satisfaction
P Jeavons, A Krokhin, S Živný
Bulletin of EATCS 2 (113), 2014
372014
Improved hardness for H-colourings of G-colourable graphs
M Wrochna, S Živný
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
332020
The complexity of valued CSPs
A Krokhin, S Zivny
Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2017
332017
Classes of submodular constraints expressible by graph cuts
S Živný, PG Jeavons
Constraints 15, 430-452, 2010
322010
Topology and adjunction in promise constraint satisfaction
A Krokhin, J Opršal, M Wrochna, S Živný
SIAM Journal on Computing 52 (1), 38-79, 2023
292023
The system can't perform the operation now. Try again later.
Articles 1–20