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.




50 Publications

2019 | Journal Article | IST-REx-ID: 6596   OA
Shehu Y. Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces. Results in Mathematics. 2019;74(4):138. doi:10.1007/s00025-019-1061-4
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6725   OA
Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 6593   OA
Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 2019:1-24. doi:10.1007/s11075-019-00758-y
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 2019;15(2). doi:10.1145/3230649
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 5978
Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI; 2018:6581-6588.
View
 
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria. 2018;141(10):269-304.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5975   OA
Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 703   OA
Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 273   OA
Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. Efficient optimization for rank-based loss functions. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2018:3693-3701. doi:10.1109/cvpr.2018.00389
View | DOI | Download (ext.) | arXiv
 
2018 | Research Data | IST-REx-ID: 5573   OA
Alhaija H, Sellent A, Kondermann D, Rother C. Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow. IST Austria; 2018. doi:10.15479/AT:ISTA:82
View | Files available | DOI
 
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
 
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 | Conference Paper | IST-REx-ID: 274   OA
Kolmogorov V. A faster approximation algorithm for the Gibbs partition function. In: Unknown; 2017:1-17.
View | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed