Please note that ISTA 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.

75 Publications


2022 | Journal Article | IST-REx-ID: 7577 | OA
Y. Shehu and O. S. Iyiola, “Weak convergence for variational inequalities with inertial-type method,” Applicable Analysis, vol. 101, no. 1. Taylor & Francis, pp. 192–216, 2022.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10072 | OA
D. G. Harris, F. Iliopoulos, and V. Kolmogorov, “A new notion of commutativity for the algorithmic Lovász Local Lemma,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Virtual, 2021, vol. 207.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10552 | OA
V. Kolmogorov and T. Pock, “One-sided Frank-Wolfe algorithms for saddle problems,” in 38th International Conference on Machine Learning, Virtual, 2021.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 9592 | OA
M. Dvorak and S. Nicholson, “Massively winning configurations in the convex grabbing game on the plane,” in Proceedings of the 33rd Canadian Conference on Computational Geometry, Halifax, NS, Canada.
[Submitted Version] View | Files available | arXiv
 

2021 | Journal Article | IST-REx-ID: 9469
O. S. Iyiola, C. D. Enyi, and Y. Shehu, “Reflected three-operator splitting method for monotone inclusion problem,” Optimization Methods and Software. Taylor and Francis, 2021.
View | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 9234 | OA
C. Izuchukwu and Y. Shehu, “New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity,” Networks and Spatial Economics, vol. 21, no. 2. Springer Nature, pp. 291–323, 2021.
[Published Version] View | Files available | DOI | WoS
 

2021 | Conference Paper | IST-REx-ID: 9227
A. Bloch-Hansen, N. Samei, and R. Solis-Oba, “Experimental evaluation of a local search approximation algorithm for the multiway cut problem,” in Conference on Algorithms and Discrete Applied Mathematics, Rupnagar, India, 2021, vol. 12601, pp. 346–358.
View | DOI
 

2021 | Journal Article | IST-REx-ID: 8817
Y. Shehu, O. S. Iyiola, D. V. Thong, and N. T. C. Van, “An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems,” Mathematical Methods of Operations Research, vol. 93, no. 2. Springer Nature, pp. 213–242, 2021.
View | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 9315
O. S. Iyiola and Y. Shehu, “New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert spaces with applications,” Results in Mathematics, vol. 76, no. 2. Springer Nature, 2021.
View | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 9365
F. U. Ogbuisi, Y. Shehu, and J. C. Yao, “Convergence analysis of new inertial method for the split common null point problem,” Optimization. Taylor and Francis, 2021.
View | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 8196 | OA
Y. Shehu, Q.-L. Dong, L.-L. Liu, and J.-C. Yao, “New strong convergence method for the sum of two maximal monotone operators,” Optimization and Engineering, vol. 22. Springer Nature, pp. 2627–2653, 2021.
[Published Version] View | Files available | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 7925 | OA
Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,” Optimization Letters, vol. 15. Springer Nature, pp. 2109–2126, 2021.
[Published Version] View | Files available | DOI | WoS
 

2020 | 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, vol. 84. Springer Nature, pp. 365–388, 2020.
[Submitted Version] View | Files available | DOI | WoS
 

2020 | Journal Article | IST-REx-ID: 8077 | OA
Y. Shehu and O. S. Iyiola, “Projection methods with alternating inertial steps for variational inequalities: Weak and linear convergence,” Applied Numerical Mathematics, vol. 157. Elsevier, pp. 315–337, 2020.
[Submitted Version] View | Files available | DOI | WoS
 

2020 | Journal Article | IST-REx-ID: 7161 | OA
Y. Shehu, A. Gibali, and S. Sagratella, “Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces,” Journal of Optimization Theory and Applications, vol. 184. Springer Nature, pp. 877–894, 2020.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Published Version] View | Files available | DOI | arXiv
 

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. Springer, 2019.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2019 | Journal Article | IST-REx-ID: 7000 | OA
Y. Shehu, O. S. Iyiola, X.-H. Li, and Q.-L. Dong, “Convergence analysis of projection method for variational inequalities,” Computational and Applied Mathematics, vol. 38, no. 4. Springer Nature, 2019.
[Published Version] View | DOI | Download Published Version (ext.) | WoS | arXiv
 

