Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

Asaf Lev-Ran

Jeferson Zapata

Vladimir Kolmogorov

Mikhail Karapetyants

Pavel Arkhipov

Pouyan Shirzadian

Martin Dvorak

Yekini Shehu

Alexandr Kazda

Michal Rolinek

Neel Shah

Ivan Sergeev

Paul Swoboda

Rustem Takhanov

Nasim Samei

Senanayak Karri



82 Publications

2026 | Published | Conference Paper | IST-REx-ID: 21140 | OA
Arkhipov P, Kolmogorov V. 2026. Faster algorithms for packing forests in graphs and related problems. Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 4023–4042.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2026 | Submitted | Preprint | IST-REx-ID: 21400 | OA
Sergeev I, Dvorak M, Rampell C, Sandey M, Monticone P. A blueprint for the formalization of Seymour’s matroid decomposition theorem. arXiv, 10.48550/arXiv.2601.01255.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 18855 | OA
Harris DG, Kolmogorov V. 2025. Parameter estimation for Gibbs distributions. ACM Transactions on Algorithms. 21(1), 3.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 10045 | OA
Dvorak M, Kolmogorov V. 2025. Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming. 209, 279–322.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 21007 | OA | PlanS
Kolmogorov V. 2025. A simpler and parallelizable O(√log n)-approximation algorithm for SPARSEST CUT. ACM Transactions on Algorithms. 21(4), 1–22.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 21143 | OA | PlanS
Harris DG, Iliopoulos F, Kolmogorov V. 2025. A new notion of commutativity for the algorithmic Lovász Local Lemma. Theory of Computing. 21(5), 1–34.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 21144 | OA
Kolmogorov V, Naldi S, Zapata J. 2025. Certifying solutions of degenerate semidefinite programs. SIAM Journal on Optimization. 35(3), 1630–1654.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2025 | Submitted | Preprint | IST-REx-ID: 21399 | OA
Bolan M, Breitner J, Brox J, Carlini N, Carneiro M, Doorn F van, Dvorak M, Goens A, Hill A, Husum H, Mejia HI, Kocsis ZA, Floch BL, Bar-on A, Luccioli L, McNeil D, Meiburg A, Monticone P, Nielsen PP, Osazuwa EO, Paolini G, Petracci M, Reinke B, Renshaw D, Rossel M, Roux C, Scanvic J, Srinivas S, Tadipatri AR, Tao T, Tsyrklevich V, Vaquerizo-Villar F, Weber D, Zheng F. The equational theories project: Advancing collaborative mathematical research at scale. arXiv, 10.48550/arXiv.2512.07087.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2025 | Draft | Preprint | IST-REx-ID: 21398 | OA
Dvorak M, Figueroa-Reid T, Hamadani R, Hwang B-H, Karunus E, Kolmogorov V, Meiburg A, Nelson A, Nelson P, Sandey M, Sergeev I. Composition direction of Seymour’s theorem for regular matroids — Formally verified. arXiv, 10.48550/arXiv.2509.20539.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 17236 | OA
Kolmogorov V. 2024. A simpler and parallelizable O(√log n)-approximation algorithm for sparsest cut. Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 403–414.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Draft | Preprint | IST-REx-ID: 20071 | OA
Dvorak M, Kolmogorov V. Duality theory in linear optimization and its extensions -- formally  verified. arXiv, 2409.08119.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14084 | OA
Harris DG, Kolmogorov V. 2023. Parameter estimation for Gibbs distributions. 50th International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 261, 72.
[Published Version] View | Files available | DOI | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14448 | OA
Kolmogorov V. 2023. Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2023, 11980–11989.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 13120 | OA
Dvorak M, Blanchette J. 2023. Closure properties of general grammars - formally verified. 14th International Conference on Interactive Theorem Proving. ITP: Interactive Theorem Proving, LIPIcs, vol. 268, 15.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 10737 | OA
Takhanov R, Kolmogorov V. 2022. Combining pattern-based CRFs and weighted context-free grammars. Intelligent Data Analysis. 26(1), 257–272.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 9365
Ogbuisi FU, Shehu Y, Yao JC. 2022. Convergence analysis of new inertial method for the split common null point problem. Optimization. 71(13), 3767–3795.
View | DOI | WoS
 
2022 | Published | Journal Article | IST-REx-ID: 9469
Iyiola OS, Enyi CD, Shehu Y. 2022. Reflected three-operator splitting method for monotone inclusion problem. Optimization Methods and Software. 37(4), 1527–1565.
View | DOI | WoS
 
2022 | Published | Journal Article | IST-REx-ID: 7577 | OA
Shehu Y, Iyiola OS. 2022. Weak convergence for variational inequalities with inertial-type method. Applicable Analysis. 101(1), 192–216.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10552 | OA
Kolmogorov V, Pock T. 2021. One-sided Frank-Wolfe algorithms for saddle problems. 38th International Conference on Machine Learning. ICML: International Conference on Machine Learning.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10072 | OA
Harris DG, Iliopoulos F, Kolmogorov V. 2021. A new notion of commutativity for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation, LIPIcs, vol. 207, 31.
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

type<>research_data

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed