Combining pattern-based CRFs and weighted context-free grammars
R. Takhanov, V. Kolmogorov, Intelligent Data Analysis 26 (2022) 257–272.

Reflected three-operator splitting method for monotone inclusion problem
O.S. Iyiola, C.D. Enyi, Y. Shehu, Optimization Methods and Software 37 (2022) 1527–1565.

Convergence analysis of new inertial method for the split common null point problem
F.U. Ogbuisi, Y. Shehu, J.C. Yao, Optimization 71 (2022) 3767–3795.

Weak convergence for variational inequalities with inertial-type method
Y. Shehu, O.S. Iyiola, Applicable Analysis 101 (2022) 192–216.

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.

One-sided Frank-Wolfe algorithms for saddle problems
V. Kolmogorov, T. Pock, in:, 38th International Conference on Machine Learning, 2021.

New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity
C. Izuchukwu, Y. Shehu, Networks and Spatial Economics 21 (2021) 291–323.

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.

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.

New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert spaces with applications
O.S. Iyiola, Y. Shehu, Results in Mathematics 76 (2021).

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 22 (2021) 2627–2653.

New inertial relaxed method for solving split feasibilities
Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126.

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, CCCG, 2021.

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.

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.

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.

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.

Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces
Y. Shehu, Results in Mathematics 74 (2019).

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).

A local lemma for focused stochastical algorithms
D. Achlioptas, F. Iliopoulos, V. Kolmogorov, SIAM Journal on Computing 48 (2019) 1583–1602.

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.

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.

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.

Absorption and directed Jónsson terms
A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, Springer Nature, Cham, 2018, pp. 203–220.

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.

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.

Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.

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 Press, 2018, pp. 6581–6588.

Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.

Even delta-matroids and the complexity of planar boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).

Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow
H. Alhaija, A. Sellent, D. Kondermann, C. Rother, (2018).

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.

The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.

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.

Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.

Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.

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.

A message passing algorithm for the minimum cost multicut problem
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.

A dual ascent framework for Lagrangean decomposition of combinatorial problems
P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.

A faster approximation algorithm for the Gibbs partition function
V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory, ML Research Press, 2017, pp. 228–249.

Graph matching problems for annotating C. Elegans
D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).

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.

Deciding absorption
L. Barto, A. Kazda, International Journal of Algebra and Computation 26 (2016) 1033–1060.

Total variation on a tree
V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016) 605–636.

CSP for binary conservative relational structures
A. Kazda, Algebra Universalis 75 (2016) 75–84.

Commutativity in the algorithmic Lovasz local lemma
V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.

Inference algorithms for pattern-based CRFs on sequence data
V. Kolmogorov, R. Takhanov, Algorithmica 76 (2016) 17–46.

Synthetic discrete tomography problems
P. Swoboda, (2016).

Effectiveness of structural restrictions for hybrid CSPs
V. Kolmogorov, M. Rolinek, R. Takhanov, in:, 26th International Symposium, Springer Nature, 2015, pp. 566–577.

A new look at reweighted message passing
V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 919–930.

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.

The power of linear programming for general-valued CSPs
V. Kolmogorov, J. Thapper, S. divný, SIAM Journal on Computing 44 (2015) 1–36.

The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, in:, IEEE, 2015, pp. 1246–1258.

Proofs of space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, in:, 35th Annual Cryptology Conference, Springer, 2015, pp. 585–605.

Partial enumeration and curvature regularization
C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.

Playful Math - An introduction to mathematical games
K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.

Optimal Coalition Structures in Cooperative Graph Games
Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87.

Reweighted message passing revisited
V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.

Potts model, parametric maxflow and k-submodular functions
I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.

The power of linear programming for finite-valued CSPs: A constructive characterization
V. Kolmogorov, in:, Springer, 2013, pp. 625–636.

The complexity of conservative valued CSPs
V. Kolmogorov, S. divný, Journal of the ACM 60 (2013).

Computing the M most probable modes of a graphical model
C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, C. Lampert, in:, JMLR, 2013, pp. 161–169.

Inference algorithms for pattern-based CRFs on sequence data
R. Takhanov, V. Kolmogorov, in:, ICML’13 Proceedings of the 30th International Conference on International, ML Research Press, 2013, pp. 145–153.

Proofs of Space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space, IST Austria, 2013.

Towards minimizing k-submodular functions
A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.

Generalized sequential tree-reweighted message passing
V. Kolmogorov, T. Schoenemann, ArXiv (2012).

A dual decomposition approach to feature correspondence
L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2012) 259–271.

Minimizing a sum of submodular functions
V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258.

Generalized roof duality and bisubmodular functions
V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.

Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, in:, ICML, 2012.

Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.