On the public citation graph
ParDiSP: A Partition-Based Framework for Distance and Shortest Path Queries on Road Networks
0 signed · 46 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.1007/11561071_51openalex-snapshot
Highway Hierarchies Hasten Exact Shortest Path Queries
inferredcites →https://doi.org/10.1007/978-3-540-68552-4_24openalex-snapshot
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_20openalex-snapshot
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s00453-013-9802-3openalex-snapshot
Balanced Partitions of Trees and Applications
inferredcites →https://doi.org/10.1090/dimacs/074/03openalex-snapshot
Fast point-to-point shortest path computations with arc-flags
inferredcites →https://doi.org/10.1109/icde.1996.492091openalex-snapshot
HiTi graph model of topographical road maps in navigation systems
inferredcites →https://doi.org/10.1109/mdm.2014.8openalex-snapshot
Cost-Efficient Spatial Network Partitioning for Distance-Based Query Processing
inferredcites →https://doi.org/10.1109/tkde.2010.75openalex-snapshot
Query Processing Using Distance Oracles for Spatial Networks
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/1.9781611972870.5openalex-snapshot
In Transit to Constant Time Shortest-Path Queries in Road Networks
inferredcites →https://doi.org/10.1137/1.9781611973198.14openalex-snapshot
Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling
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/1097064.1097093openalex-snapshot
Efficient query processing on spatial networks
inferredcites →https://doi.org/10.1145/1498698.1564502openalex-snapshot
Goal-directed shortest-path queries using precomputed cluster distances
inferredcites →https://doi.org/10.1145/2463676.2465277openalex-snapshot
Shortest path and distance queries on road networks
inferredcites →https://doi.org/10.1145/2530531openalex-snapshot
Shortest-path queries in static networks
inferredcites →https://doi.org/10.1145/2666310.2666411openalex-snapshot
Efficient itinerary planning with category constraints
inferredcites →https://doi.org/10.14778/1687627.1687763openalex-snapshot
Path oracles for spatial networks
inferredcites →https://doi.org/10.14778/2140436.2140438openalex-snapshot
Shortest path and distance queries on road networks
inferredcites →https://doi.org/10.2172/4785039openalex-snapshot
Bi-Directional and Heuristic Search in Path Problems [Thesis]
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.100openalex-snapshot
Balanced Partitions of Trees and Applications
inferredcites →https://doi.org/10.5555/1070432.1070455openalex-snapshot
Computing the shortest path: A search meets graph theory
inferredcites →https://doi.org/10.5555/545381.545503openalex-snapshot
Reachability and distance queries via 2-hop labels
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-030-27615-7_25openalex-snapshot
Discovering Diverse Popular Paths Using Transactional Modeling and Pattern Mining
inferred← citeshttps://doi.org/10.1007/s00778-022-00760-2openalex-snapshot
Multi-constraint shortest path using forest hop labeling
inferred← citeshttps://doi.org/10.1007/s10619-021-07366-7openalex-snapshot
A framework for discovering popular paths using transactional modeling and pattern mining
inferred← citeshttps://doi.org/10.1007/s10707-024-00533-9openalex-snapshot
Highway systems: How good are they, really?
inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11402017openalex-snapshot
EdgeLA: A Label-Based Cloud–Edge Collaborative Architecture for Shortest-Path Queries
inferred← citeshttps://doi.org/10.1109/i2ct.2017.8226158openalex-snapshot
A survey on shortest path algorithm for road network in emergency services
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00223openalex-snapshot
Workload-Aware Shortest Path Distance Querying in Road Networks
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/icisim.2017.8122194openalex-snapshot
Design of quick response system for road network in emergency services
inferred← citeshttps://doi.org/10.1109/ictis60134.2023.10243896openalex-snapshot
Time-constrained shortest path search algorithm for urban road network
inferred← citeshttps://doi.org/10.1109/mdm65600.2025.00040openalex-snapshot
TrajRoute: Rethinking Routing with a Simple Trajectory-Based Approach – Forget the Maps and Traffic!
inferred← citeshttps://doi.org/10.1109/tkde.2020.3020185openalex-snapshot
Distributed Multimodal Path Queries
inferred← citeshttps://doi.org/10.1109/tkde.2022.3153711openalex-snapshot
Polestar++: An Intelligent Routing Engine for National-Wide Public Transportation
inferred← citeshttps://doi.org/10.1145/3139958.3140029openalex-snapshot
Finding The Most Preferred Path
inferred← citeshttps://doi.org/10.1145/3327964.3328496openalex-snapshot
Experiences with Implementing Landmark Embedding in Neo4j
inferred← citeshttps://doi.org/10.1145/3468791.3468844openalex-snapshot
Online Landmark-Based Batch Processing of Shortest Path Queries
inferred← citeshttps://doi.org/10.1145/3609956.3609963openalex-snapshot
Highway Systems: How Good are They, Really?
inferred← citeshttps://doi.org/10.1145/3681772.3698215openalex-snapshot
Towards Pareto-optimality with Multi-level Bi-objective Routing: A Summary of Results
inferred← citeshttps://doi.org/10.14778/3712221.3712241openalex-snapshot
A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks
inferred← citeshttps://doi.org/10.5194/isprs-archives-xlii-4-w8-191-2018openalex-snapshot
IMPROVING PATH QUERY PERFORMANCE IN PGROUTING USING A MAP GENERALIZATION APPROACH
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.