BibTeX record conf/socs/AbeywickramaCT18

download as .bib file

@inproceedings{DBLP:conf/socs/AbeywickramaCT18,
  author    = {Tenindra Abeywickrama and
               Muhammad Aamir Cheema and
               David Taniar},
  title     = {\emph{k}-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited},
  booktitle = {Proceedings of the Eleventh International Symposium on Combinatorial
               Search, {SOCS} 2018, Stockholm, Sweden - 14-15 July 2018},
  pages     = {184--185},
  year      = {2018},
  crossref  = {DBLP:conf/socs/2018},
  url       = {https://aaai.org/ocs/index.php/SOCS/SOCS18/paper/view/17953},
  timestamp = {Tue, 24 Jul 2018 20:17:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/socs/AbeywickramaCT18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/socs/2018,
  editor    = {Vadim Bulitko and
               Sabine Storandt},
  title     = {Proceedings of the Eleventh International Symposium on Combinatorial
               Search, {SOCS} 2018, Stockholm, Sweden - 14-15 July 2018},
  publisher = {{AAAI} Press},
  year      = {2018},
  url       = {http://www.aaai.org/Library/SOCS/socs18contents.php},
  isbn      = {978-1-57735-802-2},
  timestamp = {Tue, 24 Jul 2018 20:17:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/socs/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier