BibTeX record conf/stacs/BastMST04

download as .bib file

@inproceedings{DBLP:conf/stacs/BastMST04,
  author    = {H. Bast and
               Kurt Mehlhorn and
               Guido Sch{\"{a}}fer and
               Hisao Tamaki},
  title     = {Matching Algorithms Are Fast in Sparse Random Graphs},
  booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
               Science, Montpellier, France, March 25-27, 2004, Proceedings},
  pages     = {81--92},
  year      = {2004},
  crossref  = {DBLP:conf/stacs/2004},
  url       = {https://doi.org/10.1007/978-3-540-24749-4_8},
  doi       = {10.1007/978-3-540-24749-4_8},
  timestamp = {Mon, 29 May 2017 16:53:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/BastMST04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2004,
  editor    = {Volker Diekert and
               Michel Habib},
  title     = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
               Science, Montpellier, France, March 25-27, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2996},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b96012},
  doi       = {10.1007/b96012},
  isbn      = {3-540-21236-1},
  timestamp = {Mon, 29 May 2017 16:53:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier