en
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.
52 Publications
2019 | Journal Article | IST-REx-ID: 6596 
Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces
Y. Shehu, Results in Mathematics 74 (2019).
View
| Files available
| DOI
Y. Shehu, Results in Mathematics 74 (2019).
2019 | Journal Article | IST-REx-ID: 7412
A local lemma for focused stochastical algorithms
D. Achlioptas, F. Iliopoulos, V. Kolmogorov, SIAM Journal on Computing 48 (2019) 1583–1602.
View
| DOI
| Download (ext.)
| arXiv
D. Achlioptas, F. Iliopoulos, V. Kolmogorov, SIAM Journal on Computing 48 (2019) 1583–1602.
2019 | Conference Paper | IST-REx-ID: 6725
Testing the complexity of a valued CSP language
V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.
View
| Files available
| DOI
| arXiv
V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.
2019 | Conference Paper | IST-REx-ID: 7468
Map inference via block-coordinate Frank-Wolfe algorithm
P. Swoboda, V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2019, pp. 11138–11147.
View
| DOI
| Download (ext.)
| arXiv
P. Swoboda, V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2019, pp. 11138–11147.
2019 | Journal Article | IST-REx-ID: 6593
An efficient projection-type method for monotone variational inequalities in Hilbert spaces
Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms (2019) 1–24.
View
| Files available
| DOI
Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms (2019) 1–24.
2019 | Journal Article | IST-REx-ID: 7161
Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces
Y. Shehu, A. Gibali, S. Sagratella, Journal of Optimization Theory and Applications (2019).
View
| DOI
Y. Shehu, A. Gibali, S. Sagratella, Journal of Optimization Theory and Applications (2019).
2019 | Journal Article | IST-REx-ID: 6032
Even delta-matroids and the complexity of planar boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2019).
View
| DOI
| Download (ext.)
| arXiv
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2019).
2019 | Journal Article | IST-REx-ID: 7000
Convergence analysis of projection method for variational inequalities
Y. Shehu, O.S. Iyiola, X.-H. Li, Q.-L. Dong, Computational and Applied Mathematics 38 (2019).
View
| DOI
Y. Shehu, O.S. Iyiola, X.-H. Li, Q.-L. Dong, Computational and Applied Mathematics 38 (2019).
2018 | Conference Paper | IST-REx-ID: 193
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View
| DOI
| Download (ext.)
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
2018 | Conference Paper | IST-REx-ID: 5978
Exact MAP-inference by confining combinatorial search with LP relaxation
S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI, 2018, pp. 6581–6588.
View
S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI, 2018, pp. 6581–6588.
2018 | Journal Article | IST-REx-ID: 18
Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
View
| Download (ext.)
| arXiv
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
2018 | Journal Article | IST-REx-ID: 5975
Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
View
| Files available
| DOI
| Download (ext.)
| arXiv
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
2018 | Journal Article | IST-REx-ID: 703
Maximum persistency via iterative relaxed inference with graphical models
A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.
View
| DOI
| Download (ext.)
| arXiv
A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.
2018 | Conference Paper | IST-REx-ID: 273
Efficient optimization for rank-based loss functions
P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–3701.
View
| DOI
| Download (ext.)
| arXiv
P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–3701.
2017 | Conference Paper | IST-REx-ID: 1192
Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
View
| DOI
| Download (ext.)
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
2017 | Conference Paper | IST-REx-ID: 915
A message passing algorithm for the minimum cost multicut problem
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
View
| Files available
| DOI
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
2017 | Journal Article | IST-REx-ID: 644
The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.
View
| Files available
| DOI
| Download (ext.)
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.
2017 | Conference Paper | IST-REx-ID: 916
A study of lagrangean decompositions and dual ascent solvers for graph matching
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.
View
| Files available
| DOI
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.
2017 | Thesis | IST-REx-ID: 992
Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, IST Austria, 2017.
View
| Files available
| DOI
M. Rolinek, Complexity of Constraint Satisfaction, IST Austria, 2017.
2017 | Conference Paper | IST-REx-ID: 917
A dual ascent framework for Lagrangean decomposition of combinatorial problems
P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.
View
| Files available
| DOI
P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.