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.
72 Publications
2024 | Journal Article | IST-REx-ID: 10045 | 
Dvorak M, Kolmogorov V. 2024. Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming., 2109.10203.
[Preprint]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14084 |
Harris DG, Kolmogorov V. 2023. Parameter estimation for Gibbs distributions. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 72.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 13120 |
Dvorak M, Blanchette J. 2023. Closure properties of general grammars - formally verified. 14th International Conference on Interactive Theorem Proving. ITP: International Conference on Interactive Theorem Proving, LIPIcs, vol. 268, 15.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14448 |
Kolmogorov V. 2023. Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2023, 11980–11989.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 10737 |
Takhanov R, Kolmogorov V. 2022. Combining pattern-based CRFs and weighted context-free grammars. Intelligent Data Analysis. 26(1), 257–272.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 7577 |
Shehu Y, Iyiola OS. 2022. Weak convergence for variational inequalities with inertial-type method. Applicable Analysis. 101(1), 192–216.
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10072 |
Harris DG, Iliopoulos F, Kolmogorov V. 2021. A new notion of commutativity for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation, LIPIcs, vol. 207, 31.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10552 |
Kolmogorov V, Pock T. 2021. One-sided Frank-Wolfe algorithms for saddle problems. 38th International Conference on Machine Learning. ICML: International Conference on Machine Learning.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 9592 |
Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. Proceedings of the 33rd Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry.
[Submitted Version]
View
| Files available
| arXiv
2021 | Journal Article | IST-REx-ID: 9234 |
Izuchukwu C, Shehu Y. 2021. New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. Networks and Spatial Economics. 21(2), 291–323.
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Conference Paper | IST-REx-ID: 9227
Bloch-Hansen A, Samei N, Solis-Oba R. 2021. Experimental evaluation of a local search approximation algorithm for the multiway cut problem. Conference on Algorithms and Discrete Applied Mathematics. CALDAM: Conference on Algorithms and Discrete Applied Mathematics, LNCS, vol. 12601, 346–358.
View
| DOI
2021 | Journal Article | IST-REx-ID: 8196 |
Shehu Y, Dong Q-L, Liu L-L, Yao J-C. 2021. New strong convergence method for the sum of two maximal monotone operators. Optimization and Engineering. 22, 2627–2653.
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 7925 |
Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities. Optimization Letters. 15, 2109–2126.
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Journal Article | IST-REx-ID: 6593 |
Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388.
[Submitted Version]
View
| Files available
| DOI
| WoS
2020 | Journal Article | IST-REx-ID: 8077 |
Shehu Y, Iyiola OS. 2020. Projection methods with alternating inertial steps for variational inequalities: Weak and linear convergence. Applied Numerical Mathematics. 157, 315–337.
[Submitted Version]
View
| Files available
| DOI
| WoS
2020 | Journal Article | IST-REx-ID: 7161 |
Shehu Y, Gibali A, Sagratella S. 2020. Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces. Journal of Optimization Theory and Applications. 184, 877–894.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Conference Paper | IST-REx-ID: 6725 |
Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 6596 |
Shehu Y. 2019. Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces. Results in Mathematics. 74(4), 138.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7000 |
Shehu Y, Iyiola OS, Li X-H, Dong Q-L. 2019. Convergence analysis of projection method for variational inequalities. Computational and Applied Mathematics. 38(4), 161.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7412 |
Achlioptas D, Iliopoulos F, Kolmogorov V. 2019. A local lemma for focused stochastical algorithms. SIAM Journal on Computing. 48(5), 1583–1602.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7468 |
Swoboda P, Kolmogorov V. 2019. Map inference via block-coordinate Frank-Wolfe algorithm. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2019–June, 11138–11147.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7639
Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms for neural networks. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 748–752.
View
| DOI
| WoS
2018 | Journal Article | IST-REx-ID: 703 |
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Book Chapter | IST-REx-ID: 10864 |
Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science. vol. 16, 203–220.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 273 |
Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. 2018. Efficient optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 3693–3701.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 193 |
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security , 51–65.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
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.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 5978 |
Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence, 6581–6588.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 18 |
Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 6032 |
Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Journal Article | IST-REx-ID: 644 |
Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2017 | Conference Paper | IST-REx-ID: 646 |
Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Thesis | IST-REx-ID: 992 |
Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 1192 |
Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Conference Paper | IST-REx-ID: 916 |
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A study of lagrangean decompositions and dual ascent solvers for graph matching. CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 915 |
Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 917 |
Swoboda P, Kuske J, Savchynskyy B. 2017. A dual ascent framework for Lagrangean decomposition of combinatorial problems. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4950–4960.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 274 |
Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual Conference on Learning Theory vol. 75, 228–249.
[Published Version]
View
| Files available
| arXiv
2016 | Conference Paper | IST-REx-ID: 1231 |
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666, 358–387.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2016 | Journal Article | IST-REx-ID: 1353 |
Barto L, Kazda A. 2016. Deciding absorption. International Journal of Algebra and Computation. 26(5), 1033–1060.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1377 |
Kolmogorov V, Pock T, Rolinek M. 2016. Total variation on a tree. SIAM Journal on Imaging Sciences. 9(2), 605–636.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1612 |
Kazda A. 2016. CSP for binary conservative relational structures. Algebra Universalis. 75(1), 75–84.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Conference Paper | IST-REx-ID: 1193 |
Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December, 7782993.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Journal Article | IST-REx-ID: 1794 |
Kolmogorov V, Takhanov R. 2016. Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. 76(1), 17–46.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 1636 |
Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 26th International Symposium. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 9472, 566–577.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv