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


2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda, A., Kolmogorov, V., & Rolinek, M. (2019). Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms, 15(2), 22. https://doi.org/10.1145/3230649
View | Files available | DOI | Download (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7000
Shehu, Y., Iyiola, O. S., Li, X.-H., & Dong, Q.-L. (2019). Convergence analysis of projection method for variational inequalities. Computational and Applied Mathematics, 38(4). https://doi.org/10.1007/s40314-019-0955-9
View | DOI
 

2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In Proceedings of the 2018 on Asia Conference on Computer and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM. https://doi.org/10.1145/3196494.3196534
View | DOI | Download (ext.)
 

2018 | Conference Paper | IST-REx-ID: 5978
Haller, S., Swoboda, P., & Savchynskyy, B. (2018). Exact MAP-inference by confining combinatorial search with LP relaxation. In Proceedings of the 32st AAAI Conference on Artificial Intelligence (pp. 6581–6588). New Orleans, LU, United States: AAAI.
View
 

2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov, V., & Rolinek, M. (2018). Superconcentrators of density 25.3. Ars Combinatoria, 141(10), 269–304.
View | Download (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 703   OA
Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(7), 1668–1682. https://doi.org/10.1109/TPAMI.2017.2730884
View | DOI | Download (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 5975
Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing, 47(6), 2029–2056. https://doi.org/10.1137/16m1093306
View | Files available | DOI | Download (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 273   OA
Mohapatra, P., Rolinek, M., Jawahar, C. V., Kolmogorov, V., & Kumar, M. P. (2018). Efficient optimization for rank-based loss functions. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 3693–3701). Salt Lake City, UT, USA: IEEE. https://doi.org/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. (2018). Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. IST Austria. https://doi.org/10.15479/AT:ISTA:82
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 915   OA
Swoboda, P., & Andres, B. (2017). A message passing algorithm for the minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.530
View | Files available | DOI
 

Filters and Search Terms

department=VlKo

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed