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.

Jeferson Zapata

Vladimir Kolmogorov

Mikhail Karapetyants

Pavel Arkhipov

Ivan Sergeev

Martin Dvorak

Alexandr Kazda

Michal Rolinek

Neel Shah

Paul Swoboda

Yekini Shehu

Nasim Samei

Rustem Takhanov

Senanayak Karri



76 Publications

2018 | Published | Journal Article | IST-REx-ID: 703 | OA
Maximum persistency via iterative relaxed inference with graphical models
A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 915 | OA
A message passing algorithm for the minimum cost multicut problem
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 916 | OA
A study of lagrangean decompositions and dual ascent solvers for graph matching
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 917 | OA
A dual ascent framework for Lagrangean decomposition of combinatorial problems
P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 1192 | OA
Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 274 | OA
A faster approximation algorithm for the Gibbs partition function
V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory, ML Research Press, 2017, pp. 228–249.
[Published Version] View | Files available | arXiv
 
2017 | Research Data | IST-REx-ID: 5561 | OA
Graph matching problems for annotating C. Elegans
D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 641
Graphical model parameter learning by inverse linear programming
V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.
View | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 644 | OA
The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2017 | Published | Conference Paper | IST-REx-ID: 646 | OA
A novel convex relaxation for non binary discrete tomography
J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Published | Thesis | IST-REx-ID: 992 | OA
Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 
2016 | Published | Journal Article | IST-REx-ID: 1353 | OA
Deciding absorption
L. Barto, A. Kazda, International Journal of Algebra and Computation 26 (2016) 1033–1060.
[Preprint] View | DOI | Download Preprint (ext.)
 
2016 | Published | Journal Article | IST-REx-ID: 1377 | OA
Total variation on a tree
V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016) 605–636.
[Preprint] View | DOI | Download Preprint (ext.)
 
2016 | Published | Conference Paper | IST-REx-ID: 1193 | OA
Commutativity in the algorithmic Lovasz local lemma
V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Published | Journal Article | IST-REx-ID: 1794 | OA
Inference algorithms for pattern-based CRFs on sequence data
V. Kolmogorov, R. Takhanov, Algorithmica 76 (2016) 17–46.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Research Data | IST-REx-ID: 5557 | OA
Synthetic discrete tomography problems
P. Swoboda, (2016).
[Published Version] View | Files available | DOI
 
2016 | Published | Conference Paper | IST-REx-ID: 1231 | OA
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2016 | Published | Journal Article | IST-REx-ID: 1612 | OA
CSP for binary conservative relational structures
A. Kazda, Algebra Universalis 75 (2016) 75–84.
[Preprint] View | DOI | Download Preprint (ext.)
 
2015 | Published | Conference Paper | IST-REx-ID: 1675 | OA
Proofs of space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, in:, 35th Annual Cryptology Conference, Springer, 2015, pp. 585–605.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2015 | Published | Journal Article | IST-REx-ID: 2271 | OA
The power of linear programming for general-valued CSPs
V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed