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.




60 Publications

2017 | Conference Paper | IST-REx-ID: 915 | OA
Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the Minimum Cost Multicut Problem,” 2017:4990–99. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.530.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 916 | OA
Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller, and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching,” 2017:7062–71. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.747.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917 | OA
Swoboda, Paul, Jan Kuske, and Bogdan Savchynskyy. “A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems,” 2017:4950–60. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.526.
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek, Michal. Complexity of Constraint Satisfaction. IST Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1192 | OA
Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. https://doi.org/10.1137/1.9781611974782.20.
View | Files available | DOI | Download Submitted Version (ext.)
 

Search

Display / Sort

Citation Style: Chicago

Export / Embed