On the public citation graph

Continuous Detour Queries in Spatial Networks

https://doi.org/10.1109/tkde.2011.52
0 signed · 50 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.1002/9780470317013openalex-snapshot
Spatial Tessellations
inferredcites →https://doi.org/10.1007/11535331_16openalex-snapshot
On Trip Planning Queries in Spatial Databases
inferredcites →https://doi.org/10.1007/11863939_17openalex-snapshot
Incremental Rank Updates for Moving Query Points
inferredcites →https://doi.org/10.1007/978-3-642-02982-0_5openalex-snapshot
Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction
inferredcites →https://doi.org/10.1007/978-3-642-40235-7_15openalex-snapshot
Group Trip Planning Queries in Spatial Databases
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf02726349openalex-snapshot
Extending the Concept of Shopping: An Investigation of Browsing Activity
inferredcites →https://doi.org/10.1007/s00778-006-0038-6openalex-snapshot
The optimal sequenced route query
inferredcites →https://doi.org/10.1007/s00778-008-0115-0openalex-snapshot
Instance optimal query processing in spatial networks
inferredcites →https://doi.org/10.1007/s00778-009-0163-0openalex-snapshot
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
inferredcites →https://doi.org/10.1007/s10109-008-0067-3openalex-snapshot
Group K-Nearest Neighbors queries in spatial network databases
inferredcites →https://doi.org/10.1007/s10707-005-4575-8openalex-snapshot
Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases
inferredcites →https://doi.org/10.1007/s10707-005-6671-1openalex-snapshot
In-Route Nearest Neighbor Queries
inferredcites →https://doi.org/10.1007/s10707-007-0034-zopenalex-snapshot
Processing Optimal Sequenced Route Queries Using Voronoi Diagrams
inferredcites →https://doi.org/10.1016/b978-012088469-8.50074-7openalex-snapshot
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
inferredcites →https://doi.org/10.1016/b978-012722442-8/50076-8openalex-snapshot
Query Processing in Spatial Network Databases
inferredcites →https://doi.org/10.1080/13658810701587891openalex-snapshot
Generalized network Voronoi diagrams: Concepts, computational methods, and applications
inferredcites →https://doi.org/10.1108/03090560310495401openalex-snapshot
Buying or browsing?
inferredcites →https://doi.org/10.1109/icde.2010.5447864openalex-snapshot
Multi-guarded safe zone: An effective technique to monitor moving circular range queries
inferredcites →https://doi.org/10.1109/tkde.2005.87openalex-snapshot
Aggregate nearest neighbor queries in road networks
inferredcites →https://doi.org/10.1145/1071610.1071616openalex-snapshot
Aggregate nearest neighbor queries in spatial databases
inferredcites →https://doi.org/10.1145/1277741.1277787openalex-snapshot
Investigating the querying and browsing behavior of advanced search engine users
inferredcites →https://doi.org/10.1145/1376616.1376623openalex-snapshot
Scalable network distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/1559845.1559907openalex-snapshot
Monitoring path nearest neighbor in road networks
inferredcites →https://doi.org/10.1145/335191.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/342009.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/872757.872812openalex-snapshot
Location-based spatial queries
inferredcites →https://doi.org/10.1207/153276603768344762openalex-snapshot
Buying, Searching, or Browsing: Differentiating Between Online Shoppers Using In-Store Navigational Clickstream
inferredcites →https://doi.org/10.5555/1182635.1164133openalex-snapshot
Continuous nearest neighbor monitoring in road networks

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-44039-2_14openalex-snapshot
Continuous Trip Route Planning Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-40173-2_20openalex-snapshot
Continuous Predictive Line Queries under Road-Network Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-46485-4_4openalex-snapshot
Continuous Predictive Line Queries for On-the-Go Traffic Estimation
inferred← citeshttps://doi.org/10.1007/s00778-011-0259-1openalex-snapshot
A highly optimized algorithm for continuous intersection join queries over moving objects
inferred← citeshttps://doi.org/10.1007/s10707-014-0204-8openalex-snapshot
Efficient continuous top-k spatial keyword queries on road networks
inferred← citeshttps://doi.org/10.1007/s10707-023-00497-2openalex-snapshot
Opportunistic package delivery as a service on road networks
inferred← citeshttps://doi.org/10.1016/bs.adcom.2016.05.003openalex-snapshot
Indexing and Querying Techniques for Moving Objects in Both Euclidean Space and Road Network
inferred← citeshttps://doi.org/10.1016/j.is.2014.12.005openalex-snapshot
On using broadcast index for efficient execution of shortest path continuous queries
inferred← citeshttps://doi.org/10.1016/j.is.2017.08.009openalex-snapshot
Energy-efficient air-indices for shortest path and distance queries on road networks
inferred← citeshttps://doi.org/10.1109/icde.2012.53openalex-snapshot
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00062openalex-snapshot
Efficient Route and Area Matching Query in Dynamic Road Networks
inferred← citeshttps://doi.org/10.1109/iiai-aai.2016.203openalex-snapshot
A Map Database System for Route Navigation with Multiple Transit Points and Destination Points
inferred← citeshttps://doi.org/10.1109/platcon.2016.7456824openalex-snapshot
Shortest Path Navigation for a Mix of Undirected and One-Way Roads Using k-SPT Method
inferred← citeshttps://doi.org/10.1109/tkde.2012.253openalex-snapshot
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
inferred← citeshttps://doi.org/10.1109/tkde.2022.3217394openalex-snapshot
A Time Impulse Neural Network Framework for Solving the Minimum Path Pair Problems of the Time-Varying Network
inferred← citeshttps://doi.org/10.1109/tmc.2022.3168553openalex-snapshot
Time-Dependent Visiting Trip Planning with Crowd Density Prediction Based on Internet of Things Localization
inferred← citeshttps://doi.org/10.1145/2845080openalex-snapshot
Privacy-Aware Dynamic Ride Sharing
inferred← citeshttps://doi.org/10.1145/3283207.3283215openalex-snapshot
Is Euclidean Distance Really that Bad with Road Networks?
inferred← citeshttps://doi.org/10.1145/3340964.3340977openalex-snapshot
Continuous Detour Queries in Indoor Venues
inferred← citeshttps://doi.org/10.3389/fenvs.2025.1540620openalex-snapshot
Unlocking urban transportation carbon reduction potential: a dynamic evaluation of public transit adoption in response to carbon-centric policies
inferred← citeshttps://doi.org/10.3390/ijgi12070277openalex-snapshot
In-Path Oracles for Road Networks
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.