1. Pettie, S., Yin, L.: The structure of minimum vertex cuts. In: Bansal, N., Merelli, E., Worrell, J. (eds.) 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12–16, 2021, Glasgow, Scotland (Virtual Conference). LIPIcs, vol. 198, pp. 105–110520 (2021)
2. Nanongkai, D., Saranurak, T., Yingchareonthawornchai, S.: Breaking quadratic time for small vertex connectivity and an approximation scheme. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23–26, 2019, pp. 241–252 (2019)
3. Li, J., Nanongkai, D., Panigrahi, D., Saranurak, T., Yingchareonthawornchai, S.: Vertex connectivity in poly-logarithmic max-flows. In: Khuller, S., Williams, V.V. (eds.) STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21–25, 2021, pp. 317–329 (2021)
4. He, Z., Li, J., Wahlström, M.: Near-linear-time, optimal vertex cut sparsifiers in directed acyclic graphs. In: Mutzel, P., Pagh, R., Herman, G. (eds.) 29th Annual European Symposium on Algorithms, ESA 2021, September 6–8, 2021, Lisbon, Portugal (Virtual Conference). LIPIcs, vol. 204, pp. 52–15214 (2021)
5. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)