BibTeX record conf/stacs/BastMST04

download as .bib file

@inproceedings{DBLP:conf/stacs/BastMST04,
  author       = {Hannah Bast and
                  Kurt Mehlhorn and
                  Guido Sch{\"{a}}fer and
                  Hisao Tamaki},
  editor       = {Volker Diekert and
                  Michel Habib},
  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},
  series       = {Lecture Notes in Computer Science},
  volume       = {2996},
  pages        = {81--92},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-24749-4\_8},
  doi          = {10.1007/978-3-540-24749-4\_8},
  timestamp    = {Mon, 14 Dec 2020 11:06:52 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/BastMST04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics