Similar Items: Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
- An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
- Computing Flows in Subquadratic Space
- Randomized $k$-server in polynomial time
- Dynamic Edge Coloring of Forests
- Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
- Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist