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 .