BibTeX record conf/stoc/GuptaTW13

download as .bib file

@inproceedings{DBLP:conf/stoc/GuptaTW13,
  author       = {Anupam Gupta and
                  Kunal Talwar and
                  David Witmer},
  editor       = {Dan Boneh and
                  Tim Roughgarden and
                  Joan Feigenbaum},
  title        = {Sparsest cut on bounded treewidth graphs: algorithms and hardness
                  results},
  booktitle    = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
                  USA, June 1-4, 2013},
  pages        = {281--290},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2488608.2488644},
  doi          = {10.1145/2488608.2488644},
  timestamp    = {Wed, 18 Aug 2021 17:14:20 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/GuptaTW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.