Sparsest cut on bounded treewidth graphs: algorithms and hardness results.

Anupam Gupta, Kunal Talwar, David Witmer

Browse the full STOC paper archive.