Similar Items: Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
- Undirected Replacement Paths: Dual Fault Reduces to Single Source
- Dynamic Edge Coloring of Forests
- Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
- Node-Weighted Triangles: Faster and Simpler
- EPTAS for Hard Graph Cut Problems for Dense Graphs
- A Scalable and Unified Framework to Weighted Rank Aggregation