BibTeX record conf/approx/EdelmanHNO11

download as .bib file

@inproceedings{DBLP:conf/approx/EdelmanHNO11,
  author    = {Alan Edelman and
               Avinatan Hassidim and
               Huy N. Nguyen and
               Krzysztof Onak},
  editor    = {Leslie Ann Goldberg and
               Klaus Jansen and
               R. Ravi and
               Jos{\'{e}} D. P. Rolim},
  title     = {An Efficient Partitioning Oracle for Bounded-Treewidth Graphs},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
               International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
               17-19, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6845},
  pages     = {530--541},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-22935-0\_45},
  doi       = {10.1007/978-3-642-22935-0\_45},
  timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl    = {https://dblp.org/rec/conf/approx/EdelmanHNO11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics