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.




51 Publications

2019 | Journal Article | IST-REx-ID: 6596   OA
Shehu, Y. (2019). Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces. Results in Mathematics, 74(4), 138. https://doi.org/10.1007/s00025-019-1061-4
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6725   OA
Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/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. (2019). An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms, 1–24. https://doi.org/10.1007/s11075-019-00758-y
View | Files available | DOI
 
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). https://doi.org/10.1145/3230649
View | DOI | Download (ext.) | arXiv
 
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: 5975   OA
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 | 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 | 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: 1192   OA
Kazda, A., Kolmogorov, V., & Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. https://doi.org/10.1137/1.9781611974782.20
View | DOI | Download (ext.)
 
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
 
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing, 46(3), 1087–1110. https://doi.org/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. (2017). A study of lagrangean decompositions and dual ascent solvers for graph matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.747
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992   OA
Rolinek, M. (2017). Complexity of constraint satisfaction. IST Austria. https://doi.org/10.15479/AT:ISTA:th_815
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917   OA
Swoboda, P., Kuske, J., & Savchynskyy, B. (2017). A dual ascent framework for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/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. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_26
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 646   OA
Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 274   OA
Kolmogorov, V. (2017). A faster approximation algorithm for the Gibbs partition function (pp. 1–17). Presented at the COLT: Annual Conference on Learning Theory , Unknown.
View | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed