Anupam Gupta, Kunal Talwar, David Witmer. Sparsest cut on bounded treewidth graphs: algorithms and hardness results. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 281-290, ACM, 2013. [doi]
Abstract is missing.