Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational Inequalities with Inertial-Type Method.”https://doi.org/10.1080/00036811.2020.1736287__Applicable Analysis. Taylor &; Francis, 2022.https://doi.org/10.1080/00036811.2020.1736287 .

Harris, David G., Fotis Iliopoulos, and Vladimir Kolmogorov. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.”https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31__In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Vol. 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31 .

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

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

Iyiola, Olaniyi S., Cyril D. Enyi, and Yekini Shehu. “Reflected Three-Operator Splitting Method for Monotone Inclusion Problem.”https://doi.org/10.1080/10556788.2021.1924715__Optimization Methods and Software. Taylor and Francis, 2021.https://doi.org/10.1080/10556788.2021.1924715 .

Izuchukwu, Chinedu, and Yekini Shehu. “New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems beyond Monotonicity.”https://doi.org/10.1007/s11067-021-09517-w__Networks and Spatial Economics. Springer Nature, 2021.https://doi.org/10.1007/s11067-021-09517-w .

Bloch-Hansen, Andrew, Nasim Samei, and Roberto Solis-Oba. “Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.”https://doi.org/10.1007/978-3-030-67899-9_28__In Conference on Algorithms and Discrete Applied Mathematics, 12601:346–58. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-67899-9_28 .

Shehu, Yekini, Olaniyi S. Iyiola, Duong Viet Thong, and Nguyen Thi Cam Van. “An Inertial Subgradient Extragradient Algorithm Extended to Pseudomonotone Equilibrium Problems.”https://doi.org/10.1007/s00186-020-00730-w__Mathematical Methods of Operations Research. Springer Nature, 2021.https://doi.org/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.”https://doi.org/10.1007/s00025-021-01381-x__Results in Mathematics. Springer Nature, 2021.https://doi.org/10.1007/s00025-021-01381-x .

Ogbuisi, Ferdinard U., Yekini Shehu, and Jen Chih Yao. “Convergence Analysis of New Inertial Method for the Split Common Null Point Problem.”https://doi.org/10.1080/02331934.2021.1914035__Optimization. Taylor and Francis, 2021.https://doi.org/10.1080/02331934.2021.1914035 .

Shehu, Yekini, Qiao-Li Dong, Lu-Lu Liu, and Jen-Chih Yao. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.”https://doi.org/10.1007/s11081-020-09544-5__Optimization and Engineering. Springer Nature, 2021.https://doi.org/10.1007/s11081-020-09544-5 .

Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.”https://doi.org/10.1007/s11590-020-01603-1__Optimization Letters. Springer Nature, 2021.https://doi.org/10.1007/s11590-020-01603-1 .

Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.”https://doi.org/10.1007/s11075-019-00758-y__Numerical Algorithms. Springer Nature, 2020.https://doi.org/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.”https://doi.org/10.1016/j.apnum.2020.06.009__Applied Numerical Mathematics. Elsevier, 2020.https://doi.org/10.1016/j.apnum.2020.06.009 .

Shehu, Yekini, Aviv Gibali, and Simone Sagratella. “Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces.”https://doi.org/10.1007/s10957-019-01616-6__Journal of Optimization Theory and Applications. Springer Nature, 2020.https://doi.org/10.1007/s10957-019-01616-6 .

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

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

Shehu, Yekini, Olaniyi S. Iyiola, Xiao-Huan Li, and Qiao-Li Dong. “Convergence Analysis of Projection Method for Variational Inequalities.”https://doi.org/10.1007/s40314-019-0955-9__Computational and Applied Mathematics. Springer Nature, 2019.https://doi.org/10.1007/s40314-019-0955-9 .

Achlioptas, Dimitris, Fotis Iliopoulos, and Vladimir Kolmogorov. “A Local Lemma for Focused Stochastical Algorithms.”https://doi.org/10.1137/16m109332x__SIAM Journal on Computing. SIAM, 2019.https://doi.org/10.1137/16m109332x .

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

Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.”https://doi.org/10.1109/ICCVW.2019.00097__In Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019.https://doi.org/10.1109/ICCVW.2019.00097 .

Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.”https://doi.org/10.1109/TPAMI.2017.2730884__IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018.https://doi.org/10.1109/TPAMI.2017.2730884 .

Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption and Directed Jónsson Terms.”https://doi.org/10.1007/978-3-319-74772-9_7__In Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited by J Czelakowski, 16:203–20. OCTR. Cham: Springer Nature, 2018.https://doi.org/10.1007/978-3-319-74772-9_7 .

Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.”https://doi.org/10.1109/cvpr.2018.00389__In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701. IEEE, 2018.https://doi.org/10.1109/cvpr.2018.00389 .

Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.”https://doi.org/10.1145/3196494.3196534__In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018.https://doi.org/10.1145/3196494.3196534 .

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”https://doi.org/10.1137/16m1093306__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics (SIAM), 2018.https://doi.org/10.1137/16m1093306 .

Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” In Proceedings of the 32st AAAI Conference on Artificial Intelligence, 6581–88. AAAI Press, 2018.

Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.

Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.”https://doi.org/10.1145/3230649__ACM Transactions on Algorithms. ACM, 2018.https://doi.org/10.1145/3230649 .

Alhaija, Hassan, Anita Sellent, Daniel Kondermann, and Carsten Rother. “Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow.”https://doi.org/10.15479/AT:ISTA:82__Institute of Science and Technology Austria, 2018.https://doi.org/10.15479/AT:ISTA:82 .

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 .