BibTeX record conf/stoc/GuptaTW13

download as .bib file

@inproceedings{DBLP:conf/stoc/GuptaTW13,
  author    = {Anupam Gupta and
               Kunal Talwar and
               David Witmer},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/stoc/2013},
  url       = {http://doi.acm.org/10.1145/2488608.2488644},
  doi       = {10.1145/2488608.2488644},
  timestamp = {Sun, 26 May 2013 10:49:33 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/GuptaTW13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2013,
  editor    = {Dan Boneh and
               Tim Roughgarden and
               Joan Feigenbaum},
  title     = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2488608},
  isbn      = {978-1-4503-2029-0},
  timestamp = {Sun, 26 May 2013 10:30:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier