Alhaija, H., Sellent, A., Kondermann, D., &; Rother, C. (2018). Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:82 
LibreCat: https://research-explorer.ista.ac.at/record/5573
DOI: 10.15479/AT:ISTA:82

Trajkovska, V., Swoboda, P., Åström, F., &; Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, &; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer.https://doi.org/10.1007/978-3-319-58771-4_26 
LibreCat: https://research-explorer.ista.ac.at/record/641
DOI: 10.1007/978-3-319-58771-4_26

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

Kuske, J., Swoboda, P., &; Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, &; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer.https://doi.org/10.1007/978-3-319-58771-4_19 
LibreCat: https://research-explorer.ista.ac.at/record/646
DOI: 10.1007/978-3-319-58771-4_19

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

Kazda, A., Kolmogorov, V., &; Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM.https://doi.org/10.1137/1.9781611974782.20 
LibreCat: https://research-explorer.ista.ac.at/record/1192
DOI: 10.1137/1.9781611974782.20
WoS: 000426965800020

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

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 
LibreCat: https://research-explorer.ista.ac.at/record/915
DOI: 10.1109/CVPR.2017.530
WoS: 000418371405009

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 
LibreCat: https://research-explorer.ista.ac.at/record/917
DOI: 10.1109/CVPR.2017.526
WoS: 000418371405005

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

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 
LibreCat: https://research-explorer.ista.ac.at/record/5561
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1353
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1377
DOI: 10.1137/15M1010257

Kazda, A. (2016). CSP for binary conservative relational structures. Algebra Universalis. Springer.https://doi.org/10.1007/s00012-015-0358-8 
LibreCat: https://research-explorer.ista.ac.at/record/1612
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1193
DOI: 10.1109/FOCS.2016.88
arXiv: 1506.08547

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 
LibreCat: https://research-explorer.ista.ac.at/record/1794
DOI: 10.1007/s00453-015-0017-7
arXiv: 1210.0508

Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:46 
LibreCat: https://research-explorer.ista.ac.at/record/5557
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1636
DOI: 10.1007/978-3-662-48971-0_48
arXiv: 1504.07067

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 
LibreCat: https://research-explorer.ista.ac.at/record/1841
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1859
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2271
DOI: 10.1137/130945648
arXiv: 1311.4219

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 
LibreCat: https://research-explorer.ista.ac.at/record/1637
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1675
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2275
DOI: 10.1109/ICCV.2013.365

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

Bachrach, Y., Kohli, P., Kolmogorov, V., &; Zadimoghaddam, M. (2013). Optimal Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI Press.
LibreCat: https://research-explorer.ista.ac.at/record/2270
arXiv: 1108.5248

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

Gridchyn, I., &; Kolmogorov, V. (2013). Potts model, parametric maxflow and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE.https://doi.org/10.1109/ICCV.2013.288 
LibreCat: https://research-explorer.ista.ac.at/record/2276
DOI: 10.1109/ICCV.2013.288
arXiv: 1310.1771

Kolmogorov, V. (2013). The power of linear programming for finite-valued CSPs: A constructive characterization (Vol. 7965, pp. 625–636). Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer.https://doi.org/10.1007/978-3-642-39206-1_53 
LibreCat: https://research-explorer.ista.ac.at/record/2518
DOI: 10.1007/978-3-642-39206-1_53
arXiv: 1207.7213

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

Chen, C., Kolmogorov, V., Yan, Z., Metaxas, D., &; Lampert, C. (2013). Computing the M most probable modes of a graphical model (Vol. 31, pp. 161–169). Presented at the  AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States: JMLR.
LibreCat: https://research-explorer.ista.ac.at/record/2901

Takhanov, R., &; Kolmogorov, V. (2013). Inference algorithms for pattern-based CRFs on sequence data. In ICML’13 Proceedings of the 30th International Conference on International (Vol. 28, pp. 145–153). Atlanta, GA, USA: ML Research Press.
LibreCat: https://research-explorer.ista.ac.at/record/2272

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

Huber, A., &; Kolmogorov, V. (2012). Towards minimizing k-submodular functions (Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece: Springer.https://doi.org/10.1007/978-3-642-32147-4_40 
LibreCat: https://research-explorer.ista.ac.at/record/2930
DOI: 10.1007/978-3-642-32147-4_40

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

Torresani, L., Kolmogorov, V., &; Rother, C. (2012). A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE.https://doi.org/10.1109/TPAMI.2012.105 
LibreCat: https://research-explorer.ista.ac.at/record/2931
DOI: 10.1109/TPAMI.2012.105

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

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

Korc, F., Kolmogorov, V., &; Lampert, C. (2012). Approximating marginals using discrete energy minimization. Presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland: ICML.
LibreCat: https://research-explorer.ista.ac.at/record/3124

Korc, F., Kolmogorov, V., &; Lampert, C. (2012). Approximating marginals using discrete energy minimization. IST Austria.https://doi.org/10.15479/AT:IST-2012-0003 
LibreCat: https://research-explorer.ista.ac.at/record/5396
DOI: 10.15479/AT:IST-2012-0003