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. In Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4023–4042). Vancouver, Canada: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.148
[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. (n.d.). A blueprint for the formalization of Seymour’s matroid decomposition theorem. arXiv. https://doi.org/10.48550/arXiv.2601.01255
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 18855 | OA
Harris, D. G., & Kolmogorov, V. (2025). Parameter estimation for Gibbs distributions. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3685676
[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. Springer Nature. https://doi.org/10.1007/s10107-024-02064-5
[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. Association for Computing Machinery. https://doi.org/10.1145/3748723
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 21143 | OA | PlanS
Harris, D. G., Iliopoulos, F., & Kolmogorov, V. (2025). A new notion of commutativity for the algorithmic Lovász Local Lemma. Theory of Computing. University of Chicago Press. https://doi.org/10.4086/toc.2025.v021a005
[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. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/24m1664691
[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., … Sergeev, I. (n.d.). Composition direction of Seymour’s theorem for regular matroids — Formally verified. arXiv. https://doi.org/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. In Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 403–414). Nantes, France: Association for Computing Machinery. https://doi.org/10.1145/3626183.3659969
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Draft | Preprint | IST-REx-ID: 20071 | OA
Dvorak, M., & Kolmogorov, V. (n.d.). Duality theory in linear optimization and its extensions -- formally  verified. arXiv. https://doi.org/10.48550/arXiv.2409.08119
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14084 | OA
Harris, D. G., & Kolmogorov, V. (2023). Parameter estimation for Gibbs distributions. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.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. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Vol. 2023, pp. 11980–11989). Vancouver, Canada: IEEE. https://doi.org/10.1109/CVPR52729.2023.01153
[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. In 14th International Conference on Interactive Theorem Proving (Vol. 268). Bialystok, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITP.2023.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. IOS Press. https://doi.org/10.3233/IDA-205623
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 9365
Ogbuisi, F. U., Shehu, Y., & Yao, J. C. (2022). Convergence analysis of new inertial method for the split common null point problem. Optimization. Taylor and Francis. https://doi.org/10.1080/02331934.2021.1914035
View | DOI | WoS
 
2022 | Published | Journal Article | IST-REx-ID: 9469
Iyiola, O. S., Enyi, C. D., & Shehu, Y. (2022). Reflected three-operator splitting method for monotone inclusion problem. Optimization Methods and Software. Taylor and Francis. https://doi.org/10.1080/10556788.2021.1924715
View | DOI | WoS
 
2022 | Published | Journal Article | IST-REx-ID: 7577 | OA
Shehu, Y., & Iyiola, O. S. (2022). Weak convergence for variational inequalities with inertial-type method. Applicable Analysis. Taylor & Francis. https://doi.org/10.1080/00036811.2020.1736287
[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. In 38th International Conference on Machine Learning. Virtual.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10072 | OA
Harris, D. G., Iliopoulos, F., & Kolmogorov, V. (2021). A new notion of commutativity for the algorithmic Lovász Local Lemma. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Vol. 207). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

type<>research_data

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed