Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530
LibreCat: https://research-explorer.ista.ac.at/record/915
DOI: 10.1109/CVPR.2017.530
WoS: 000418371405009

Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:10.1109/CVPR.2017.526
LibreCat: https://research-explorer.ista.ac.at/record/917
DOI: 10.1109/CVPR.2017.526
WoS: 000418371405005

Kolmogorov V. A faster approximation algorithm for the Gibbs partition function. In: Proceedings of the 31st Conference On Learning Theory. Vol 75. ML Research Press; 2017:228-249.
LibreCat: https://research-explorer.ista.ac.at/record/274
arXiv: 1608.04223

Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:10.1007/978-3-662-49896-5_13
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 10.1007/978-3-662-49896-5_13

Barto L, Kazda A. Deciding absorption. International Journal of Algebra and Computation. 2016;26(5):1033-1060. doi:10.1142/S0218196716500430
LibreCat: https://research-explorer.ista.ac.at/record/1353
DOI: 10.1142/S0218196716500430