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.

59 Publications


2017 | Conference Paper | IST-REx-ID: 1192
Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
View | Files available | DOI | Download (ext.)
 

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.
View | Files available | DOI | Download (ext.)
 

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.
View | Files available | DOI
 

2017 | Thesis | IST-REx-ID: 992   OA
Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, IST Austria, 2017.
View | Files available | DOI
 

2017 | 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.
View | Files available | DOI
 

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 | 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.
View | DOI | Download (ext.)
 

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

2017 | 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, PMLR, 2017, pp. 228–249.
View | Files available | arXiv
 

2016 | 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.
View | DOI | Download (ext.)
 

Filters and Search Terms

department=VlKo

Search

Filter Publications

Display / Sort

Export / Embed