Stem sparsest$ (all stems)

4 papers:

STOC-2013-GuptaTW #algorithm #bound #graph

Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.

STOC-2013-KaneM

A PRG for lipschitz functions of polynomials with applications to sparsest cut (DMK, RM), pp. 1–10.

STOC-2006-DevanurKSV #linear #problem

Integrality gaps for sparsest cut and minimum linear arrangement problems (NRD, SK, RS, NKV), pp. 537–546.

STOC-2005-AroraLN

Euclidean distortion and the sparsest cut (SA, JRL, AN), pp. 553–562.