%0 Conference Paper %1 conf/latin/BanerjeeBC18 %A Banerjee, Sandip %A Bhore, Sujoy %A Chitnis, Rajesh %B LATIN %D 2018 %E Bender, Michael A. %E Farach-Colton, Martin %E Mosteiro, Miguel A. %I Springer %K dblp %P 80-93 %T Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. %U http://dblp.uni-trier.de/db/conf/latin/latin2018.html#BanerjeeBC18 %V 10807 %@ 978-3-319-77404-6

@inproceedings{conf/latin/BanerjeeBC18, added-at = {2018-11-02T00:00:00.000+0100}, author = {Banerjee, Sandip and Bhore, Sujoy and Chitnis, Rajesh}, biburl = {https://www.bibsonomy.org/bibtex/211c9e9cbf172272f044153b3ca449cab/dblp}, booktitle = {LATIN}, crossref = {conf/latin/2018}, editor = {Bender, Michael A. and Farach-Colton, Martin and Mosteiro, Miguel A.}, ee = {https://doi.org/10.1007/978-3-319-77404-6_7}, interhash = {ba53ac2a830a8efdb6b709ce5a067b4c}, intrahash = {11c9e9cbf172272f044153b3ca449cab}, isbn = {978-3-319-77404-6}, keywords = {dblp}, pages = {80-93}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T20:17:14.000+0200}, title = {Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets.}, url = {http://dblp.uni-trier.de/db/conf/latin/latin2018.html#BanerjeeBC18}, volume = 10807, year = 2018 }