On the public citation graph
On Trip Planning Queries in Spatial Databases
0 signed · 373 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230260407openalex-snapshot
On the generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1006/jagm.2000.1096openalex-snapshot
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
inferredcites →https://doi.org/10.1007/3-540-47724-1_14openalex-snapshot
Constrained Nearest Neighbor Queries
inferredcites →https://doi.org/10.1007/3-540-47724-1_2openalex-snapshot
A Spatiotemporal Model and Language for Moving Objects on Road Networks
inferredcites →https://doi.org/10.1007/3-540-53832-1_36openalex-snapshot
Bounds on the quality of approximate solutions to the group Steiner problem
inferredcites →https://doi.org/10.1007/3-540-62222-5_55openalex-snapshot
Adding structure to unstructured data
inferredcites →https://doi.org/10.1007/3-540-62222-5_59openalex-snapshot
Performance of nearest neighbor queries in R-trees
inferredcites →https://doi.org/10.1007/978-3-319-64367-0openalex-snapshot
Advances in Spatial and Temporal Databases
inferredcites →https://doi.org/10.1007/s00778-006-0038-6openalex-snapshot
The optimal sequenced route query
inferredcites →https://doi.org/10.1007/s10107-003-0438-yopenalex-snapshot
Approximation schemes for NP-hard geometric optimization problems: a survey
inferredcites →https://doi.org/10.1007/s43069-021-00101-zopenalex-snapshot
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
inferredcites →https://doi.org/10.1016/0020-0190(90)90028-vopenalex-snapshot
Analyzing the Held-Karp tsp bound: a monotonicity property with application
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.1016/b978-155860869-6/50033-0openalex-snapshot
Continuous Nearest Neighbor Search
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.011openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.1023/a:1015231126594openalex-snapshot
A Framework for Generating Network-Based Moving Objects
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/69.567054openalex-snapshot
CCAM: a connectivity-clustered access method for networks and network computations
inferredcites →https://doi.org/10.1109/69.842247openalex-snapshot
Efficient cost models for spatial queries using R-trees
inferredcites →https://doi.org/10.1109/icde.2004.1320006openalex-snapshot
Group nearest neighbor queries
inferredcites →https://doi.org/10.1109/icde.2005.128openalex-snapshot
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
inferredcites →https://doi.org/10.1109/ideas.2002.1029655openalex-snapshot
Nearest neighbor and reverse nearest neighbor queries for moving objects
inferredcites →https://doi.org/10.1109/sfcs.1996.548458openalex-snapshot
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
inferredcites →https://doi.org/10.1109/ssdbm.2004.61openalex-snapshot
Scalable spatio-temporal continuous query processing for location-aware services
inferredcites →https://doi.org/10.1109/tkde.2004.48openalex-snapshot
An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces
inferredcites →https://doi.org/10.1145/1007352.1007385openalex-snapshot
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
inferredcites →https://doi.org/10.1145/1007568.1007619openalex-snapshot
Clustering objects on a spatial network
inferredcites →https://doi.org/10.1145/263661.263671openalex-snapshot
A cost model for nearest neighbor search in high-dimensional data space
inferredcites →https://doi.org/10.1145/320248.320255openalex-snapshot
Distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/335191.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/342009.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/352958.352963openalex-snapshot
A foundation for representing and querying moving objects
inferredcites →https://doi.org/10.1145/357775.357776openalex-snapshot
A cost model for query processing in high dimensional data spaces
inferredcites →https://doi.org/10.1145/380752.380813openalex-snapshot
Smoothed analysis of algorithms
inferredcites →https://doi.org/10.1145/564691.564730openalex-snapshot
Time-parameterized queries in spatio-temporal databases
inferredcites →https://doi.org/10.1145/585147.585167openalex-snapshot
A road network embedding technique for k-nearest neighbor search in moving object databases
inferredcites →https://doi.org/10.1145/93597.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.1145/990308.990310openalex-snapshot
Smoothed analysis of algorithms
inferredcites →https://doi.org/10.5555/320176.320224openalex-snapshot
On the parsimonious property of connectivity problems
inferredcites →https://doi.org/10.5555/365411.365417openalex-snapshot
Approximation algorithms for TSP with neighborhoods in the plane
inferredcites →https://doi.org/10.5555/545381.545387openalex-snapshot
An approximation algorithm for the group Steiner problem
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-0-387-35973-1_1416openalex-snapshot
Trip Planning Queries in Road Network Databases
inferred← citeshttps://doi.org/10.1007/978-0-387-35973-1_1462openalex-snapshot
Voronoi Diagrams for Query Processing
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_80712openalex-snapshot
Trip Planning Queries
inferred← citeshttps://doi.org/10.1007/978-1-4939-0392-4_4openalex-snapshot
Mobility Database Management
inferred← citeshttps://doi.org/10.1007/978-3-030-00916-8_10openalex-snapshot
Constrained Route Planning Based on the Regular Expression
inferred← citeshttps://doi.org/10.1007/978-3-030-15032-7_78openalex-snapshot
Retrieving Text-Based Surrounding Objects in Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-3-030-30146-0_12openalex-snapshot
Itinerary Recommendation for User Groups in Temporary Social Network
inferred← citeshttps://doi.org/10.1007/978-3-030-35231-8_54openalex-snapshot
An Efficient Multi-request Route Planning Framework Based on Grid Index and Heuristic Function
inferred← citeshttps://doi.org/10.1007/978-3-030-57811-4_7openalex-snapshot
Strategies for Alternate Group Trip Planning Queries in Location-Based Services
inferred← citeshttps://doi.org/10.1007/978-3-030-73194-6_31openalex-snapshot
Optimal Sequenced Route Query with POI Preferences
inferred← citeshttps://doi.org/10.1007/978-3-030-73280-6_51openalex-snapshot
An Efficient Method for Multi-request Route Search
inferred← citeshttps://doi.org/10.1007/978-3-030-95405-5_18openalex-snapshot
Group Trip Planning Queries on Road Networks Using Geo-Tagged Textual Information
inferred← citeshttps://doi.org/10.1007/978-3-031-23020-2_24openalex-snapshot
Privacy-Preserving Online Ride-Hailing Matching System with an Untrusted Server
inferred← citeshttps://doi.org/10.1007/978-3-031-42430-4_16openalex-snapshot
Group Trip Planning Approach with Travel Time and Ratio Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-46661-8_38openalex-snapshot
Deep Reinforcement Learning for Solving the Trip Planning Query
inferred← citeshttps://doi.org/10.1007/978-3-032-02088-8_11openalex-snapshot
Group Trip Planning Query Problem with Multimodal Journey
inferred← citeshttps://doi.org/10.1007/978-3-319-08010-9_35openalex-snapshot
P3RN:Personalized Privacy Protection Using Query Semantics over Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-10073-9_17openalex-snapshot
Efficient Evacuation Planning for Large Cities
inferred← citeshttps://doi.org/10.1007/978-3-319-10085-2_25openalex-snapshot
Voronoi-Based Spatial Cloaking Algorithm over Road Network
inferred← citeshttps://doi.org/10.1007/978-3-319-11116-2_31openalex-snapshot
Multi-constrained Optimal Path Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-11538-2_21openalex-snapshot
Rating Aware Route Planning in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1416openalex-snapshot
Trip Planning Queries in Road Network Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1434openalex-snapshot
Vague Spatial Data Types
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1462openalex-snapshot
Voronoi Diagrams for Query Processing
inferred← citeshttps://doi.org/10.1007/978-3-319-18120-2_16openalex-snapshot
Efficient Trip Planning for Maximizing User Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-319-18123-3_12openalex-snapshot
Skyline Trips of Multiple POIs Categories
inferred← citeshttps://doi.org/10.1007/978-3-319-18123-3_13openalex-snapshot
Keyword-Aware Dominant Route Search for Various User Preferences
inferred← citeshttps://doi.org/10.1007/978-3-319-22363-6_24openalex-snapshot
RCP Mining: Towards the Summarization of Spatial Co-location Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-22363-6_8openalex-snapshot
Oriented Online Route Recommendation for Spatial Crowdsourcing Task Workers
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_1462-2openalex-snapshot
Voronoi Diagrams for Query Processing
inferred← citeshttps://doi.org/10.1007/978-3-319-39937-9_9openalex-snapshot
Retrieving Routes of Interest Over Road Networks
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-319-45814-4_1openalex-snapshot
Probabilistic Nearest Neighbor Query in Traffic-Aware Spatial Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-45814-4_6openalex-snapshot
Mining Co-locations from Continuously Distributed Uncertain Spatial Data
inferred← citeshttps://doi.org/10.1007/978-3-319-46922-5_10openalex-snapshot
A Sketch-First Approach for Finding TSP
inferred← citeshttps://doi.org/10.1007/978-3-319-64367-0_1openalex-snapshot
Multi-user Itinerary Planning for Optimal Group Preference
inferred← citeshttps://doi.org/10.1007/978-3-319-72413-3_11openalex-snapshot
Trip Planning and Scheduling Queries in Spatial Databases: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-97571-9_28openalex-snapshot
The Algorithm for Constrained Shortest Path Problem Based on Incremental Lagrangian Dual Solution
inferred← citeshttps://doi.org/10.1007/978-3-540-76925-5_15openalex-snapshot
Towards the Next Generation of Location-Based Services
inferred← citeshttps://doi.org/10.1007/978-3-642-02982-0_12openalex-snapshot
Route Search over Probabilistic Geospatial Data
inferred← citeshttps://doi.org/10.1007/978-3-642-03730-6_33openalex-snapshot
Finding N-Most Prevalent Colocated Event Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-13199-8_9openalex-snapshot
Dynamic Transportation Navigation
inferred← citeshttps://doi.org/10.1007/978-3-642-20149-3_17openalex-snapshot
STS: Complex Spatio-Temporal Sequence Mining in Flickr
inferred← citeshttps://doi.org/10.1007/978-3-642-20539-2_24openalex-snapshot
The Detection of Scene Features in Flickr
inferred← citeshttps://doi.org/10.1007/978-3-642-28635-3_5openalex-snapshot
Single-Source Multi-Target A* Algorithm for POI Queries on Road Network
inferred← citeshttps://doi.org/10.1007/978-3-642-29038-1_41openalex-snapshot
Traffic Aware Route Planning in Dynamic Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-32281-5_19openalex-snapshot
Optimal Sequenced Route Query Algorithm Using Visited POI Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-32600-4_36openalex-snapshot
Sequenced Route Query in Road Network Distance Based on Incremental Euclidean Restriction
inferred← citeshttps://doi.org/10.1007/978-3-642-37087-8_5openalex-snapshot
Tour Suggestion for Outdoor Activities
inferred← citeshttps://doi.org/10.1007/978-3-642-39527-7_17openalex-snapshot
Cluster-By: An Efficient Clustering Operator in Emergency Management Database Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40235-7_15openalex-snapshot
Group Trip Planning Queries in Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-981-10-2525-9_38openalex-snapshot
Collectively Find Spatial Objects in Time-Dependent Spatial Network
inferred← citeshttps://doi.org/10.1007/978-981-13-2922-7_9openalex-snapshot
Multi-constrained Dominate Route Queries in Time-Dependent Road Networks
inferred← citeshttps://doi.org/10.1007/978-981-15-7981-3_9openalex-snapshot
Location Privacy-Preserving Method Based on Degree of Semantic Distribution Similarity
inferred← citeshttps://doi.org/10.1007/978-981-97-2303-4_20openalex-snapshot
Keywords and Stops Aware Optimal Routes on Road Networks
inferred← citeshttps://doi.org/10.1007/s00778-006-0038-6openalex-snapshot
The optimal sequenced route query
inferred← citeshttps://doi.org/10.1007/s00778-010-0200-zopenalex-snapshot
Continuous visible nearest neighbor query processing in spatial databases
inferred← citeshttps://doi.org/10.1007/s00778-012-0274-xopenalex-snapshot
The exact distance to destination in undirected world
inferred← citeshttps://doi.org/10.1007/s00779-016-0913-0openalex-snapshot
k-Multi-preference query over road networks
inferred← citeshttps://doi.org/10.1007/s10115-013-0686-yopenalex-snapshot
Efficient processing of optimal meeting point queries in Euclidean space and road networks
inferred← citeshttps://doi.org/10.1007/s10115-018-1217-7openalex-snapshot
Personalized itinerary recommendation with time constraints using GPS datasets
inferred← citeshttps://doi.org/10.1007/s10115-020-01446-3openalex-snapshot
On spatial keyword covering
inferred← citeshttps://doi.org/10.1007/s10586-017-0975-4openalex-snapshot
Hybrid spatial air index for processing queries in road networks
inferred← citeshttps://doi.org/10.1007/s10618-011-0223-0openalex-snapshot
Mining spatial colocation patterns: a different framework
inferred← citeshttps://doi.org/10.1007/s10619-014-7146-xopenalex-snapshot
Efficient route search on hierarchical dynamic road networks
inferred← citeshttps://doi.org/10.1007/s10707-007-0034-zopenalex-snapshot
Processing Optimal Sequenced Route Queries Using Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/s10707-010-0115-2openalex-snapshot
The partial sequenced route query with traveling rules in road networks
inferred← citeshttps://doi.org/10.1007/s10707-013-0185-zopenalex-snapshot
TARS: traffic-aware route search
inferred← citeshttps://doi.org/10.1007/s10707-016-0251-4openalex-snapshot
Task selection in spatial crowdsourcing from worker’s perspective
inferred← citeshttps://doi.org/10.1007/s10707-016-0271-0openalex-snapshot
Exploiting location-aware social networks for efficient spatial query processing
inferred← citeshttps://doi.org/10.1007/s10707-017-0306-1openalex-snapshot
Knowledge extraction from crowdsourced data for the enrichment of road networks
inferred← citeshttps://doi.org/10.1007/s10707-018-0331-8openalex-snapshot
Optimal group route query: Finding itinerary for group of users in spatial databases
inferred← citeshttps://doi.org/10.1007/s10707-021-00440-3openalex-snapshot
Reverse keyword-based location search on road networks
inferred← citeshttps://doi.org/10.1007/s10707-023-00489-2openalex-snapshot
Time-constrained indoor keyword-aware routing: foundations and extensions
inferred← citeshttps://doi.org/10.1007/s10707-023-00509-1openalex-snapshot
Efficient algorithms for community aware ridesharing
inferred← citeshttps://doi.org/10.1007/s10707-026-00577-zopenalex-snapshot
A parallelizable algorithm for constrained maximization of preferences in large time-dependent graphs
inferred← citeshttps://doi.org/10.1007/s10878-022-00878-7openalex-snapshot
An efficient approach for searching optimal multi-keywords coverage routes
inferred← citeshttps://doi.org/10.1007/s11227-022-04601-5openalex-snapshot
Nearly most influential location selection with differentially private user locations in a road network
inferred← citeshttps://doi.org/10.1007/s11280-015-0352-2openalex-snapshot
On personalized and sequenced route planning
inferred← citeshttps://doi.org/10.1007/s11280-016-0384-2openalex-snapshot
Trip planning queries with location privacy in spatial databases
inferred← citeshttps://doi.org/10.1007/s11280-016-0425-xopenalex-snapshot
Discovery of probabilistic nearest neighbors in traffic-aware spatial networks
inferred← citeshttps://doi.org/10.1007/s11280-018-0643-5openalex-snapshot
IG-Tree: an efficient spatial keyword index for planning best path queries on road networks
inferred← citeshttps://doi.org/10.1007/s11280-019-00694-wopenalex-snapshot
Direction-based spatial skyline for retrieving surrounding objects
inferred← citeshttps://doi.org/10.1007/s11280-023-01188-6openalex-snapshot
Efficiently computing alternative paths in game maps
inferred← citeshttps://doi.org/10.1007/s11390-015-1557-7openalex-snapshot
VID Join: Mapping Trajectories to Points of Interest to Support Location-Based Services
inferred← citeshttps://doi.org/10.1007/s11390-015-1560-zopenalex-snapshot
On Efficient Aggregate Nearest Neighbor Query Processing in Road Networks
inferred← citeshttps://doi.org/10.1007/s11390-022-2330-3openalex-snapshot
GAM: A GPU-Accelerated Algorithm for MaxRS Queries in Road Networks
inferred← citeshttps://doi.org/10.1007/s11704-015-4528-9openalex-snapshot
Protecting personalized privacy against sensitivity homogeneity attacks over road networks in mobile services
inferred← citeshttps://doi.org/10.1007/s12559-018-9600-yopenalex-snapshot
Trust-Aware Personalized Route Query Using Extreme Learning Machine in Location-Based Social Networks
inferred← citeshttps://doi.org/10.1007/s12652-017-0470-zopenalex-snapshot
Optimal hybrid broadcast scheduling and adaptive cooperative caching for spatial queries in road networks
inferred← citeshttps://doi.org/10.1007/s41019-016-0030-0openalex-snapshot
Investigating TSP Heuristics for Location-Based Services
inferred← citeshttps://doi.org/10.1007/s41019-021-00153-5openalex-snapshot
Querying Optimal Routes for Group Meetup
inferred← citeshttps://doi.org/10.1007/s41019-022-00177-5openalex-snapshot
Top k Optimal Sequenced Route Query with POI Preferences
inferred← citeshttps://doi.org/10.1016/j.adhoc.2021.102740openalex-snapshot
AI-enabled privacy-preservation phrase with multi-keyword ranked searching for sustainable edge-cloud networks in the era of industrial IoT
inferred← citeshttps://doi.org/10.1016/j.bdr.2021.100246openalex-snapshot
Route Search and Planning: A Survey
inferred← citeshttps://doi.org/10.1016/j.comnet.2019.107029openalex-snapshot
A cost efficient multi remote driver selection for remote operated vehicles
inferred← citeshttps://doi.org/10.1016/j.datak.2011.06.003openalex-snapshot
On multi-type reverse nearest neighbor search
inferred← citeshttps://doi.org/10.1016/j.datak.2022.102006openalex-snapshot
Location-privacy preserving partial nearby friends querying in urban areas
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.08.008openalex-snapshot
Models and algorithms for network reduction
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.06.031openalex-snapshot
A Branch&Cut approach to recharging and refueling infrastructure planning
inferred← citeshttps://doi.org/10.1016/j.elerap.2016.03.005openalex-snapshot
User privacy protection for a mobile commerce alliance
inferred← citeshttps://doi.org/10.1016/j.enpol.2014.08.015openalex-snapshot
Impacts of battery characteristics, driver preferences and road network features on travel costs of a plug-in hybrid electric vehicle (PHEV) for long-distance trips
inferred← citeshttps://doi.org/10.1016/j.future.2019.03.010openalex-snapshot
On workflow aware location-based service composition for personal trip planning
inferred← citeshttps://doi.org/10.1016/j.ins.2016.10.033openalex-snapshot
Level-aware collective spatial keyword queries
inferred← citeshttps://doi.org/10.1016/j.ins.2018.06.036openalex-snapshot
Place Your Next Branch with MILE-RUN: Min-dist Location Selection over User Movement
inferred← citeshttps://doi.org/10.1016/j.is.2007.04.001openalex-snapshot
Clustering spatial networks for aggregate query processing: A hypergraph approach
inferred← citeshttps://doi.org/10.1016/j.is.2009.03.005openalex-snapshot
A link-based storage scheme for efficient aggregate query processing on clustered road networks
inferred← citeshttps://doi.org/10.1016/j.is.2012.02.003openalex-snapshot
Continuous distance-based skyline queries in road networks
inferred← citeshttps://doi.org/10.1016/j.is.2019.03.013openalex-snapshot
Reverse collective spatial keyword query processing on road networks with G-tree index structure
inferred← citeshttps://doi.org/10.1016/j.is.2019.04.006openalex-snapshot
Efficient trip scheduling algorithms for groups
inferred← citeshttps://doi.org/10.1016/j.is.2019.101453openalex-snapshot
Efficient Path Routing Over Road Networks in the Presence of Ad-Hoc Obstacles
inferred← citeshttps://doi.org/10.1016/j.is.2020.101530openalex-snapshot
Efficient processing of reverse nearest neighborhood queries in spatial databases
inferred← citeshttps://doi.org/10.1016/j.is.2021.101925openalex-snapshot
An efficient and scalable method for aggregate nearest neighbor queries on time-dependent road networks
inferred← citeshttps://doi.org/10.1016/j.jda.2014.10.006openalex-snapshot
Range search on tuples of points
inferred← citeshttps://doi.org/10.1016/j.jisa.2019.102391openalex-snapshot
Order-preserving encryption using approximate common divisors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.07.013openalex-snapshot
Privacy-preserving k nearest neighbor query with authentication on road networks
inferred← citeshttps://doi.org/10.1016/j.jss.2012.12.034openalex-snapshot
Continuous range k-nearest neighbor queries in vehicular ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.neucom.2015.06.086openalex-snapshot
Finding regions of interest using location based social media
inferred← citeshttps://doi.org/10.1016/j.orl.2008.06.008openalex-snapshot
Computing shortest heterochromatic monotone routes
inferred← citeshttps://doi.org/10.1016/j.suscom.2019.100351openalex-snapshot
Social network sustainability for transport planning with complex interconnections
inferred← citeshttps://doi.org/10.1016/j.tre.2015.05.011openalex-snapshot
Minimum cost path problem for Plug-in Hybrid Electric Vehicles
inferred← citeshttps://doi.org/10.1038/sdata.2016.46openalex-snapshot
A protocol to convert spatial polyline data to network formats and applications to world urban road networks
inferred← citeshttps://doi.org/10.1109/access.2016.2602702openalex-snapshot
Skyline Path Queries With Aggregate Attributes
inferred← citeshttps://doi.org/10.1109/access.2019.2923459openalex-snapshot
Group-Wise Itinerary Planning in Temporary Mobile Social Network
inferred← citeshttps://doi.org/10.1109/access.2019.2937667openalex-snapshot
Gridvoronoi: An Efficient Spatial Index for Nearest Neighbor Query Processing
inferred← citeshttps://doi.org/10.1109/access.2020.2990706openalex-snapshot
Maximum Influential Location Selection With Differentially Private User Locations
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9377976openalex-snapshot
Massively Parallel Graph Drawing and Representation Learning
inferred← citeshttps://doi.org/10.1109/ccece47787.2020.9255682openalex-snapshot
Dynamic Group Trip Planning Queries in Spatial Databases
inferred← citeshttps://doi.org/10.1109/cec.2016.7743866openalex-snapshot
Application of NSGA-II framework to the travel planning problem using real-world travel data
inferred← citeshttps://doi.org/10.1109/cict.2013.6558175openalex-snapshot
Route planning via facilities in time dependent network
inferred← citeshttps://doi.org/10.1109/csf.2015.12openalex-snapshot
Location Privacy via Differential Private Perturbation of Cloaking Area
inferred← citeshttps://doi.org/10.1109/dasc-picom-datacom-cyberscitec.2017.158openalex-snapshot
General Time-Dependent Sequenced Route Queries in Road Networks
inferred← citeshttps://doi.org/10.1109/docs63458.2024.10704489openalex-snapshot
Research on Travel Route Planning Optimization based on Large Language Model
inferred← citeshttps://doi.org/10.1109/geoprocessing.2010.27openalex-snapshot
C*: A Bivariate Best First Search to Process Category Sequence Traversal Queries in a Transportation Network
inferred← citeshttps://doi.org/10.1109/ia356718.2022.00012openalex-snapshot
Accelerating Datalog applications with cuDF
inferred← citeshttps://doi.org/10.1109/icbk.2019.00014openalex-snapshot
Continuous Path-Based Range Keyword Queries on Road Networks
inferred← citeshttps://doi.org/10.1109/icce-berlin.2018.8576185openalex-snapshot
A Multiple Cyclic-Route Generation Method for Strolling Based on Point-of-Interests
inferred← citeshttps://doi.org/10.1109/iccic.2016.7919596openalex-snapshot
Round-trip nearest neighbors on road networks for location based services
inferred← citeshttps://doi.org/10.1109/iccit64611.2024.11022147openalex-snapshot
Obstructed Group Trip Planning Queries in Spatial Databases
inferred← citeshttps://doi.org/10.1109/icde.2011.5767844openalex-snapshot
A continuous query system for dynamic route planning
inferred← citeshttps://doi.org/10.1109/icde.2013.6544888openalex-snapshot
Engineering Generalized Shortest Path queries
inferred← citeshttps://doi.org/10.1109/icde.2013.6544939openalex-snapshot
KORS: Keyword-aware Optimal Route Search System
inferred← citeshttps://doi.org/10.1109/icde.2016.7498281openalex-snapshot
Finding the minimum spatial keyword cover
inferred← citeshttps://doi.org/10.1109/icde.2017.171openalex-snapshot
Mining Spatio-Temporal Reachable Regions over Massive Trajectory Data
inferred← citeshttps://doi.org/10.1109/icde.2018.00058openalex-snapshot
Finding Top-k Optimal Sequenced Routes
inferred← citeshttps://doi.org/10.1109/icde.2018.00249openalex-snapshot
Efficient Clue-Based Route Search on Road Networks (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/icde.2019.00060openalex-snapshot
Route Recommendations on Road Networks for Arbitrary User Preference Functions
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00109openalex-snapshot
Indoor Top-k Keyword-aware Routing Query
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00029openalex-snapshot
Constrained Path Search with Submodular Function Maximization
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00045openalex-snapshot
Example-based Spatial Search at Scale
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00035openalex-snapshot
Finding Top-k Optimal Routes with Collective Spatial Keywords on Road Networks
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00206openalex-snapshot
Skyline Micro-Cluster Query: A Novel and Practical Spatial Query
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00286openalex-snapshot
Example Searcher: A Spatial Query System via Example
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00403openalex-snapshot
A Framework for Continuous kNN Ranking of EV Chargers with Estimated Components
inferred← citeshttps://doi.org/10.1109/icdew.2010.5452732openalex-snapshot
Evaluating path queries over route collections
inferred← citeshttps://doi.org/10.1109/icebe.2015.77openalex-snapshot
Privacy Preserving-Based Recommendation Service Model of Mobile Commerce and Anonimity Algorithm
inferred← citeshttps://doi.org/10.1109/iciscon.2013.6524163openalex-snapshot
Route planning via facilities with time dependent
inferred← citeshttps://doi.org/10.1109/icsdm.2011.5969013openalex-snapshot
Mining top-k closed co-location patterns
inferred← citeshttps://doi.org/10.1109/imcom53663.2022.9721805openalex-snapshot
An Efficient Multi-Criteria Path Selection Approach in Road Networks through Influencer Nodes and K-hop Search
inferred← citeshttps://doi.org/10.1109/isda.2015.7489239openalex-snapshot
A parallel heuristic for the travel planning problem
inferred← citeshttps://doi.org/10.1109/iske.2017.8258751openalex-snapshot
Design and implementation of scenic spot recommendation system based on Unity3D
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom51426.2020.00103openalex-snapshot
Efficient Multi-Request Route Planning on Road Network
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00179openalex-snapshot
Parallelized Top-k Route Search with User's Preferences
inferred← citeshttps://doi.org/10.1109/jiot.2021.3135303openalex-snapshot
Privacy-Preserving Location-Based Data Queries in Fog-Enhanced Sensor Networks
inferred← citeshttps://doi.org/10.1109/jiot.2023.3335292openalex-snapshot
Large-Scale Mixed Traffic Control Using Dynamic Vehicle Routing and Privacy-Preserving Crowdsourcing
inferred← citeshttps://doi.org/10.1109/mdm.2013.14openalex-snapshot
Efficient Approaches for Multi-requests Route Planning in Urban Areas
inferred← citeshttps://doi.org/10.1109/mdm.2015.18openalex-snapshot
SST: Privacy Preserving for Semantic Trajectories
inferred← citeshttps://doi.org/10.1109/mdm.2015.49openalex-snapshot
A Mixed Breadth-Depth First Search Strategy for Sequenced Group Trip Planning Queries
inferred← citeshttps://doi.org/10.1109/mdm.2015.68openalex-snapshot
Efficient Computation of Group Optimal Sequenced Routes in Road Networks
inferred← citeshttps://doi.org/10.1109/mdm.2017.37openalex-snapshot
Weighted Optimal Sequenced Group Trip Planning Queries
inferred← citeshttps://doi.org/10.1109/mdm.2017.38openalex-snapshot
Efficient Multi-Destinations Route Planning with Deadlines and Cost Constraints
inferred← citeshttps://doi.org/10.1109/mdm.2018.00035openalex-snapshot
Privacy Preserving Reverse k-Nearest Neighbor Queries
inferred← citeshttps://doi.org/10.1109/mdm48529.2020.00027openalex-snapshot
Trade-off Aware Sequenced Routing Queries (or OSR Queries when POIs are not Free)
inferred← citeshttps://doi.org/10.1109/pst.2011.5971987openalex-snapshot
General Secure Function Evaluation using standard trusted computing hardware
inferred← citeshttps://doi.org/10.1109/smartworld-uic-atc-scalcom-digitaltwin-pricomp-metaverse56740.2022.00033openalex-snapshot
Continuously Monitoring Optimal Routes with Collective Spatial Keywords on Road Networks
inferred← citeshttps://doi.org/10.1109/smartworld.2018.00158openalex-snapshot
Utility-Aware Trip Planning
inferred← citeshttps://doi.org/10.1109/tifs.2018.2885282openalex-snapshot
pRide: Privacy-Preserving Ride Matching Over Road Networks for Online Ride-Hailing Service
inferred← citeshttps://doi.org/10.1109/tifs.2021.3065832openalex-snapshot
A Privacy-Preserving Online Ride-Hailing System Without Involving a Third Trusted Server
inferred← citeshttps://doi.org/10.1109/tifs.2025.3544453openalex-snapshot
Efficient and Privacy-Preserving Ride Matching Over Road Networks Against Malicious ORH Server
inferred← citeshttps://doi.org/10.1109/tits.2014.2357835openalex-snapshot
TripPlanner: Personalized Trip Planning Leveraging Heterogeneous Crowdsourced Digital Footprints
inferred← citeshttps://doi.org/10.1109/tits.2015.2491269openalex-snapshot
TORD Problem and Its Solution Based on Big Trajectories Data
inferred← citeshttps://doi.org/10.1109/tits.2016.2593707openalex-snapshot
An Efficient Framework for Multirequest Route Planning in Urban Environments
inferred← citeshttps://doi.org/10.1109/tits.2022.3220429openalex-snapshot
One-Way Search Algorithm for Route Planning With Multiple Requests
inferred← citeshttps://doi.org/10.1109/tkde.2011.52openalex-snapshot
Continuous Detour Queries in Spatial Networks
inferred← citeshttps://doi.org/10.1109/tkde.2012.36openalex-snapshot
Optimal Route Queries with Arbitrary Order Constraints
inferred← citeshttps://doi.org/10.1109/tkde.2013.159openalex-snapshot
Trip Planner Over Probabilistic Time-Dependent Road Networks
inferred← citeshttps://doi.org/10.1109/tkde.2013.174openalex-snapshot
Authentication of k Nearest Neighbor Query on Road Networks
inferred← citeshttps://doi.org/10.1109/tkde.2014.2330836openalex-snapshot
An Air Index for Spatial Query Processing in Road Networks
inferred← citeshttps://doi.org/10.1109/tkde.2014.2382583openalex-snapshot
Discovery of Path Nearby Clusters in Spatial Networks
inferred← citeshttps://doi.org/10.1109/tkde.2015.2492554openalex-snapshot
Optimal Multi-Meeting-Point Route Search
inferred← citeshttps://doi.org/10.1109/tkde.2017.2703848openalex-snapshot
Efficient Clue-Based Route Search on Road Networks
inferred← citeshttps://doi.org/10.1109/tkde.2017.2721408openalex-snapshot
Efficient Retrieval of Bounded-Cost Informative Routes
inferred← citeshttps://doi.org/10.1109/tkde.2017.2772233openalex-snapshot
Efficient Maintenance of Shortest Distances in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2019.2959531openalex-snapshot
Mining Spatio-Temporal Reachable Regions With Multiple Sources over Massive Trajectory Data
inferred← citeshttps://doi.org/10.1109/tkde.2020.3004153openalex-snapshot
Efficient Processing of Group Planning Queries Over Spatial-Social Networks
inferred← citeshttps://doi.org/10.1109/tkde.2021.3130265openalex-snapshot
FedDSR: Daily Schedule Recommendation in a Federated Deep Reinforcement Learning Framework
inferred← citeshttps://doi.org/10.1109/tkde.2025.3609302openalex-snapshot
Flexible Keyword-Aware Top-$k$k Route Search
showing the first 200 of 323 · page through all 323
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.