2019 | Journal Article | IST-REx-ID: 7412 | OA
D. Achlioptas, F. Iliopoulos, and V. Kolmogorov, “A local lemma for focused stochastical algorithms,” SIAM Journal on Computing, vol. 48, no. 5. SIAM, pp. 1583–1602, 2019.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7468 | OA
P. Swoboda and V. Kolmogorov, “Map inference via block-coordinate Frank-Wolfe algorithm,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Long Beach, CA, United States, 2019, vol. 2019–June.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7639
A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in Proceedings of the 2019 International Conference on Computer Vision Workshop, Seoul, South Korea, 2019.
View | DOI | WoS
 

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. IEEE, pp. 1668–1682, 2018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Book Chapter | IST-REx-ID: 10864 | OA
A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson terms,” in Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018, pp. 203–220.
[Preprint] View | DOI | Download Preprint (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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | 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.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

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. Society for Industrial & Applied Mathematics (SIAM), pp. 2029–2056, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Conference Paper | IST-REx-ID: 5978 | OA
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.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 

2018 | Journal Article | IST-REx-ID: 18 | OA
V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 

2018 | 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. ACM, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | 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.” Institute of Science and Technology Austria, 2018.
[Published Version] 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 | 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. SIAM, pp. 1087–1110, 2017.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Thesis | IST-REx-ID: 992 | OA
M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science and Technology Austria, 2017.
[Published Version] 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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Conference Paper | IST-REx-ID: 274 | OA
V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,” in Proceedings of the 31st Conference On Learning Theory, 2017, vol. 75, pp. 228–249.
[Published Version] View | Files available | arXiv
 

2017 | Research Data | IST-REx-ID: 5561 | OA
D. Kainmueller, F. Jug, C. Rother, and G. Meyers, “Graph matching problems for annotating C. Elegans.” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1231 | OA
J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2016 | Journal Article | IST-REx-ID: 1353 | OA
L. Barto and A. Kazda, “Deciding absorption,” International Journal of Algebra and Computation, vol. 26, no. 5. World Scientific Publishing, pp. 1033–1060, 2016.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1377 | OA
V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM Journal on Imaging Sciences, vol. 9, no. 2. Society for Industrial and Applied Mathematics , pp. 605–636, 2016.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1612 | OA
A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1. Springer, pp. 75–84, 2016.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1193 | OA
V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, NJ, USA , 2016, vol. 2016–December.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2016 | Journal Article | IST-REx-ID: 1794 | OA
V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” Algorithmica, vol. 76, no. 1. Springer, pp. 17–46, 2016.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2016 | Research Data | IST-REx-ID: 5557 | OA
P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science and Technology Austria, 2016.
[Published Version] View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1636 | OA
V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” in 26th International Symposium, Nagoya, Japan, 2015, vol. 9472, pp. 566–577.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Journal Article | IST-REx-ID: 1841 | OA
V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5. IEEE, pp. 919–930, 2015.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1859 | OA
N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 2737–2745.
[Preprint] View | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 2271 | OA
V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1. SIAM, pp. 1–36, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1637 | OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1675 | OA
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” in 35th Annual Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 585–605.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2275 | OA
C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.
[Submitted Version] View | Files available | DOI
 

2014 | Working Paper | IST-REx-ID: 7038 | OA
K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical games. IST Austria.
[Published Version] View | Files available
 

2013 | Conference Paper | IST-REx-ID: 2270 | OA
Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.
View | Download None (ext.) | arXiv
 

2013 | Report | IST-REx-ID: 2273 | OA
V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.
View | Download (ext.)
 

2013 | Conference Paper | IST-REx-ID: 2276 | OA
I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 2518 | OA
V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2828 | OA
V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” Journal of the ACM, vol. 60, no. 2. ACM, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 2901 | OA
C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the M most probable modes of a graphical model,” presented at the AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States, 2013, vol. 31, pp. 161–169.
View | Download None (ext.)
 

2013 | Conference Paper | IST-REx-ID: 2272 | OA
R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs on sequence data,” in ICML’13 Proceedings of the 30th International Conference on International, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153.
[Submitted Version] View | Files available | Download Submitted Version (ext.)
 

2013 | Report | IST-REx-ID: 2274 | OA
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of Space. IST Austria, 2013.
[Published Version] View | Files available
 

2012 | Conference Paper | IST-REx-ID: 2930 | OA
A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.
[Preprint] View | DOI | Download Preprint (ext.)
 

2012 | Preprint | IST-REx-ID: 2928 | OA
V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” arXiv. ArXiv, 2012.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2012 | Journal Article | IST-REx-ID: 2931
L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2. IEEE, pp. 259–271, 2012.
View | DOI
 

2012 | Journal Article | IST-REx-ID: 3117 | OA
V. Kolmogorov, “Minimizing a sum of submodular functions,” Discrete Applied Mathematics, vol. 160, no. 15. Elsevier, pp. 2246–2258, 2012.
[Preprint] View | DOI | Download Preprint (ext.)
 

2012 | Journal Article | IST-REx-ID: 3257 | OA
V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” Discrete Applied Mathematics, vol. 160, no. 4–5. Elsevier, pp. 416–426, 2012.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 3124 | OA
F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete energy minimization,” presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland, 2012.
[Submitted Version] View | Files available
 

2012 | Technical Report | IST-REx-ID: 5396 | OA
F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=VlKo

Search

Filter Publications