Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., &; Savchynskyy, B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE.https://doi.org/10.1109/CVPR.2017.747 

Swoboda, P., &; Andres, B. (2017). A message passing algorithm for the minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE.https://doi.org/10.1109/CVPR.2017.530 

Swoboda, P., Kuske, J., &; Savchynskyy, B. (2017). A dual ascent framework for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE.https://doi.org/10.1109/CVPR.2017.526 

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

Kainmueller, D., Jug, F., Rother, C., &; Meyers, G. (2017). Graph matching problems for annotating C. Elegans. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:57 

Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., &; Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-662-49896-5_13 

Barto, L., &; Kazda, A. (2016). Deciding absorption. International Journal of Algebra and Computation. World Scientific Publishing.https://doi.org/10.1142/S0218196716500430 

Kolmogorov, V., Pock, T., &; Rolinek, M. (2016). Total variation on a tree. SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics .https://doi.org/10.1137/15M1010257 

Kazda, A. (2016). CSP for binary conservative relational structures. Algebra Universalis. Springer.https://doi.org/10.1007/s00012-015-0358-8 

Kolmogorov, V. (2016). Commutativity in the algorithmic Lovasz local lemma. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science (Vol. 2016–December). New Brunswick, NJ, USA : IEEE.https://doi.org/10.1109/FOCS.2016.88 

Kolmogorov, V., &; Takhanov, R. (2016). Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. Springer.https://doi.org/10.1007/s00453-015-0017-7 

Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:46 

Kolmogorov, V., Rolinek, M., &; Takhanov, R. (2015). Effectiveness of structural restrictions for hybrid CSPs. In 26th International Symposium (Vol. 9472, pp. 566–577). Nagoya, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-48971-0_48 

Kolmogorov, V. (2015). A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE.https://doi.org/10.1109/TPAMI.2014.2363465 

Shah, N., Kolmogorov, V., &; Lampert, C. (2015). A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle (pp. 2737–2745). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE.https://doi.org/10.1109/CVPR.2015.7298890 

Kolmogorov, V., Thapper, J., &; divný, S. (2015). The power of linear programming for general-valued CSPs. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/130945648 

Kolmogorov, V., Krokhin, A., &; Rolinek, M. (2015). The complexity of general-valued CSPs (pp. 1246–1258). Presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States: IEEE.https://doi.org/10.1109/FOCS.2015.80 

Dziembowski, S., Faust, S., Kolmogorov, V., &; Pietrzak, K. Z. (2015). Proofs of space. In 35th Annual Cryptology Conference (Vol. 9216, pp. 585–605). Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-662-48000-7_29 

Olsson, C., Ulen, J., Boykov, Y., &; Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE.https://doi.org/10.1109/ICCV.2013.365 

Huszár, K., &; Rolinek, M. (n.d.). Playful Math - An introduction to mathematical games. IST Austria.