@InProceedings{hua_et_al:LIPIcs.ICALP.2024.87,
author = {Hua, Kevin and Li, Daniel and Park, Jaewoo and Saranurak, Thatchaphol},
title = {{Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {87:1--87:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.87},
URN = {urn:nbn:de:0030-drops-202302},
doi = {10.4230/LIPIcs.ICALP.2024.87},
annote = {Keywords: Graphs, Flows, Randomized Algorithms, Vertex Connectivity}
}