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.
75 Publications
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.
[Preprint]
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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Thesis | IST-REx-ID: 992 |
Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.
[Published Version]
View
| Files available
| DOI
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.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
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.
[Submitted Version]
View
| Files available
| DOI
| WoS
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.
[Submitted Version]
View
| Files available
| DOI
| WoS
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.
[Submitted Version]
View
| Files available
| DOI
| WoS
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.
[Published Version]
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, Institute of Science and Technology Austria, 10.15479/AT:ISTA:57.
[Published Version]
View
| Files available
| DOI