Skip to content

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More.

Tuukka Korhonen

VenueA*STOC
Year2025
ProceedingsSTOC

Browse the full STOC paper archive.