{"id":"https://openalex.org/W2793002333","doi":"https://doi.org/10.1007/978-3-319-77404-6_7","title":"Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets","display_name":"Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2793002333","doi":"https://doi.org/10.1007/978-3-319-77404-6_7","mag":"2793002333"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-77404-6_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-77404-6_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101600345","display_name":"Sandip Banerjee","orcid":"https://orcid.org/0000-0003-4558-8779"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sandip Banerjee","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072487585","display_name":"Sujoy Bhore","orcid":"https://orcid.org/0000-0003-0104-1659"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Sujoy Bhore","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beersheba, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beersheba, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072487585"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.1704,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.92319277,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"80","last_page":"93"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12549","display_name":"Image and Object Detection Techniques","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12111","display_name":"Industrial Vision Systems and Defect Detection","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7575667500495911},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5716657042503357},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.48996105790138245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4559694826602936},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32756033539772034},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15025055408477783},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05818948149681091}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7575667500495911},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5716657042503357},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.48996105790138245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4559694826602936},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32756033539772034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15025055408477783},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05818948149681091}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-77404-6_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-77404-6_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/f6b8124a-401c-4b8e-a437-9c53a9a0bdb1","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/f6b8124a-401c-4b8e-a437-9c53a9a0bdb1","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Banerjee, S, Bhore, S & Chitnis, R 2018, Algorithms and hardness results for nearest neighbor problems in bicolored point sets. in M A Mosteiro, M A Bender & M Farach-Colton (eds), LATIN 2018 -Theoretical Informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Lecture Notes in Computer Science , vol. 10807, Springer Verlag, pp. 80-93, 13th International Symposium on Latin American Theoretical Informatics, LATIN 2018, Buenos Aires, Argentina, 16/04/18. https://doi.org/10.1007/978-3-319-77404-6_7","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/f6b8124a-401c-4b8e-a437-9c53a9a0bdb1","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/algorithms-and-hardness-results-for-nearest-neighbor-problems-in-bicolored-point-sets(f6b8124a-401c-4b8e-a437-9c53a9a0bdb1).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Banerjee , S , Bhore , S & Chitnis , R 2018 , Algorithms and hardness results for nearest neighbor problems in bicolored point sets . in M A Mosteiro , M A Bender & M Farach-Colton (eds) , LATIN 2018 -Theoretical Informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings . Lecture Notes in Computer Science , vol. 10807 , Springer Verlag , pp. 80-93 , 13th International Symposium on Latin American Theoretical Informatics, LATIN 2018 , Buenos Aires , Argentina , 16/04/18 . https://doi.org/10.1007/978-3-319-77404-6_7","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W99100453","https://openalex.org/W806373222","https://openalex.org/W1570425181","https://openalex.org/W1975598412","https://openalex.org/W1994410331","https://openalex.org/W2034181461","https://openalex.org/W2046260559","https://openalex.org/W2054505111","https://openalex.org/W2055075080","https://openalex.org/W2098631313","https://openalex.org/W2115342786","https://openalex.org/W2162583212","https://openalex.org/W2249739104"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}