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.

59 Publications


2017 | Conference Paper | IST-REx-ID: 1192
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 | Files available | DOI | Download (ext.)
 

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
 

2017 | Conference Paper | IST-REx-ID: 917   OA
Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:10.1109/CVPR.2017.526
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 641
Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26
View | DOI
 

2017 | Conference Paper | IST-REx-ID: 646   OA
Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19
View | DOI | Download (ext.)
 

2017 | Research Data | IST-REx-ID: 5561   OA
Kainmueller D, Jug F, Rother C, Meyers G. Graph Matching Problems for Annotating C. Elegans. IST Austria; 2017. doi:10.15479/AT:ISTA:57
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 274   OA
Kolmogorov V. A faster approximation algorithm for the Gibbs partition function. In: Proceedings of the 31st Conference On Learning Theory. Vol 75. PMLR; 2017:228-249.
View | Files available | arXiv
 

2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:10.1007/978-3-662-49896-5_13
View | DOI | Download (ext.)
 

Filters and Search Terms

department=VlKo

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed