Standa Živný : Publications
|
[1] |
Tractable valued constraints Peter G. Jeavons and Stanislav Živný In Lucas Bordeaux‚ Youssef Hamadi‚ Pushmeet Kohli and Robert Mateescu, editors, Tractability: Practical Approaches to Hard Problems. Cambridge University Press. 2012. This work is in copyright. The draft is for personal use only. No further distribution without permission. |
|
[2] |
Tractable triangles and cross−free convexity in discrete optimisation Martin C. Cooper and Stanislav Živný In Journal of Artificial Intelligence Research. Vol. 44. Pages 455–490. 2012. |
|
[3] |
Relating proof complexity measures and practical hardness of SAT Matti Järvisalo‚ Arie Matsliah‚ Jakob Nordström and Stanislav Živný In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP'12). Springer. 2012. |
|
[4] |
A characterisation of the complexity of forbidding subproblems in binary Max−CSP Martin C. Cooper‚ Guillaume Escamocher and Stanislav Živný In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP'12). Springer. 2012. |
|
[5] |
The complexity of conservative valued CSPs Vladimir Kolmogorov and Stanislav Živný In Proceedings of the 23rd ACM−SIAM Symposium on Discrete Algorithms (SODA'12). Pages 750–759. 2012. Preprint: http://zivny.cz/publications/kz12soda−preprint.pdf |
|
[6] |
The power of linear programming for valued CSPs Johan Thapper and Stanislav Živný 2012. arXiv:1204.1079 |
|
[7] |
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 | DOI (10.1016/j.artint.2011.02.003) | Download (pdf) |
|
[8] |
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 | DOI (10.1007/978-3-642-23786-7_18) | Link |
|
[9] |
Hierarchically nested convex VCSP Martin C. Cooper 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 187–194. Springer. 2011. Details | BibTeX | DOI (10.1007/978-3-642-23786-7_16) | Download (pdf) |
|
[10] |
Tractable triangles Martin C. Cooper 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 195–209. Springer. 2011. Details | BibTeX | DOI (10.1007/978-3-642-23786-7_17) | Link |
|
[11] |
An algebraic theory of complexity for valued constraints: Establishing a Galois connection David A. Cohen‚ Páidí Creed‚ Peter G. Jeavons and Stanislav Živný In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11). Vol. 6907 of Lecture Notes in Computer Science. Pages 231–242. Springer. 2011. Details | BibTeX | DOI (10.1007/978-3-642-22993-0_23) | Download (pdf) |
|
[12] |
The complexity of conservative valued CSPs Vladimir Kolmogorov and Stanislav Živný 2011. arXiv:1110.2809 |
|
[13] |
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. |
|
[14] |
Classes of submodular constraints expressible by graph cuts Stanislav Živný and Peter G. Jeavons In Constraints. Vol. 15. No. 3. Pages 430−452. 2010. Details | BibTeX | DOI (10.1007/s10601-009-9078-z) | Download (pdf) |
|
[15] |
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. Details | BibTeX | DOI (10.1007/978-3-642-15396-9_15) | Download (pdf) |
|
[16] |
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms Vladimir Kolmogorov and Stanislav Živný 2010. arXiv:1008.3104 |
|
[17] |
The complexity of conservative finite−valued CSPs Vladimir Kolmogorov and Stanislav Živný 2010. arXiv:1008.1555 |
|
[18] |
Hybrid tractability of soft constraint problems Martin C. Cooper and Stanislav Živný 2010. arXiv:1008.4071 |
|
[19] |
Structural properties of oracle classes Stanislav Živný In Information Processing Letters. Vol. 109. No. 19. Pages 1131–1135. 2009. Details | BibTeX | DOI (10.1016/j.ipl.2009.07.009) | Download (pdf) |
|
[20] |
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. Details | BibTeX | DOI (10.1016/j.dam.2009.07.001) | Download (pdf) |
|
[21] |
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. Details | BibTeX | DOI (10.1016/j.ipl.2009.01.018) | Download (pdf) |
|
[22] |
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. Details | BibTeX | DOI (10.1007/978-3-642-04244-7_64) | Download (pdf) |
|
[23] |
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. Details | BibTeX | DOI (10.1007/978-3-642-04244-7_38) | Download (pdf) |
|
[24] |
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. |
|
[25] |
The Complexity and Expressive Power of Valued Constraints Stanislav Živný PhD Thesis University of Oxford. 2009. ACP (Association for Constraint Programming) Doctoral Research Award 2011. |
|
[26] |
Which submodular functions are expressible using binary submodular functions? Stanislav Živný and Peter G. Jeavons No. RR−08−08. OUCL. Oxford‚ UK. June, 2008. |
|
[27] |
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. |
|
[28] |
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. Details | BibTeX | DOI (10.1016/j.tcs.2008.08.036) | Download (pdf) |
|
[29] |
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. Details | BibTeX | DOI (10.1007/978-3-540-85958-1_8) | Download (pdf) |
|
[30] |
The Expressive Power of Binary Submodular Functions Stanislav Živný‚ David A. Cohen and Peter G. Jeavons 2008. arXiv:0811.1885 [cs.DM] |
|
[31] |
Expressibility of valued constraints Stanislav Živný and Peter G. Jeavons September, 2007. |
|
[32] |
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. Details | BibTeX | Download (pdf) | Link |
|
[33] |
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. Details | BibTeX | DOI (10.1007/978-3-540-74970-7_57) | Download (pdf) |
|
[34] |
Properties of oracle classes that collapse or separate complexity classes Stanislav Živný Master's Thesis Vrije Universiteit in Amsterdam. The Netherlands. July, 2005. |
|
[35] |
Relation between accepting languages and complexity of questions on orcle Stanislav Živný Master's Thesis Charles University in Prague. Czech republic. April, 2005. |