Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

66 Publications


2018 | Conference Paper | IST-REx-ID: 193 | OA
J. F. Alwen et al., “On the memory hardness of data independent password hashing functions,” in Proceedings of the 2018 on Asia Conference on Computer and Communication Security, Incheon, Republic of Korea, 2018, pp. 51–65.
View | DOI | Download Submitted Version (ext.)
 

2018 | Research Data | IST-REx-ID: 5573 | OA
H. Alhaija, A. Sellent, D. Kondermann, and C. Rother, “Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow.” IST Austria, 2018.
View | Files available | DOI
 

2018 | Journal Article | IST-REx-ID: 5975 | OA
V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM Journal on Computing, vol. 47, no. 6. Society for Industrial & Applied Mathematics (SIAM), pp. 2029–2056, 2018.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 5978 | OA
S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining combinatorial search with LP relaxation,” in Proceedings of the 32st AAAI Conference on Artificial Intelligence, New Orleans, LU, United States, 2018, pp. 6581–6588.
View | Download Preprint (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 6032 | OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2. ACM, 2018.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 703 | OA
A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.
View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 274 | OA
V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,” in Proceedings of the 31st Conference On Learning Theory, 2017, vol. 75, pp. 228–249.
View | Files available | arXiv
 

2017 | Research Data | IST-REx-ID: 5561 | OA
D. Kainmueller, F. Jug, C. Rother, and G. Meyers, “Graph matching problems for annotating C. Elegans.” IST Austria, 2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 641
V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.
View | DOI
 

2017 | Journal Article | IST-REx-ID: 644 | OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017.
View | Files available | DOI | Download Preprint (ext.)
 

2017 | Conference Paper | IST-REx-ID: 646 | OA
J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.
View | DOI | Download Submitted Version (ext.)
 

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.)
 

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
 

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. Springer, pp. 17–46, 2016.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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: 1353 | OA
L. Barto and A. Kazda, “Deciding absorption,” International Journal of Algebra and Computation, vol. 26, no. 5. World Scientific Publishing, 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. Society for Industrial and Applied Mathematics , pp. 605–636, 2016.
View | DOI | Download Preprint (ext.)
 

Filters and Search Terms

department=VlKo

Search

Filter Publications