{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:45:48Z","timestamp":1770972348767,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319774039","type":"print"},{"value":"9783319774046","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_7","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"80-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets"],"prefix":"10.1007","author":[{"given":"Sandip","family":"Banerjee","sequence":"first","affiliation":[]},{"given":"Sujoy","family":"Bhore","sequence":"additional","affiliation":[]},{"given":"Rajesh","family":"Chitnis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"7_CR1","first-page":"41","volume":"105","author":"D Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41\u201372 (2011)","journal-title":"Bull. EATCS"},{"key":"7_CR2","volume-title":"Communication Compelxity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Compelxity. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1142\/S0218195992000226","volume":"2","author":"GT Wilfong","year":"1992","unstructured":"Wilfong, G.T.: Nearest neighbor problems. Int. J. Comput. Geom. Appl. 2(4), 383\u2013416 (1992)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"11","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1109\/PROC.1985.13344","volume":"73","author":"SE Levinson","year":"1985","unstructured":"Levinson, S.E.: Structural methods in automated speech recognition. Proc. IEEE 73(11), 1625\u20131650 (1985)","journal-title":"Proc. IEEE"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"PE Hart","year":"1968","unstructured":"Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theory 14(3), 515\u2013516 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"7_CR6","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1109\/34.57669","volume":"12","author":"CC Tappert","year":"1990","unstructured":"Tappert, C.C., Suen, C.Y., Wakahara, T.: The state of the art in online handwriting recognition. IEEE Trans. Pattern Anal. Mach. Intell. 12(8), 787\u2013808 (1990)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"GW Gates","year":"1972","unstructured":"Gates, G.W.: The reduced nearest neighbour rule. IEEE Trans. Inf. Theory 18(3), 431\u2013433 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"7_CR8","first-page":"57","volume":"64","author":"S Masuyama","year":"1981","unstructured":"Masuyama, S., Ibaraki, T., Hasegawa, T.: The computational complexity of the m-center problems in the plane. IEEE Trans. IECE Jpn. 64(2), 57\u201364 (1981)","journal-title":"IEEE Trans. IECE Jpn."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Pach, J., Sharir, M.: State of the union-of geometric objects. In: Godman, J., Pach, J., Pollack, R. (eds.) Surveys in Discrete and Computational Geometry Twenty Years Later. Contemporary Mathematics, vol. 453, pp. 9\u201348 (2008)","DOI":"10.1090\/conm\/453\/08794"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Mustafa, N.H., Ray, S.: PTAS for geometric hitting set problem. In: Proceedings of the 27th(ACM) Symposium on Computational Geometry, pp. 17\u201322 (2009)","DOI":"10.1145\/1542362.1542367"},{"key":"7_CR11","series-title":"An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory, Texts in Theoretical Computer Science","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory, Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TIT.1975.1055464","volume":"21","author":"GL Hitter","year":"1975","unstructured":"Hitter, G.L., Woodruff, H.B., Lowry, S.R., Isenhour, T.L.: An algorithm for a selective nearest neighbor rule. IEEE Trans. Inf. Theory 21, 665\u2013669 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/0219020","volume":"19","author":"PK Agarwal","year":"1990","unstructured":"Agarwal, P.K., Sharir, M.: Red-blue intersection detection algorithms, with applications to motion planning and collision detection. SIAM J. Comput. 19(2), 297\u2013321 (1990)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.comgeo.2014.08.004","volume":"48","author":"EM Arkin","year":"2015","unstructured":"Arkin, E.M., Daz-Bez, J.M., Hurtado, F., Kumar, P., Mitchell, J.S.B., Palop, B., Prez-Lantero, P., Saumell, M., Silveira, R.I.: Bichromatic 2-center of pairs of points. Comput. Geom. 48(2), 94\u2013107 (2015)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:01:07Z","timestamp":1709827267000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}