Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”10.4230/LIPICS.ICALP.2019.77__46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.

Shehu, Yekini. “Convergence Results of Forward-Backward Algorithms for Sum of Monotone Operators in Banach Spaces.”10.1007/s00025-019-1061-4__Results in Mathematics, vol. 74, no. 4, 138, Springer, 2019, doi:10.1007/s00025-019-1061-4.

Shehu, Yekini, et al. “Convergence Analysis of Projection Method for Variational Inequalities.”10.1007/s40314-019-0955-9__Computational and Applied Mathematics, vol. 38, no. 4, 161, Springer Nature, 2019, doi:10.1007/s40314-019-0955-9.

Achlioptas, Dimitris, et al. “A Local Lemma for Focused Stochastical Algorithms.”10.1137/16m109332x__SIAM Journal on Computing, vol. 48, no. 5, SIAM, 2019, pp. 1583–602, doi:10.1137/16m109332x.

Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.”10.1109/CVPR.2019.01140__Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2019–June, 11138–11147, IEEE, 2019, doi:10.1109/CVPR.2019.01140.

Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.”10.1109/ICCVW.2019.00097__Proceedings of the 2019 International Conference on Computer Vision Workshop, 748–752, IEEE, 2019, doi:10.1109/ICCVW.2019.00097.

Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.”10.1109/TPAMI.2017.2730884__IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.

Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.”10.1007/978-3-319-74772-9_7__Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:10.1007/978-3-319-74772-9_7.

Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.”10.1109/cvpr.2018.00389__2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.

Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.”10.1145/3196494.3196534__Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”10.1137/16m1093306__SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial &; Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.

Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–88.

Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.

Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.”10.1145/3230649__ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.

Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.

Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.”10.1137/16M1091836__SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.

Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.

Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.

Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.

Swoboda, Paul, et al. A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:10.1109/CVPR.2017.747.