On the public citation graph

K-Closest Pairs Queries in Road Networks

0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-04298-5_42openalex-snapshot
A New Plane-Sweep Algorithm for the K-Closest-Pairs Query
inferredcites →https://doi.org/10.1007/978-3-642-41062-8_13openalex-snapshot
Quicker Similarity Joins in Metric Spaces
inferredcites →https://doi.org/10.1007/978-3-642-41062-8_27openalex-snapshot
Database Similarity Join for Metric Spaces
inferredcites →https://doi.org/10.1007/s00778-015-0383-4openalex-snapshot
Efficient $$k$$ k -closest pair queries in general metric spaces
inferredcites →https://doi.org/10.1016/j.datak.2003.08.007openalex-snapshot
Algorithms for processing K-closest-pair queries in spatial databases
inferredcites →https://doi.org/10.1016/j.jda.2008.09.012openalex-snapshot
Solving similarity joins and range queries in metric spaces with the list of twin clusters
inferredcites →https://doi.org/10.1109/ideas.2002.1029666openalex-snapshot
An index structure for improving closest pairs and related join queries in spatial databases
inferredcites →https://doi.org/10.1109/tkde.2003.1245293openalex-snapshot
Adaptive and incremental processing for distance join queries
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1366102.1366104openalex-snapshot
Metric space similarity joins
inferredcites →https://doi.org/10.1145/1806907.1806912openalex-snapshot
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space
inferredcites →https://doi.org/10.1145/1966865.1966870openalex-snapshot
Finding the k-closest pairs in metric spaces
inferredcites →https://doi.org/10.1145/224170.224229openalex-snapshot
Analysis of multilevel graph partitioning
inferredcites →https://doi.org/10.1145/2487575.2487625openalex-snapshot
Scalable all-pairs similarity search in metric spaces
inferredcites →https://doi.org/10.1145/2505515.2505749openalex-snapshot
G-tree
inferredcites →https://doi.org/10.1145/276304.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferredcites →https://doi.org/10.1145/276305.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferredcites →https://doi.org/10.1145/335191.335428openalex-snapshot
Adaptive multi-stage distance join processing
inferredcites →https://doi.org/10.14778/2732977.2732981openalex-snapshot
ClusterJoin

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00521-022-07485-xopenalex-snapshot
Most relevant point query on road networks
inferred← citeshttps://doi.org/10.1007/s10707-017-0309-yopenalex-snapshot
Efficient large-scale distance-based join queries in spatialhadoop
inferred← citeshttps://doi.org/10.1007/s44245-026-00370-0openalex-snapshot
UAV integrated IoT sensing platform for sustainable air quality monitoring and real time AQI estimation
inferred← citeshttps://doi.org/10.1016/j.compenvurbsys.2021.101618openalex-snapshot
Large scale geospatial data conflation: A feature matching framework based on optimization and divide-and-conquer
inferred← citeshttps://doi.org/10.1016/j.is.2019.101419openalex-snapshot
A top- k spatial join querying processing algorithm based on spark
inferred← citeshttps://doi.org/10.1016/j.jag.2022.103057openalex-snapshot
Optimal road matching by relaxation to min-cost network flow
inferred← citeshttps://doi.org/10.1080/13658816.2020.1778001openalex-snapshot
Geospatial data conflation: a formal approach based on optimization and relational databases
inferred← citeshttps://doi.org/10.1109/access.2020.2985103openalex-snapshot
Cloud-Based K-Closest Pairs Discovery in Dynamic Cyber-Physical-Social Systems
inferred← citeshttps://doi.org/10.1111/tgis.12561openalex-snapshot
Optimal spatial data matching for conflation: A network flow‐based approach
inferred← citeshttps://doi.org/10.1111/tgis.12726openalex-snapshot
Conflating linear features using turning function distance: A new orientation‐sensitive similarity measure
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.