Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.”https://doi.org/10.1007/978-3-319-58771-4_26__edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017.https://doi.org/10.1007/978-3-319-58771-4_26 .

Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.”https://doi.org/10.1137/16M1091836__SIAM Journal on Computing. SIAM, 2017.https://doi.org/10.1137/16M1091836 .

Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.”https://doi.org/10.1007/978-3-319-58771-4_19__edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017.https://doi.org/10.1007/978-3-319-58771-4_19 .

Rolinek, Michal. “Complexity of Constraint Satisfaction.”https://doi.org/10.15479/AT:ISTA:th_815__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:th_815 .

Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,”https://doi.org/10.1137/1.9781611974782.20__307–26. SIAM, 2017.https://doi.org/10.1137/1.9781611974782.20 .

Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller, and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching,”https://doi.org/10.1109/CVPR.2017.747__2017:7062–71. IEEE, 2017.https://doi.org/10.1109/CVPR.2017.747 .

Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the Minimum Cost Multicut Problem,”https://doi.org/10.1109/CVPR.2017.530__2017:4990–99. IEEE, 2017.https://doi.org/10.1109/CVPR.2017.530 .

Swoboda, Paul, Jan Kuske, and Bogdan Savchynskyy. “A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems,”https://doi.org/10.1109/CVPR.2017.526__2017:4950–60. IEEE, 2017.https://doi.org/10.1109/CVPR.2017.526 .

Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” In Proceedings of the 31st Conference On Learning Theory, 75:228–49. ML Research Press, 2017.

Kainmueller, Dagmar, Florian Jug, Carsten Rother, and Gene Meyers. “Graph Matching Problems for Annotating C. Elegans.”https://doi.org/10.15479/AT:ISTA:57__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:57 .

Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,”https://doi.org/10.1007/978-3-662-49896-5_13__9666:358–87. Springer, 2016.https://doi.org/10.1007/978-3-662-49896-5_13 .

Barto, Libor, and Alexandr Kazda. “Deciding Absorption.”https://doi.org/10.1142/S0218196716500430__International Journal of Algebra and Computation. World Scientific Publishing, 2016.https://doi.org/10.1142/S0218196716500430 .

Kolmogorov, Vladimir, Thomas Pock, and Michal Rolinek. “Total Variation on a Tree.”https://doi.org/10.1137/15M1010257__SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics , 2016.https://doi.org/10.1137/15M1010257 .

Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.”https://doi.org/10.1007/s00012-015-0358-8__Algebra Universalis. Springer, 2016.https://doi.org/10.1007/s00012-015-0358-8 .

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.”https://doi.org/10.1109/FOCS.2016.88__In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, Vol. 2016–December. IEEE, 2016.https://doi.org/10.1109/FOCS.2016.88 .

Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.”https://doi.org/10.1007/s00453-015-0017-7__Algorithmica. Springer, 2016.https://doi.org/10.1007/s00453-015-0017-7 .

Swoboda, Paul. “Synthetic Discrete Tomography Problems.”https://doi.org/10.15479/AT:ISTA:46__Institute of Science and Technology Austria, 2016.https://doi.org/10.15479/AT:ISTA:46 .

Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness of Structural Restrictions for Hybrid CSPs.”https://doi.org/10.1007/978-3-662-48971-0_48__In 26th International Symposium, 9472:566–77. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-48971-0_48 .

Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.”https://doi.org/10.1109/TPAMI.2014.2363465__IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015.https://doi.org/10.1109/TPAMI.2014.2363465 .

Shah, Neel, Vladimir Kolmogorov, and Christoph Lampert. “A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle,”https://doi.org/10.1109/CVPR.2015.7298890__2737–45. IEEE, 2015.https://doi.org/10.1109/CVPR.2015.7298890 .