University of Oxford Logo University of OxfordDepartment of Computer Science - Home
Linked in
Linked in
Follow us on twitter
Twitter
On Facebook
Facebook
Instagram
Instagram

Standa Živn : Publications

By dateBy titleBy typeBibtex

[1]

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection

David A. Cohen‚ Paidi Creed‚ Peter G. Jeavons and Stanislav Zivny

No. RR−10−16. OUCL. November, 2010.

[2]

Classes of submodular constraints expressible by graph cuts

Stanislav Živný and Peter G. Jeavons

In Constraints. Vol. 15. No. 3. Pages 430−452. 2010.

[3]

A new hybrid tractable class of soft constraint problems

Martin C. Cooper and Stanislav Živný

In Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (CP'10). Vol. 6308 of Lecture Notes in Computer Science. 2010.

[4]

Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms (with V. Kolmogorov)‚ arXiv:1008.3104‚ August‚ 2010.

Vladimir Kolmogorov and Stanislav Živný

2010.

arXiv:1008.3104

[5]

The complexity of conservative finite−valued CSPs

Vladimir Kolmogorov and Stanislav Živný

2010.

arXiv:1008.1555

[6]

Hybrid tractability of soft constraint problems

Martin C. Cooper and Stanislav Živný

2010.

arXiv:1008.4071

[7]

Structural properties of oracle classes

Stanislav Živný

In Information Processing Letters. Vol. 109. No. 19. Pages 1131–1135. 2009.

[8]

The expressive power of binary submodular functions

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

In Discrete Applied Mathematics. Vol. 157. No. 15. Pages 3347–3358. 2009.

[9]

A note on some collapse results of valued constraints

Bruno Zanuttini and Stanislav Živný

In Information Processing Letters. Vol. 109. No. 11. Pages 534–538. 2009.

[10]

The complexity of valued constraint models

Stanislav Živný and Peter G. Jeavons

In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP'09). No. 5732. 2009.

[11]

Same−relation constraints

Christopher Jefferson‚ Serdar Kadioglu‚ Karen E. Petrie‚ Meinolf Sellmann and Stanislav Živný

In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP'09). No. 5732. 2009.

[12]

The expressive power of binary submodular functions

Stanislav ivný‚ David A. Cohen and Peter G. Jeavons

In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS'09). 2009.

[13]

The Complexity and Expressive Power of Valued Constraints

Stanislav Živný

PhD Thesis Oxford University Computing Laboratory. 2009.

[14]

Which submodular functions are expressible using binary submodular functions?

Stanislav Živný and Peter G. Jeavons

No. RR−08−08. OUCL. Oxford‚ UK. June, 2008.

[15]

PROCEEDINGS OF THE OXFORD UNIVERSITY COMPUTING LABORATORY STUDENT CONFERENCE 2008

Programme Co−Chairs: Shamal Faily‚ Stanislav Živný Conference Co−Chairs: Christo Fogelberg‚ Andras Salamon and Max Schafer

No. RR−08−10. OUCL. October, 2008.

[16]

The expressive power of valued constraints: Hierarchies and collapses

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

In Theoretical Computer Science. Vol. 409. No. 1. Pages 137–153. 2008.

[17]

Classes of submodular constraints expressible by graph cuts

Stanislav Živný and Peter G. Jeavons

In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP'08). Vol. 5202 of Lecture Notes in Computer Science. Pages 112−127. 2008.

[18]

The Expressive Power of Binary Submodular Functions

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

2008.

arXiv:0811.1885 [cs.DM]

[19]

Expressibility of valued constraints

Stanislav Živný and Peter G. Jeavons

September, 2007.

[20]

The expressive power of valued constraints: hierarchies and collapses

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

No. RR−07−03. Computing Laboratory‚ University of Oxford. Oxford‚ UK. April, 2007.

[21]

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 Practice of Constraint Programming (CP'07). Vol. 4741 of Lecture Notes in Computer Science. Pages 798−805. 2007.

[22]

Properties of oracle classes that collapse or separate complexity classes

Stanislav Živný

Master's Thesis Vrije Universiteit in Amsterdam. The Netherlands. July, 2005.

[23]

Relation between accepting languages and complexity of questions on orcle

Stanislav Živný

Master's Thesis Charles University in Prague. Czech republic. April, 2005.