en
Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
56 Publications
2018 | Research Data | IST-REx-ID: 5573 
Alhaija H, Sellent A, Kondermann D, Rother C. 2018. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow, IST Austria,p.
View
| Files available
| DOI
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: 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 (ext.)
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 (ext.)
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