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
Kazda, A., Kolmogorov, V., & Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. https://doi.org/10.1137/1.9781611974782.20
View | Files available | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing, 46(3), 1087–1110. https://doi.org/10.1137/16M1091836
View | Files available | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 916   OA
Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., & Savchynskyy, B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.747
View | Files available | DOI
 

2017 | Thesis | IST-REx-ID: 992   OA
Rolinek, M. (2017). Complexity of constraint satisfaction. IST Austria. https://doi.org/10.15479/AT:ISTA:th_815
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 917   OA
Swoboda, P., Kuske, J., & Savchynskyy, B. (2017). A dual ascent framework for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.526
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 641
Trajkovska, V., Swoboda, P., Åström, F., & Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_26
View | DOI
 

2017 | Conference Paper | IST-REx-ID: 646   OA
Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19
View | DOI | Download (ext.)
 

2017 | Research Data | IST-REx-ID: 5561   OA
Kainmueller, D., Jug, F., Rother, C., & Meyers, G. (2017). Graph matching problems for annotating C. Elegans. IST Austria. https://doi.org/10.15479/AT:ISTA:57
View | Files available | DOI
 

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

2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., & Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-662-49896-5_13
View | DOI | Download (ext.)
 

Filters and Search Terms

department=VlKo

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed