The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.
LibreCat: https://research-explorer.ista.ac.at/record/644
DOI: 10.1137/16M1091836

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.
LibreCat: https://research-explorer.ista.ac.at/record/646
DOI: 10.1007/978-3-319-58771-4_19

Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/992
DOI: 10.15479/AT:ISTA:th_815

Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
LibreCat: https://research-explorer.ista.ac.at/record/1192
DOI: 10.1137/1.9781611974782.20
WoS: 000426965800020

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.
LibreCat: https://research-explorer.ista.ac.at/record/916
DOI: 10.1109/CVPR.2017.747
WoS: 000418371407018

A message passing algorithm for the minimum cost multicut problem
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
LibreCat: https://research-explorer.ista.ac.at/record/915
DOI: 10.1109/CVPR.2017.530
WoS: 000418371405009

A dual ascent framework for Lagrangean decomposition of combinatorial problems
P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.
LibreCat: https://research-explorer.ista.ac.at/record/917
DOI: 10.1109/CVPR.2017.526
WoS: 000418371405005

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.
LibreCat: https://research-explorer.ista.ac.at/record/274
arXiv: 1608.04223

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.
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 10.1007/978-3-662-49896-5_13

Deciding absorption
L. Barto, A. Kazda, International Journal of Algebra and Computation 26 (2016) 1033–1060.
LibreCat: https://research-explorer.ista.ac.at/record/1353
DOI: 10.1142/S0218196716500430

Total variation on a tree
V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016) 605–636.
LibreCat: https://research-explorer.ista.ac.at/record/1377
DOI: 10.1137/15M1010257

CSP for binary conservative relational structures
A. Kazda, Algebra Universalis 75 (2016) 75–84.
LibreCat: https://research-explorer.ista.ac.at/record/1612
DOI: 10.1007/s00012-015-0358-8

Commutativity in the algorithmic Lovasz local lemma
V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1193
DOI: 10.1109/FOCS.2016.88
arXiv: 1506.08547

Inference algorithms for pattern-based CRFs on sequence data
V. Kolmogorov, R. Takhanov, Algorithmica 76 (2016) 17–46.
LibreCat: https://research-explorer.ista.ac.at/record/1794
DOI: 10.1007/s00453-015-0017-7
arXiv: 1210.0508

Effectiveness of structural restrictions for hybrid CSPs
V. Kolmogorov, M. Rolinek, R. Takhanov, in:, 26th International Symposium, Springer Nature, 2015, pp. 566–577.
LibreCat: https://research-explorer.ista.ac.at/record/1636
DOI: 10.1007/978-3-662-48971-0_48
arXiv: 1504.07067

A new look at reweighted message passing
V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 919–930.
LibreCat: https://research-explorer.ista.ac.at/record/1841
DOI: 10.1109/TPAMI.2014.2363465

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.
LibreCat: https://research-explorer.ista.ac.at/record/1859
DOI: 10.1109/CVPR.2015.7298890

The power of linear programming for general-valued CSPs
V. Kolmogorov, J. Thapper, S. divný, SIAM Journal on Computing 44 (2015) 1–36.
LibreCat: https://research-explorer.ista.ac.at/record/2271
DOI: 10.1137/130945648
arXiv: 1311.4219

The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, in:, IEEE, 2015, pp. 1246–1258.
LibreCat: https://research-explorer.ista.ac.at/record/1637
DOI: 10.1109/FOCS.2015.80

Proofs of space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, in:, 35th Annual Cryptology Conference, Springer, 2015, pp. 585–605.
LibreCat: https://research-explorer.ista.ac.at/record/1675
DOI: 10.1007/978-3-662-48000-7_29

Partial enumeration and curvature regularization
C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.
LibreCat: https://research-explorer.ista.ac.at/record/2275
DOI: 10.1109/ICCV.2013.365

Playful Math - An introduction to mathematical games
K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.
LibreCat: https://research-explorer.ista.ac.at/record/7038

Optimal Coalition Structures in Cooperative Graph Games
Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87.
LibreCat: https://research-explorer.ista.ac.at/record/2270
arXiv: 1108.5248

Reweighted message passing revisited
V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2273

Potts model, parametric maxflow and k-submodular functions
I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.
LibreCat: https://research-explorer.ista.ac.at/record/2276
DOI: 10.1109/ICCV.2013.288
arXiv: 1310.1771

The power of linear programming for finite-valued CSPs: A constructive characterization
V. Kolmogorov, in:, Springer, 2013, pp. 625–636.
LibreCat: https://research-explorer.ista.ac.at/record/2518
DOI: 10.1007/978-3-642-39206-1_53
arXiv: 1207.7213

The complexity of conservative valued CSPs
V. Kolmogorov, S. divný, Journal of the ACM 60 (2013).
LibreCat: https://research-explorer.ista.ac.at/record/2828
DOI: 10.1145/2450142.2450146
arXiv: 1110.2809

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.
LibreCat: https://research-explorer.ista.ac.at/record/2901

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.
LibreCat: https://research-explorer.ista.ac.at/record/2272

Proofs of Space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2274

Towards minimizing k-submodular functions
A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.
LibreCat: https://research-explorer.ista.ac.at/record/2930
DOI: 10.1007/978-3-642-32147-4_40

Generalized sequential tree-reweighted message passing
V. Kolmogorov, T. Schoenemann, ArXiv (2012).
LibreCat: https://research-explorer.ista.ac.at/record/2928
arXiv: 1205.6352

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.
LibreCat: https://research-explorer.ista.ac.at/record/2931
DOI: 10.1109/TPAMI.2012.105

Minimizing a sum of submodular functions
V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258.
LibreCat: https://research-explorer.ista.ac.at/record/3117
DOI: 10.1016/j.dam.2012.05.025

Generalized roof duality and bisubmodular functions
V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.
LibreCat: https://research-explorer.ista.ac.at/record/3257
DOI: 10.1016/j.dam.2011.10.026
arXiv: 1005.2305

Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, in:, ICML, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3124

Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/5396
DOI: 10.15479/AT:IST-2012-0003