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