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.




72 Publications

2018 | Journal Article | IST-REx-ID: 5975 | OA
Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5978 | OA
Exact MAP-inference by confining combinatorial search with LP relaxation
S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 18 | OA
Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 6032 | OA
Even delta-matroids and the complexity of planar boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | 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 | 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 | 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 | 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
 
2017 | 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 | 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
 

Filters and Search Terms

type<>research_data

Search

Filter Publications