Daniel Dadush, James B. Orlin, Aaron Sidford, László A. Végh. From Incremental Transitive Cover to Strongly Polynomial Maximum Flow. In Kasper Green Larsen, Barna Saha, editors, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026, Vancouver, BC, Canada, January 11-14, 2026. pages 150-163, SIAM, 2026. [doi]
Abstract is missing.