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.

69 Publications


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

2021 | Journal Article | IST-REx-ID: 9315 View | DOI
 

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

2021 | Journal Article | IST-REx-ID: 8817
An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems
Y. Shehu, O.S. Iyiola, D.V. Thong, N.T.C. Van, Mathematical Methods of Operations Research 93 (2021) 213–242.
View | DOI
 

2021 | Journal Article | IST-REx-ID: 9234 | OA
New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity
C. Izuchukwu, Y. Shehu, Networks and Spatial Economics 21 (2021) 291–323.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 9592 | OA
Massively winning configurations in the convex grabbing game on the plane
M. Dvorak, S. Nicholson, in:, Proceedings of the 33rd Canadian Conference on Computational Geometry, n.d.
View | Files available | arXiv
 

2021 | Preprint | IST-REx-ID: 10045 | OA
Generalized minimum 0-extension problem and discrete convexity
M. Dvorak, V. Kolmogorov, ArXiv (n.d.).
View | Files available | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10072 | OA
A new notion of commutativity for the algorithmic Lovász Local Lemma
D.G. Harris, F. Iliopoulos, V. Kolmogorov, in:, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 

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

2020 | Journal Article | IST-REx-ID: 8077 | OA
Projection methods with alternating inertial steps for variational inequalities: Weak and linear convergence
Y. Shehu, O.S. Iyiola, Applied Numerical Mathematics 157 (2020) 315–337.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 8196 | OA
New strong convergence method for the sum of two maximal monotone operators
Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering (2020).
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 7925 | OA
New inertial relaxed method for solving split feasibilities
Y. Shehu, A. Gibali, Optimization Letters (2020).
View | DOI | Download Published Version (ext.)
 

2020 | Journal Article | IST-REx-ID: 6593 | OA
An efficient projection-type method for monotone variational inequalities in Hilbert spaces
Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 7161 | OA
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 184 (2020) 877–894.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 7577 | OA
Weak convergence for variational inequalities with inertial-type method
Y. Shehu, O.S. Iyiola, Applicable Analysis (n.d.) 1–25.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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

2019 | Conference Paper | IST-REx-ID: 7468 | OA
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.
View | DOI | Download Preprint (ext.) | arXiv
 

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

2019 | Journal Article | IST-REx-ID: 6596 | OA View | Files available | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6725 | OA
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
 

2019 | Journal Article | IST-REx-ID: 7000 | OA
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 | Download Published Version (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 273 | OA
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 Preprint (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 18 | OA
Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
View | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 193 | OA
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 Submitted Version (ext.)
 

2018 | Research Data | IST-REx-ID: 5573 | OA
Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow
H. Alhaija, A. Sellent, D. Kondermann, C. Rother, (2018).
View | Files available | DOI
 

2018 | Journal Article | IST-REx-ID: 5975 | OA
Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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

2018 | Journal Article | IST-REx-ID: 6032 | OA
Even delta-matroids and the complexity of planar boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 703 | OA
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 Preprint (ext.) | arXiv
 

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

2017 | Research Data | IST-REx-ID: 5561 | OA
Graph matching problems for annotating C. Elegans
D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 641
Graphical model parameter learning by inverse linear programming
V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.
View | DOI
 

2017 | Journal Article | IST-REx-ID: 644 | OA
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 Preprint (ext.)
 

2017 | Conference Paper | IST-REx-ID: 646 | OA
A novel convex relaxation for non binary discrete tomography
J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.
View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 1192 | OA
Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
View | Files available | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 915 | OA
A message passing algorithm for the minimum cost multicut problem
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 916 | OA
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
 

2017 | Conference Paper | IST-REx-ID: 917 | OA
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
 

2017 | Thesis | IST-REx-ID: 992 | OA
Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, IST Austria, 2017.
View | Files available | DOI
 

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

2016 | Research Data | IST-REx-ID: 5557 | OA View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1353 | OA
Deciding absorption
L. Barto, A. Kazda, International Journal of Algebra and Computation 26 (2016) 1033–1060.
View | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1377 | OA
Total variation on a tree
V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016) 605–636.
View | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1612 | OA
CSP for binary conservative relational structures
A. Kazda, Algebra Universalis 75 (2016) 75–84.
View | DOI | Download Preprint (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1193 | OA
Commutativity in the algorithmic Lovasz local lemma
V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2016 | Conference Paper | IST-REx-ID: 1231 | OA
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
View | DOI | Download Submitted Version (ext.)
 

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

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

2015 | Conference Paper | IST-REx-ID: 1859 | OA
A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle
N. Shah, V. Kolmogorov, C. Lampert, in:, IEEE, 2015, pp. 2737–2745.
View | DOI | Download Preprint (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1636 | OA
Effectiveness of structural restrictions for hybrid CSPs
V. Kolmogorov, M. Rolinek, R. Takhanov, 9472 (2015) 566–577.
View | DOI | Download Preprint (ext.)
 

Filters and Search Terms

department=VlKo

Search

Filter Publications