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.




56 Publications

2018 | Research Data | IST-REx-ID: 5573   OA
Alhaija, Hassan, Anita Sellent, Daniel Kondermann, and Carsten Rother. Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow. IST Austria, 2018. https://doi.org/10.15479/AT:ISTA:82.
View | Files available | DOI
 
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: 1192
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 (ext.)
 
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing 46, no. 3 (2017): 1087–1110. https://doi.org/10.1137/16M1091836.
View | Files available | DOI | Download (ext.)
 
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
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed