Travelled to:
1 × USA
Collaborated with:
A.Gupta K.Talwar
Talks about:
treewidth (1) algorithm (1) sparsest (1) result (1) graph (1) bound (1) hard (1) cut (1)
Person: David Witmer
DBLP: Witmer:David
Contributed to:
Wrote 1 papers:
- STOC-2013-GuptaTW #algorithm #bound #graph
- Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.