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.




59 Publications

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
 
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: 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 | Conference Paper | IST-REx-ID: 641
Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_26.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 646   OA
Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_19.
View | DOI | Download (ext.)
 
2017 | Research Data | IST-REx-ID: 5561   OA
Kainmueller, Dagmar, Florian Jug, Carsten Rother, and Gene Meyers. Graph Matching Problems for Annotating C. Elegans. IST Austria, 2017. https://doi.org/10.15479/AT:ISTA:57.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 274   OA
Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” In Proceedings of the 31st Conference On Learning Theory, 75:228–49. PMLR, 2017.
View | Files available | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,” 9666:358–87. Springer, 2016. https://doi.org/10.1007/978-3-662-49896-5_13.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed