Improved Guarantees for Vertex Sparsification in Planar Graphs
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
A Tree Structure For Dynamic Facility Location
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
Distance-Preserving Subgraphs of Interval Graphs