en
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.
53 Publications
2019 | Journal Article | IST-REx-ID: 6596 
Shehu, Yekini. “Convergence Results of Forward-Backward Algorithms for Sum of Monotone Operators in Banach Spaces.” Results in Mathematics, vol. 74, no. 4, Springer, 2019, p. 138, doi:10.1007/s00025-019-1061-4.
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6725
Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.
View
| Files available
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 6593
Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms, Springer Nature, 2019, pp. 1–24, doi:10.1007/s11075-019-00758-y.
View
| Files available
| DOI
2019 | Journal Article | IST-REx-ID: 7161
Shehu, Yekini, et al. “Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces.” Journal of Optimization Theory and Applications, Springer Nature, 2019, doi:10.1007/s10957-019-01616-6.
View
| DOI
2019 | Journal Article | IST-REx-ID: 6032
Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2019, doi:10.1145/3230649.
View
| DOI
| Download (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 7000
Shehu, Yekini, et al. “Convergence Analysis of Projection Method for Variational Inequalities.” Computational and Applied Mathematics, vol. 38, no. 4, Springer Nature, 2019, p. 161, doi:10.1007/s40314-019-0955-9.
View
| DOI
2018 | Conference Paper | IST-REx-ID: 193
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
View
| DOI
| Download (ext.)
2018 | Conference Paper | IST-REx-ID: 5978
Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI, 2018, pp. 6581–88.
View
2018 | Journal Article | IST-REx-ID: 18
Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.
View
| Download (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 5975
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
View
| Files available
| DOI
| Download (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 703
Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
View
| DOI
| Download (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 273
Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
View
| DOI
| Download (ext.)
| arXiv
2018 | Research Data | IST-REx-ID: 5573
Alhaija, Hassan, et al. 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
Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.
View
| DOI
| Download (ext.)
2017 | Conference Paper | IST-REx-ID: 915
Swoboda, Paul, and Bjoern Andres. A Message Passing Algorithm for the Minimum Cost Multicut Problem. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:10.1109/CVPR.2017.530.
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 644
Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
View
| Files available
| DOI
| Download (ext.)
2017 | Conference Paper | IST-REx-ID: 916
Swoboda, Paul, et al. A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:10.1109/CVPR.2017.747.
View
| Files available
| DOI
2017 | Thesis | IST-REx-ID: 992
Rolinek, Michal. 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
Swoboda, Paul, et al. A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:10.1109/CVPR.2017.526.
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 641
Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.
View
| DOI