Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.”10.1007/s10107-024-02064-5__Mathematical Programming, Springer Nature, 2024, doi:10.1007/s10107-024-02064-5.

Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.”10.4230/LIPIcs.ICALP.2023.72__50th International Colloquium on Automata, Languages, and Programming, vol. 261, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.72.

Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars - Formally Verified.”10.4230/LIPIcs.ITP.2023.15__14th International Conference on Interactive Theorem Proving, vol. 268, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ITP.2023.15.

Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions.”10.1109/CVPR52729.2023.01153__Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2023, IEEE, 2023, pp. 11980–89, doi:10.1109/CVPR52729.2023.01153.

Takhanov, Rustem, and Vladimir Kolmogorov. “Combining Pattern-Based CRFs and Weighted Context-Free Grammars.”10.3233/IDA-205623__Intelligent Data Analysis, vol. 26, no. 1, IOS Press, 2022, pp. 257–72, doi:10.3233/IDA-205623.

Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational Inequalities with Inertial-Type Method.”10.1080/00036811.2020.1736287__Applicable Analysis, vol. 101, no. 1, Taylor &; Francis, 2022, pp. 192–216, doi:10.1080/00036811.2020.1736287.

Harris, David G., et al. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.”10.4230/LIPIcs.APPROX/RANDOM.2021.31__Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, vol. 207, 31, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.APPROX/RANDOM.2021.31.

Kolmogorov, Vladimir, and Thomas Pock. “One-Sided Frank-Wolfe Algorithms for Saddle Problems.” 38th International Conference on Machine Learning, 2021.

Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” Proceedings of the 33rd Canadian Conference on Computational Geometry.

Iyiola, Olaniyi S., et al. “Reflected Three-Operator Splitting Method for Monotone Inclusion Problem.”10.1080/10556788.2021.1924715__Optimization Methods and Software, Taylor and Francis, 2021, doi:10.1080/10556788.2021.1924715.

Izuchukwu, Chinedu, and Yekini Shehu. “New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems beyond Monotonicity.”10.1007/s11067-021-09517-w__Networks and Spatial Economics, vol. 21, no. 2, Springer Nature, 2021, pp. 291–323, doi:10.1007/s11067-021-09517-w.

Bloch-Hansen, Andrew, et al. “Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.”10.1007/978-3-030-67899-9_28__Conference on Algorithms and Discrete Applied Mathematics, vol. 12601, Springer Nature, 2021, pp. 346–58, doi:10.1007/978-3-030-67899-9_28.

Shehu, Yekini, et al. “An Inertial Subgradient Extragradient Algorithm Extended to Pseudomonotone Equilibrium Problems.”10.1007/s00186-020-00730-w__Mathematical Methods of Operations Research, vol. 93, no. 2, Springer Nature, 2021, pp. 213–42, doi:10.1007/s00186-020-00730-w.

Iyiola, Olaniyi S., and Yekini Shehu. “New Convergence Results for Inertial Krasnoselskii–Mann Iterations in Hilbert Spaces with Applications.”10.1007/s00025-021-01381-x__Results in Mathematics, vol. 76, no. 2, 75, Springer Nature, 2021, doi:10.1007/s00025-021-01381-x.

Ogbuisi, Ferdinard U., et al. “Convergence Analysis of New Inertial Method for the Split Common Null Point Problem.”10.1080/02331934.2021.1914035__Optimization, Taylor and Francis, 2021, doi:10.1080/02331934.2021.1914035.

Shehu, Yekini, et al. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.”10.1007/s11081-020-09544-5__Optimization and Engineering, vol. 22, Springer Nature, 2021, pp. 2627–53, doi:10.1007/s11081-020-09544-5.

Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.”10.1007/s11590-020-01603-1__Optimization Letters, vol. 15, Springer Nature, 2021, pp. 2109–26, doi:10.1007/s11590-020-01603-1.

Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.”10.1007/s11075-019-00758-y__Numerical Algorithms, vol. 84, Springer Nature, 2020, pp. 365–88, doi:10.1007/s11075-019-00758-y.

Shehu, Yekini, and Olaniyi S. Iyiola. “Projection Methods with Alternating Inertial Steps for Variational Inequalities: Weak and Linear Convergence.”10.1016/j.apnum.2020.06.009__Applied Numerical Mathematics, vol. 157, Elsevier, 2020, pp. 315–37, doi:10.1016/j.apnum.2020.06.009.

Shehu, Yekini, et al. “Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces.”10.1007/s10957-019-01616-6__Journal of Optimization Theory and Applications, vol. 184, Springer Nature, 2020, pp. 877–894, doi:10.1007/s10957-019-01616-6.

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.

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

Swoboda, Paul, et al. A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:10.1109/CVPR.2017.526.

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

Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.

Barto, Libor, and Alexandr Kazda. “Deciding Absorption.”10.1142/S0218196716500430__International Journal of Algebra and Computation, vol. 26, no. 5, World Scientific Publishing, 2016, pp. 1033–60, doi:10.1142/S0218196716500430.

Kolmogorov, Vladimir, et al. “Total Variation on a Tree.”10.1137/15M1010257__SIAM Journal on Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics , 2016, pp. 605–36, doi:10.1137/15M1010257.

Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.”10.1007/s00012-015-0358-8__Algebra Universalis, vol. 75, no. 1, Springer, 2016, pp. 75–84, doi:10.1007/s00012-015-0358-8.

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.”10.1109/FOCS.2016.88__Proceedings - Annual IEEE Symposium on Foundations of Computer Science, vol. 2016–December, 7782993, IEEE, 2016, doi:10.1109/FOCS.2016.88.

Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.”10.1007/s00453-015-0017-7__Algorithmica, vol. 76, no. 1, Springer, 2016, pp. 17–46, doi:10.1007/s00453-015-0017-7.

Kolmogorov, Vladimir, et al. “Effectiveness of Structural Restrictions for Hybrid CSPs.”10.1007/978-3-662-48971-0_48__26th International Symposium, vol. 9472, Springer Nature, 2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.