Kiss, Peter Algorithms and Complexity, MPI for Informatics, Max Planck Society;
3618260.3649648.pdf (Publisher version), 291KB
Bhattacharya, S., Kiss, P., Sidford, A., & Wajc, D. (2024). Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. In B. Moha, I. Shinkar, & R. O'Donnell (Eds.), STOC '24 (pp. 59-70). New York, NY: ACM. doi:10.1145/3618260.3649648.