Stanislav Živný

Cited by

	All	Since 2016
Citations	1137	700
h-index	18	17
i10-index	25	21

180

135

200820092010201120122013201420152016201720182019202020215 9 9 33 67 79 100 101 156 169 131 96 126 20

Co-authors

Martin CooperProfessor of Computer Science, IRIT, University of ToulouseVerified email at irit.fr
Peter JeavonsProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Dave CohenProfessor of Computer Science, Royal Holloway, University of LondonVerified email at rhul.ac.uk
Johan ThapperUniversité Paris-Est, Marne-la-ValléeVerified email at u-pem.fr
Andrei KrokhinProfessor of Computer Science, Durham University, UKVerified email at durham.ac.uk
Vladimir KolmogorovIST AustriaVerified email at ist.ac.at
Páidí CreedBenvolent AIVerified email at benevolent.ai
Leslie Ann GoldbergProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Justin WardQueen Mary University of LondonVerified email at qmul.ac.uk
Clément CarbonnelCNRS - LIRMMVerified email at lirmm.fr
Arie MatsliahGoogle inc.Verified email at google.com
Jakob NordströmUniversity of Copenhagen and Lund UniversityVerified email at di.ku.dk
Matti JärvisaloAssociate Professor, University of HelsinkiVerified email at helsinki.fi
Andrei BulatovSimon Fraser UniversityVerified email at sfu.ca
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerified email at szeider.net
Serge GaspersAssociate Professor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Karen PetrieLecturer, University of DundeeVerified email at computing.dundee.ac.uk
Christopher JeffersonUniversity of St AndrewsVerified email at st-andrews.ac.uk
Serdar KadiogluBrown University | Fidelity Investments | OracleVerified email at cs.brown.edu

Stanislav Živný

Professor of Computer Science, University of Oxford

Verified email at cs.ox.ac.uk - Homepage

computational complexity constraint satisfaction counting complexity discrete optimisation submodular functions


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The complexity of finite-valued CSPs J Thapper, S Živný Journal of the ACM (JACM) 63 (4), 2016	120	2016
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	86	2012
The power of linear programming for general-valued CSPs V Kolmogorov, J Thapper, S Zivny SIAM Journal on Computing 44 (1), 1-36, 2015	78	2015
The complexity of conservative valued CSPs V Kolmogorov, S Živný Journal of the ACM (JACM) 60 (2), 2013	77*	2013
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	74*	2013
The expressive power of binary submodular functions S Živný, DA Cohen, PG Jeavons Discrete Applied Mathematics 157 (15), 3347-3358, 2009	65	2009
The Complexity of Valued Constraint Satisfaction Problems S Živný Springer-Verlag New York Incorporated, 2012	53*	2012
Hybrid tractability of valued constraint problems MC Cooper, S Živný Artificial Intelligence 175 (9-10), 1555-1569, 2011	51*	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	43	2012
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation MC Cooper, S Živný Journal of Artificial Intelligence Research 44, 455-490, 2012	38*	2012
Maximizing bisubmodular and k-submodular functions J Ward, S Živný Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014	36*	2014
The complexity of valued constraint satisfaction P Jeavons, A Krokhin, S Živný Bulletin of EATCS 2 (113), 2014	34	2014
Classes of submodular constraints expressible by graph cuts S Živný, PG Jeavons Constraints 15 (3), 430-452, 2010	34	2010
The constraint satisfaction problem: Complexity and approximability A Krokhin, S Zivny Schloss Dagstuhl, 2017	28	2017
The complexity of valued CSPs. A Krokhin, S Živný Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017	23	2017
Sherali-Adams relaxations for valued CSPs J Thapper, S Zivny Proceedings of the 42nd International Colloquium on Automata, Languages, and …, 2015	21	2015
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	20	2017
The power of Sherali--Adams relaxations for general-valued CSPs J Thapper, S Zivny SIAM Journal on Computing 46 (4), 1241-1279, 2017	20	2017
Variable and value elimination in binary constraint satisfaction via forbidden patterns DA Cohen, MC Cooper, G Escamocher, S Živný Journal of Computer and System Sciences 81 (7), 1127-1143, 2015	18	2015
Hybrid tractable classes of constraint problems MC Cooper, S Zivny Dagstuhl Follow-Ups 7, 2017	17	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors