@inproceedings{conf/compgeom/IaconoN25,
  added-at = {2025-06-20T00:00:00.000+0200},
  author = {Iacono, John and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/2cd6f59bd07efc1883c924b1337cbe8a5/dblp},
  booktitle = {SoCG},
  crossref = {conf/compgeom/2025},
  editor = {Aichholzer, Oswin and Wang, Haitao},
  ee = {https://doi.org/10.4230/LIPIcs.SoCG.2025.59},
  interhash = {59be292efa051138437722b59cd0e9dd},
  intrahash = {cd6f59bd07efc1883c924b1337cbe8a5},
  isbn = {978-3-95977-370-6},
  keywords = {dblp},
  pages = {59:1-59:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  series = {LIPIcs},
  timestamp = {2025-11-24T08:41:37.000+0100},
  title = {Incremental Planar Nearest Neighbor Queries with Optimal Query Time.},
  url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom2025.html#IaconoN25},
  volume = 332,
  year = 2025
}

{"_id":"p2q4cRyZgAeoFsTEF","bibbaseid":"iacono-nekrich-incrementalplanarnearestneighborquerieswithoptimalquerytime-2025","author_short":["Iacono, J.","Nekrich, Y."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2025-06-20T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Iacono"],"firstnames":["John"],"suffixes":[]},{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2cd6f59bd07efc1883c924b1337cbe8a5/dblp","booktitle":"SoCG","crossref":"conf/compgeom/2025","editor":[{"propositions":[],"lastnames":["Aichholzer"],"firstnames":["Oswin"],"suffixes":[]},{"propositions":[],"lastnames":["Wang"],"firstnames":["Haitao"],"suffixes":[]}],"ee":"https://doi.org/10.4230/LIPIcs.SoCG.2025.59","interhash":"59be292efa051138437722b59cd0e9dd","intrahash":"cd6f59bd07efc1883c924b1337cbe8a5","isbn":"978-3-95977-370-6","keywords":"dblp","pages":"59:1-59:15","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","series":"LIPIcs","timestamp":"2025-11-24T08:41:37.000+0100","title":"Incremental Planar Nearest Neighbor Queries with Optimal Query Time.","url":"http://dblp.uni-trier.de/db/conf/compgeom/compgeom2025.html#IaconoN25","volume":"332","year":"2025","bibtex":"@inproceedings{conf/compgeom/IaconoN25,\n added-at = {2025-06-20T00:00:00.000+0200},\n author = {Iacono, John and Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/2cd6f59bd07efc1883c924b1337cbe8a5/dblp},\n booktitle = {SoCG},\n crossref = {conf/compgeom/2025},\n editor = {Aichholzer, Oswin and Wang, Haitao},\n ee = {https://doi.org/10.4230/LIPIcs.SoCG.2025.59},\n interhash = {59be292efa051138437722b59cd0e9dd},\n intrahash = {cd6f59bd07efc1883c924b1337cbe8a5},\n isbn = {978-3-95977-370-6},\n keywords = {dblp},\n pages = {59:1-59:15},\n publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},\n series = {LIPIcs},\n timestamp = {2025-11-24T08:41:37.000+0100},\n title = {Incremental Planar Nearest Neighbor Queries with Optimal Query Time.},\n url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom2025.html#IaconoN25},\n volume = 332,\n year = 2025\n}\n\n","author_short":["Iacono, J.","Nekrich, Y."],"editor_short":["Aichholzer, O.","Wang, H."],"key":"conf/compgeom/IaconoN25","id":"conf/compgeom/IaconoN25","bibbaseid":"iacono-nekrich-incrementalplanarnearestneighborquerieswithoptimalquerytime-2025","role":"author","urls":{"Link":"https://doi.org/10.4230/LIPIcs.SoCG.2025.59","Paper":"http://dblp.uni-trier.de/db/conf/compgeom/compgeom2025.html#IaconoN25"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"downloads":83},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","dataSources":["f7XsgZohqQ3Rphbct","TH39dxxDw4bYtimv9","rdqHFij9336BE6RXC","bnKvTxKLeKDH6MLN5","Ruqhq77ukPwPpsgnH","6xWHKBRywxySpTkQp","eN2LQ6FcBMvm9sTbz","DnpduLWKPCPjAnwqH","WrJdT7FZJEnWCquTR","CkG7HF5wYYtAeFEpt","XwZ8GDTGi5Ryg986e","gp39AfTn5aMK5vFFX","TL8Lwv2zyLh5YTdWk","3HYs8mxx93dRKoCSd","yFjLCu5EymnntknZ2","6dytGs4RLNqJ3dzn9","yLcnXydQNrXokL9ED","uYpjX4Tydj6EdGyBS","ny6szHXaFWH4EmJPN","76PqYdvB7R2uvhzbJ","8QvwKFvDbcanc3Ban","xypEAnR9dqsezJahQ"],"keywords":["dblp"],"search_terms":["incremental","planar","nearest","neighbor","queries","optimal","query","time","iacono","nekrich"],"title":"Incremental Planar Nearest Neighbor Queries with Optimal Query Time.","year":2025,"downloads":83}