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 

Kolmogorov, V., Krokhin, A., &; Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/16M1091836 

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 

Rolinek, M. (2017). Complexity of constraint satisfaction. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:th_815 

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