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.

55 Publications

2017 | Conference Paper | IST-REx-ID: 1192   OA
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:10.1137/1.9781611974782.20
View | DOI | Download (ext.)

2017 | Conference Paper | IST-REx-ID: 915   OA
Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530
View | Files available | DOI

2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836
View | Files available | DOI | Download (ext.)

2017 | Conference Paper | IST-REx-ID: 916   OA
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol 2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747
View | Files available | DOI

2017 | Thesis | IST-REx-ID: 992   OA
Rolinek M. Complexity of Constraint Satisfaction. IST Austria; 2017. doi:10.15479/AT:ISTA:th_815
View | Files available | DOI

Filters and Search Terms



Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed