Standa Živný

Dr Stanislav Živný

Junior Research Fellow

Standa.Zivny@cs.ox.ac.uk

+44 (0)1865 73884

+44 (0)1865 273839 (fax)

Room 357, Wolfson Building, Parks Road, Oxford OX1 3QD

Interests

combinatorial and discrete optimisation: graphical models and submodular functions
constraint satisfaction: computational complexity and efficient algorithms
SAT solvers: resolution and proof complexity

Biography

BSc+MSc+MPhil in CS, Charles University in Prague, Czech republic, 1999-2006
(On leave to the Department of Mathematics, Turku University, Finland, 2006)
MSc in CS, VU University in Amsterdam, The Netherlands, 2004-2005
DPhil in CS, Keble College, Oxford University, 2006-2009
Lecturer in Computing, Hertford College, Oxford University, 2008-2009
EPSRC PhD Plus Fellow, 2009-2010
Stipendiary Junior Research Fellow, University College, Oxford University, 2009-2012
Researcher, Microsoft Research Cambridge, summer 2010
Lecturer in Computing, Balliol College, Oxford University, 2010-2012

Note: Although my first name is Stanislav, I go by Standa, which is a commonly used Czech variant of Stanislav. My last name is pronounced "zhivnee". I'm in 352.

Links

Further details on my work can be found on my personal homepage.

DBLP

Roles

View all

AAAI'10 , PC Member

CP'10 , PC Member

CP'10 , Doctoral Programme Co-Chair

Selected Publications

View all

Manage publications

The complexity of conservative valued CSPs

Vladimir Kolmogorov and Stanislav Živný

In Proceedings of the 23rd Annual ACM−SIAM Symposium on Discrete Algorithms (SODA'12). 2012.

Details | BibTeX | Link (pdf)

Hybrid tractability of valued constraint problems

Martin C. Cooper and Stanislav Živný

In Artificial Intelligence. Vol. 175. No. 9−10. Pages 1555–1569. June, 2011.

Details | BibTeX | Link (pdf) | DOI (10.1016/j.artint.2011.02.003)

On minimal weighted clones

Páidí Creed and Stanislav Živný

In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP'11). Vol. 6876 of Lecture Notes in Computer Science. Pages 210–224. Springer. 2011.

Details | BibTeX | Link | DOI (10.1007/978-3-642-23786-7_18)