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.




60 Publications

2017 | Conference Paper | IST-REx-ID: 915 | OA
P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 916 | OA
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, and B. Savchynskyy, “A study of lagrangean decompositions and dual ascent solvers for graph matching,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 7062–7071.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917 | OA
P. Swoboda, J. Kuske, and B. Savchynskyy, “A dual ascent framework for Lagrangean decomposition of combinatorial problems,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4950–4960.
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992 | OA
M. Rolinek, Complexity of constraint satisfaction. IST Austria, 2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1192 | OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.
View | Files available | DOI | Download Submitted Version (ext.)
 
2016 | Research Data | IST-REx-ID: 5557 | OA
P. Swoboda, Synthetic discrete tomography problems. IST Austria, 2016.
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1612 | OA
A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1, pp. 75–84, 2016.
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1794 | OA
V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” Algorithmica, vol. 76, no. 1, pp. 17–46, 2016.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1193 | OA
V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, NJ, USA , 2016, vol. 2016–December, p. 7782993.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1231 | OA
J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
View | DOI | Download Submitted Version (ext.)
 
2016 | Journal Article | IST-REx-ID: 1353 | OA
L. Barto and A. Kazda, “Deciding absorption,” International Journal of Algebra and Computation, vol. 26, no. 5, pp. 1033–1060, 2016.
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1377 | OA
V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM Journal on Imaging Sciences, vol. 9, no. 2, pp. 605–636, 2016.
View | DOI | Download Preprint (ext.)
 
2015 | Journal Article | IST-REx-ID: 2271 | OA
V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1, pp. 1–36, 2015.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2015 | Conference Paper | IST-REx-ID: 1636 | OA
V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” vol. 9472. Springer, pp. 566–577, 2015.
View | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1637 | OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.
View | Files available | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1675
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” vol. 9216. Springer, pp. 585–605, 2015.
View | Files available | DOI
 
2015 | Journal Article | IST-REx-ID: 1841 | OA
V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, pp. 919–930, 2015.
View | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1859 | OA
N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 2737–2745.
View | DOI | Download Preprint (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2275 | OA
C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.
View | Files available | DOI
 
2014 | Working Paper | IST-REx-ID: 7038 | OA
K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical games. IST Austria.
View | Files available
 
2013 | Conference Paper | IST-REx-ID: 2270 | OA
Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.
View | Download None (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2272 | OA
R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs on sequence data,” in ICML’13 Proceedings of the 30th International Conference on International, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153.
View | Files available | Download Submitted Version (ext.)
 
2013 | Report | IST-REx-ID: 2273 | OA
V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.
View | Download (ext.)
 
2013 | Report | IST-REx-ID: 2274 | OA
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of Space. IST Austria, 2013.
View | Files available
 
2013 | Conference Paper | IST-REx-ID: 2276 | OA
I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.
View | DOI | Download Preprint (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2518 | OA
V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2828 | OA
V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” Journal of the ACM, vol. 60, no. 2, 2013.
View | DOI | Download Preprint (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2901 | OA
C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the M most probable modes of a graphical model,” presented at the AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States, 2013, vol. 31, pp. 161–169.
View | Download None (ext.)
 
2012 | Technical Report | IST-REx-ID: 5396 | OA
F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012.
View | Files available | DOI
 
2012 | Preprint | IST-REx-ID: 2928 | OA
V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” arXiv. ArXiv, 2012.
View | Download Preprint (ext.) | arXiv
 
2012 | Conference Paper | IST-REx-ID: 2930 | OA
A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.
View | DOI | Download Preprint (ext.)
 
2012 | Journal Article | IST-REx-ID: 2931
L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, pp. 259–271, 2012.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3117 | OA
V. Kolmogorov, “Minimizing a sum of submodular functions,” Discrete Applied Mathematics, vol. 160, no. 15, pp. 2246–2258, 2012.
View | DOI | Download Preprint (ext.)
 
2012 | Conference Paper | IST-REx-ID: 3124 | OA
F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete energy minimization,” presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland, 2012.
View | Files available
 
2012 | Journal Article | IST-REx-ID: 3257 | OA
V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” Discrete Applied Mathematics, vol. 160, no. 4–5, pp. 416–426, 2012.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Display / Sort

Citation Style: IEEE

Export / Embed