On the public citation graph
PHAST: Hardware-Accelerated Shortest Path Trees
0 signed · 92 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/11427186_13openalex-snapshot
Acceleration of Shortest Path and Constrained Shortest Path Computation
inferredcites →https://doi.org/10.1007/3-540-61142-8_588openalex-snapshot
Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs
inferredcites →https://doi.org/10.1007/3-540-68530-8_33openalex-snapshot
Δ-Stepping : A Parallel Single Source Shortest Path Algorithm
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-02094-0_7openalex-snapshot
Engineering Route Planning Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-15775-2_24openalex-snapshot
n-Level Graph Partitioning
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/978-3-642-20662-7_32openalex-snapshot
Customizable Route Planning
inferredcites →https://doi.org/10.1007/978-3-642-22006-7_58openalex-snapshot
VC-Dimension and Shortest Path Algorithms
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot
Δ-stepping: a parallelizable shortest path algorithm
inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot
A faster algorithm for betweenness centrality*
inferredcites →https://doi.org/10.1090/dimacs/074/02openalex-snapshot
An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags
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.1090/dimacs/074/05openalex-snapshot
Reach for A*: shortest path algorithms with preprocessing
inferredcites →https://doi.org/10.1090/dimacs/074/10openalex-snapshot
Parallel shortest path algorithms for solving large-scale instances
inferredcites →https://doi.org/10.1109/ipdps.2010.5470362openalex-snapshot
A multi-source label-correcting algorithm for the all-pairs shortest paths problem
inferredcites →https://doi.org/10.1109/ipdps.2011.108openalex-snapshot
Graph Partitioning with Natural Cuts
inferredcites →https://doi.org/10.1111/j.1467-8659.2007.01012.xopenalex-snapshot
A Survey of General‐Purpose Computation on Graphics Hardware
inferredcites →https://doi.org/10.1137/070698774openalex-snapshot
A Practical Shortest Path Algorithm with Linear Expected Time
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.9781611972887.9openalex-snapshot
Better Approximation of Betweenness Centrality
inferredcites →https://doi.org/10.1137/1.9781611973075.64openalex-snapshot
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms
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/1671970.1671976openalex-snapshot
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
inferredcites →https://doi.org/10.1145/363269.363610openalex-snapshot
Algorithm 360: shortest-path forest with topological ordering [H]
inferredcites →https://doi.org/10.1287/opre.27.1.161openalex-snapshot
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/3033543openalex-snapshot
A Set of Measures of Centrality Based on Betweenness
inferredcites →https://doi.org/10.4230/oasics.atmos.2011.52openalex-snapshot
Faster Batched Shortest Paths 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-1-4614-1629-6_7openalex-snapshot
Trajectory Analysis for Driving
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_20openalex-snapshot
Computation and Growth of Road Network Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_20openalex-snapshot
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_21openalex-snapshot
Hierarchy Decomposition for Faster User Equilibria on Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_58openalex-snapshot
VC-Dimension and Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_23openalex-snapshot
Candidate Sets for Alternative Routes in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_30openalex-snapshot
Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_26openalex-snapshot
A New Dynamic Graph Structure for Large-Scale Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_7openalex-snapshot
Transit Node Routing Reconsidered
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_52openalex-snapshot
An Alternative Approach to Alternative Routes: HiDAR
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_30openalex-snapshot
GRASP. Extending Graph Separators for the Single-Source Shortest-Path Problem
inferred← citeshttps://doi.org/10.1007/s00778-021-00705-1openalex-snapshot
RNE: computing shortest paths using road network embedding
inferred← citeshttps://doi.org/10.1007/s10472-021-09775-xopenalex-snapshot
Heuristic search for one-to-many shortest path queries
inferred← citeshttps://doi.org/10.1007/s13676-013-0026-0openalex-snapshot
GPU computing in discrete optimization. Part II: Survey focused on routing problems
inferred← citeshttps://doi.org/10.1080/10095020.2012.708157openalex-snapshot
A new synchronization in parallel shortest paths analysis for massive road networks
inferred← citeshttps://doi.org/10.1109/hpcc.2012.232openalex-snapshot
Run-time Adaptation to Heterogeneous Processing Units for Real-time Stereo Vision
inferred← citeshttps://doi.org/10.1109/hpec43674.2020.9286141openalex-snapshot
Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling
inferred← citeshttps://doi.org/10.1109/ipdps.2013.111openalex-snapshot
Minimizing Communication in All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.119openalex-snapshot
A Stream Processing Framework for On-Line Optimization of Performance and Energy Efficiency on Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/ivs.2011.5940521openalex-snapshot
Parallel matching-based estimation - a case study on three different hardware architectures
inferred← citeshttps://doi.org/10.1109/smc.2018.00567openalex-snapshot
Memory-Restricted Routing with Tiled Map Data
inferred← citeshttps://doi.org/10.1109/tpds.2016.2634535openalex-snapshot
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems
inferred← citeshttps://doi.org/10.1109/tvcg.2019.2904271openalex-snapshot
Optimal Path Maps on the GPU
inferred← citeshttps://doi.org/10.1137/1.9781611972924.12openalex-snapshot
User-Constrained Multi-Modal Route Planning
inferred← citeshttps://doi.org/10.1137/1.9781611972924.15openalex-snapshot
Robust Mobile Route Planning with Limited Connectivity
inferred← citeshttps://doi.org/10.1145/2346496.2346521openalex-snapshot
Smarter outlier detection and deeper understanding of large-scale taxi trip records
inferred← citeshttps://doi.org/10.1145/2533828.2533838openalex-snapshot
Optimizing Landmark-Based Routing and Preprocessing
inferred← citeshttps://doi.org/10.1145/2632215openalex-snapshot
A Portable Optimization Engine for Accelerating Irregular Data-Traversal Applications on SIMD Architectures
inferred← citeshttps://doi.org/10.1145/2699886openalex-snapshot
User-Constrained Multimodal Route Planning
inferred← citeshttps://doi.org/10.1145/2833165.2833168openalex-snapshot
Vector Map Constrained Path Bundling in 3D Environments
inferred← citeshttps://doi.org/10.1145/2903150.2911712openalex-snapshot
An energy-efficient parallel algorithm for real-time near-optimal UAV path planning
inferred← citeshttps://doi.org/10.1145/3330345.3330368openalex-snapshot
GPU road network graph contraction and SSSP query
inferred← citeshttps://doi.org/10.1145/3711708openalex-snapshot
Proceedings of the 1st FastCode Programming Challenge
inferred← citeshttps://doi.org/10.1145/3711708.3723448openalex-snapshot
Techniques for Practical Parallel BFS and SSSP
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8766openalex-snapshot
Placement of Loading Stations for Electric Vehicles: No Detours Necessary!
inferred← citeshttps://doi.org/10.1613/jair.4688openalex-snapshot
Placement of Loading Stations for Electric Vehicles: No Detours Necessary!
inferred← citeshttps://doi.org/10.18419/opus-3039openalex-snapshot
Distributed shortest-path computation
inferred← citeshttps://doi.org/10.18419/opus-3050openalex-snapshot
Kürzeste Wege im Wikipedia-Linkgraph
inferred← citeshttps://doi.org/10.2200/s00618ed1v01y201412tcs001openalex-snapshot
The Shortest-Path Problem: Analysis and Comparison of Methods
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5104openalex-snapshot
Shortest Path Calculation Using Contraction Hierarchy Graph Algorithms on Nvidia GPUs
inferred← citeshttps://doi.org/10.3233/kes-160339openalex-snapshot
Efficient many-to-many path planning and the Traveling Salesman Problem on road networks
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2011.52openalex-snapshot
Faster Batched Shortest Paths in Road Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1010.0809openalex-snapshot
Engineering Time-dependent One-To-All Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1504.01497openalex-snapshot
ReHub. Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale networks
inferred← citeshttps://doi.org/10.5120/13424-1104openalex-snapshot
Performance Analysis of Single Source Shortest Path Algorithm over Multiple GPUs in a Network of Workstations using OpenCL and MPI
inferred← citeshttps://doi.org/10.5441/002/edbt.2016.50openalex-snapshot
Scalable Public Transportation Queries on the Database
inferred← citeshttps://doi.org/10.7287/peerj-cs.140v0.1/reviews/1openalex-snapshot
Peer Review #1 of "A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.140v0.2/reviews/1openalex-snapshot
Peer Review #1 of "A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.140v0.2/reviews/2openalex-snapshot
Peer Review #2 of "A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.140openalex-snapshot
A GPU-based solution for fast calculation of the betweenness centrality in large weighted 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.