BibTeX record conf/soda/GoldbergH05

download as .bib file

@inproceedings{DBLP:conf/soda/GoldbergH05,
  author    = {Andrew V. Goldberg and
               Chris Harrelson},
  title     = {Computing the shortest path: \emph{A} search meets graph theory},
  booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  pages     = {156--165},
  year      = {2005},
  crossref  = {DBLP:conf/soda/2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432.1070455},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GoldbergH05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2005,
  title     = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  publisher = {{SIAM}},
  year      = {2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432},
  isbn      = {0-89871-585-7},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier