BibTeX record conf/tapas/MeyerNW11

download as .bib file

@inproceedings{DBLP:conf/tapas/MeyerNW11,
  author    = {Ulrich Meyer and
               Andrei Negoescu and
               Volker Weichert},
  title     = {New Bounds for Old Algorithms: On the Average-Case Behavior of Classic
               Single-Source Shortest-Paths Approaches},
  booktitle = {Theory and Practice of Algorithms in (Computer) Systems - First International
               {ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},
  pages     = {217--228},
  year      = {2011},
  crossref  = {DBLP:conf/tapas/2011},
  url       = {https://doi.org/10.1007/978-3-642-19754-3\_22},
  doi       = {10.1007/978-3-642-19754-3\_22},
  timestamp = {Tue, 25 Jul 2017 16:35:22 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tapas/MeyerNW11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tapas/2011,
  editor    = {Alberto Marchetti{-}Spaccamela and
               Michael Segal},
  title     = {Theory and Practice of Algorithms in (Computer) Systems - First International
               {ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6595},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-19754-3},
  doi       = {10.1007/978-3-642-19754-3},
  isbn      = {978-3-642-19753-6},
  timestamp = {Mon, 26 Jun 2017 07:32:25 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tapas/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier