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
Y. Shehu, “Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces,” Results in Mathematics, vol. 74, no. 4, p. 138, 2019.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6725   OA
V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 6593   OA
Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for monotone variational inequalities in Hilbert spaces,” Numerical Algorithms, pp. 1–24, 2019.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6032   OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2, 2019.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 193   OA
J. F. Alwen 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, Incheon, Republic of Korea, 2018, pp. 51–65.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 5978
S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining combinatorial search with LP relaxation,” in Proceedings of the 32st AAAI Conference on Artificial Intelligence, New Orleans, LU, United States, 2018, pp. 6581–6588.
View
 
2018 | Journal Article | IST-REx-ID: 18   OA
V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10, pp. 269–304, 2018.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5975   OA
V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM Journal on Computing, vol. 47, no. 6, pp. 2029–2056, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 703   OA
A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, pp. 1668–1682, 2018.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 273   OA
P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp. 3693–3701.
View | DOI | Download (ext.) | arXiv
 
2018 | Research Data | IST-REx-ID: 5573   OA
H. Alhaija, A. Sellent, D. Kondermann, and C. Rother, Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. IST Austria, 2018.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1192   OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 915   OA
P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 644   OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3, pp. 1087–1110, 2017.
View | Files available | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 916   OA
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, and B. Savchynskyy, “A study of lagrangean decompositions and dual ascent solvers for graph matching,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 7062–7071.
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992   OA
M. Rolinek, Complexity of constraint satisfaction. IST Austria, 2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917   OA
P. Swoboda, J. Kuske, and B. Savchynskyy, “ A dual ascent framework for Lagrangean decomposition of combinatorial problems,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4950–4960.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 641
V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 646   OA
J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 274   OA
V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,” presented at the COLT: Annual Conference on Learning Theory , 2017, pp. 1–17.
View | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed