Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
74 Publications
2017 | Research Data | IST-REx-ID: 5561 | 
Kainmueller, D., Jug, F., Rother, C., & Meyers, G. (2017). Graph matching problems for annotating C. Elegans. IST Austria. https://doi.org/10.15479/AT:ISTA:57
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 641
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
View
| DOI
2017 | Journal Article | IST-REx-ID: 644 |
Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836
View
| Files available
| DOI
| Download Preprint (ext.)
2017 | Conference Paper | IST-REx-ID: 646 |
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
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 916 |
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
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 915 |
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
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 917 |
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
View
| Files available
| DOI
2017 | Thesis | IST-REx-ID: 992 |
Rolinek, M. (2017). Complexity of constraint satisfaction. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 1192 |
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
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2016 | Conference Paper | IST-REx-ID: 1231 |
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
View
| DOI
| Download Submitted Version (ext.)
2016 | Journal Article | IST-REx-ID: 1353 |
Barto, L., & Kazda, A. (2016). Deciding absorption. International Journal of Algebra and Computation. World Scientific Publishing. https://doi.org/10.1142/S0218196716500430
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1377 |
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
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1612 |
Kazda, A. (2016). CSP for binary conservative relational structures. Algebra Universalis. Springer. https://doi.org/10.1007/s00012-015-0358-8
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1794 |
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
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Research Data | IST-REx-ID: 5557 |
Swoboda, P. (2016). Synthetic discrete tomography problems. IST Austria. https://doi.org/10.15479/AT:ISTA:46
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1193 |
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
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 1636 |
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
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Journal Article | IST-REx-ID: 1841 |
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
View
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1859 |
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
View
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2015). Proofs of space. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_29
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 2271 |
Kolmogorov, V., Thapper, J., & Živný, S. (2015). The power of linear programming for general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/130945648
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 1637 |
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
View
| Files available
| DOI
| Download Preprint (ext.)
2014 | Conference Paper | IST-REx-ID: 2275 |
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
View
| Files available
| DOI
2014 | Working Paper | IST-REx-ID: 7038 |
Huszár, K., & Rolinek, M. (n.d.). Playful Math - An introduction to mathematical games. IST Austria.
View
| Files available
2013 | Conference Paper | IST-REx-ID: 2272 |
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: International Machine Learning Society.
View
| Files available
| Download Submitted Version (ext.)
2013 | Conference Paper | IST-REx-ID: 2270 |
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.
View
| Download None (ext.)
| arXiv
2013 | Report | IST-REx-ID: 2274 |
Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2013). Proofs of Space. IST Austria.
View
| Files available
2013 | Report | IST-REx-ID: 2273 |
Kolmogorov, V. (2013). Reweighted message passing revisited. IST Austria.
View
| Download (ext.)
2013 | Conference Paper | IST-REx-ID: 2276 |
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
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 2518 |
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
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Journal Article | IST-REx-ID: 2828 |
Kolmogorov, V., & Živný, S. (2013). The complexity of conservative valued CSPs. Journal of the ACM. ACM. https://doi.org/10.1145/2450142.2450146
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 2901 |
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.
View
| Download None (ext.)
2012 | Conference Paper | IST-REx-ID: 2930 |
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
View
| DOI
| Download Preprint (ext.)
2012 | Preprint | IST-REx-ID: 2928 |
Kolmogorov, V., & Schoenemann, T. (2012). Generalized sequential tree-reweighted message passing. arXiv. ArXiv.
View
| Download Preprint (ext.)
| arXiv
2012 | Journal Article | IST-REx-ID: 2931
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
View
| DOI
2012 | Journal Article | IST-REx-ID: 3117 |
Kolmogorov, V. (2012). Minimizing a sum of submodular functions. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2012.05.025
View
| DOI
| Download Preprint (ext.)
2012 | Journal Article | IST-REx-ID: 3257 |
Kolmogorov, V. (2012). Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2011.10.026
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 3124 |
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.
View
| Files available
2012 | Technical Report | IST-REx-ID: 5396 |
Korc, F., Kolmogorov, V., & Lampert, C. (2012). Approximating marginals using discrete energy minimization. IST Austria. https://doi.org/10.15479/AT:IST-2012-0003
View
| Files available
| DOI