Stanislav Zivny

Stanislav Zivny

Doctoral Student
Student, Keble College

stanislav.zivny@comlab.ox.ac.uk
+44 (0)774 838 9260
+44 (0)1865 273884
+44 (0)1865 273839 (fax)

interests

My research interests include complexity theory, combinatorial optimisation and constraint satisfaction problems. In particular, I am working on:

the complexity and expressive power of valued constraint satisfaction problems
optimisation of submodular functions
minimum cuts in graphs
fixed-parameter tractability of valued constraints

biography

2005 Bc+MSc in CS (summa cum laude), Prague, Czech republic

2005 MSc in CS (cum laude), Amsterdam, Netherlands

2006 Research exchange student, Department of Mathematics, Turku, Finland

links

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

publications

Which submodular functions are expressible using binary submodular functions?

Stanislav Živný, Peter G. Jeavons

No. RR-08-08, Technical Report, OUCLOxford, UK. June 2008.

Details | BibTeX | Download (pdf)

Classes of submodular constraints expressible by graph cuts

Stanislav Živný, Peter G. Jeavons

In Proceedings of the 14th International Conference on Principles and Practice of Contraint Programming (CP'08) Vol. 5202 of Lecture Notes in Computer Science, pages 112-197. 2008.

Details | BibTeX | Link (pdf)

The expressive power of valued constraints: hierarchies and collapses

David A. Cohen, Peter G. Jeavons and Stanislav Živný

In Proceedings of the 13th International Conference on Principles and Practise of Contraint Programming (CP'07) Vol. 4741 of Lecture Notes in Computer Science, pages 798-805. 2007.

(full version submitted to a journal).

Details | BibTeX | Link (pdf) | DOI (10.1007/978-3-540-74970-7_57)

View all

info

themes	Applications and Algorithms
activities	Constraints Group
projects	Complexity of Valued Constraints
supervisor	Peter Jeavons

location

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