BibTeX record conf/approx/McGregor05

download as .bib file

@inproceedings{DBLP:conf/approx/McGregor05,
  author    = {Andrew McGregor},
  title     = {Finding Graph Matchings in Data Streams},
  booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
               and Techniques, 8th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
               on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
               August 22-24, 2005, Proceedings},
  pages     = {170--181},
  year      = {2005},
  crossref  = {DBLP:conf/approx/2005},
  url       = {https://doi.org/10.1007/11538462\_15},
  doi       = {10.1007/11538462\_15},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/McGregor05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2005,
  editor    = {Chandra Chekuri and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Luca Trevisan},
  title     = {Approximation, Randomization and Combinatorial Optimization, Algorithms
               and Techniques, 8th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
               on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
               August 22-24, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3624},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11538462},
  doi       = {10.1007/11538462},
  isbn      = {3-540-28239-4},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier