Forster, Sebastian Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Forster, S., Nanongkai, D., Yang, L., Saranurak, T., & Yingchareonthawornchai, S. (2020). Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. In S. Chawla (Ed.), Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (pp. 2046-2065). Philadelphia, PA: SIAM. doi:10.5555/3381089.3381215.