BibTeX record conf/waoa/HochbaumL07

download as .bib file

@inproceedings{DBLP:conf/waoa/HochbaumL07,
  author    = {Dorit S. Hochbaum and
               Asaf Levin},
  title     = {Covering the Edges of Bipartite Graphs Using \emph{K} \({}_{\mbox{2,
               2}}\) Graphs},
  booktitle = {Approximation and Online Algorithms, 5th International Workshop, {WAOA}
               2007, Eilat, Israel, October 11-12, 2007. Revised Papers},
  pages     = {116--127},
  year      = {2007},
  crossref  = {DBLP:conf/waoa/2007},
  url       = {https://doi.org/10.1007/978-3-540-77918-6\_10},
  doi       = {10.1007/978-3-540-77918-6\_10},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/HochbaumL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2007,
  editor    = {Christos Kaklamanis and
               Martin Skutella},
  title     = {Approximation and Online Algorithms, 5th International Workshop, {WAOA}
               2007, Eilat, Israel, October 11-12, 2007. Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4927},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-77918-6},
  doi       = {10.1007/978-3-540-77918-6},
  isbn      = {978-3-540-77917-9},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waoa/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier