Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
67 Publications
2018 | Journal Article | IST-REx-ID: 6032 | 
Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 703 |
Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 274 |
Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual Conference on Learning Theory vol. 75, 228–249.
View
| Files available
| arXiv
2017 | Research Data | IST-REx-ID: 5561 |
Kainmueller D, Jug F, Rother C, Meyers G. 2017. Graph matching problems for annotating C. Elegans, IST Austria, 10.15479/AT:ISTA:57.
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 644 |
Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
View
| Files available
| DOI
| Download Preprint (ext.)
2017 | Conference Paper | IST-REx-ID: 646 |
Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 1192 |
Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.
View
| Files available
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 915 |
Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 916 |
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A study of lagrangean decompositions and dual ascent solvers for graph matching. CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 917 |
Swoboda P, Kuske J, Savchynskyy B. 2017. A dual ascent framework for Lagrangean decomposition of combinatorial problems. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4950–4960.
View
| Files available
| DOI
2017 | Thesis | IST-REx-ID: 992 |
Rolinek M. 2017. Complexity of constraint satisfaction. IST Austria.
View
| Files available
| DOI
2016 | Journal Article | IST-REx-ID: 1794 |
Kolmogorov V, Takhanov R. 2016. Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. 76(1), 17–46.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Research Data | IST-REx-ID: 5557 |
Swoboda P. 2016. Synthetic discrete tomography problems, IST Austria, 10.15479/AT:ISTA:46.
View
| Files available
| DOI
2016 | Journal Article | IST-REx-ID: 1353 |
Barto L, Kazda A. 2016. Deciding absorption. International Journal of Algebra and Computation. 26(5), 1033–1060.
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1377 |
Kolmogorov V, Pock T, Rolinek M. 2016. Total variation on a tree. SIAM Journal on Imaging Sciences. 9(2), 605–636.
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1612 |
Kazda A. 2016. CSP for binary conservative relational structures. Algebra Universalis. 75(1), 75–84.
View
| DOI
| Download Preprint (ext.)
2016 | Conference Paper | IST-REx-ID: 1193 |
Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December, 7782993.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Conference Paper | IST-REx-ID: 1231 |
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666, 358–387.
View
| DOI
| Download Submitted Version (ext.)
2015 | Journal Article | IST-REx-ID: 2271 |
Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv