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.
87 Publications
2026 |
Published |
Conference Paper |
IST-REx-ID: 21140 |
Arkhipov, Pavel, and Vladimir Kolmogorov. “Faster Algorithms for Packing Forests in Graphs and Related Problems.” Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 4023–42, doi:10.1137/1.9781611978971.148.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2026 |
Published |
Thesis | PhD |
IST-REx-ID: 21393 |
Dvorak, Martin. Pursuit of Truth and Beauty in Lean 4 : Formally Verified Theory of Grammars, Optimization, Matroids. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21393.
[Published Version]
View
| Files available
| DOI
2026 |
Submitted |
Preprint |
IST-REx-ID: 21400 |
Sergeev, Ivan, et al. “A Blueprint for the Formalization of Seymour’s Matroid Decomposition Theorem.” ArXiv, doi:10.48550/arXiv.2601.01255.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2026 |
Published |
Thesis | PhD |
IST-REx-ID: 21957 |
Zapata, Jeferson. Overcoming Degeneracy and Singularity : Techniques for Semidefinite Programs and Homotopy Continuation Endgames. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21957.
[Published Version]
View
| Files available
| DOI
2025 |
Published |
Journal Article |
IST-REx-ID: 21007 |
| 
|
Kolmogorov, Vladimir. “A Simpler and Parallelizable O(√log n)-Approximation Algorithm for SPARSEST CUT.” ACM Transactions on Algorithms, vol. 21, no. 4, Association for Computing Machinery, 2025, pp. 1–22, doi:10.1145/3748723.
[Published Version]
View
| Files available
| DOI
| arXiv