On the public citation graph

Engineering Highway Hierarchies

0 signed · 169 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/11561071_51openalex-snapshot
Highway Hierarchies Hasten Exact Shortest Path Queries
inferredcites →https://doi.org/10.1007/978-3-540-39658-1_69openalex-snapshot
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_4openalex-snapshot
Better Landmarks Within Reach
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_6openalex-snapshot
Dynamic Highway-Node Routing
inferredcites →https://doi.org/10.1007/978-3-540-75520-3_58openalex-snapshot
Fast and Compact Oracles for Approximate Distances in Planar Graphs
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s10589-008-9172-yopenalex-snapshot
Fast paths in large-scale dynamic road networks
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/06openalex-snapshot
Highway hierarchies star
inferredcites →https://doi.org/10.1109/sfcs.2001.959897openalex-snapshot
Planar graphs, negative weight edges, shortest paths, and near linear time
inferredcites →https://doi.org/10.1109/sfcs.2001.959898openalex-snapshot
Compact oracles for reachability and approximate distances in planar digraphs
inferredcites →https://doi.org/10.1109/tits.2002.806806openalex-snapshot
Heuristic techniques for accelerating hierarchical routing on road 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/1.9781611972863.13openalex-snapshot
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
inferredcites →https://doi.org/10.1137/1.9781611972870.4openalex-snapshot
Computing Many-to-Many Shortest Paths Using Highway Hierarchies
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.4271/912790openalex-snapshot
Map Navigation Software of the Electro-Multivision of the '91 Toyota Soarer
inferredcites →https://doi.org/10.5555/1070432.1070455openalex-snapshot
Computing the shortest path: A search meets graph theory
inferredcites →https://doi.org/10.5860/choice.35-6287openalex-snapshot
The algorithm design manual

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.20382openalex-snapshot
Experimental study of speed up techniques for timetable information systems
inferred← citeshttps://doi.org/10.1002/net.21542openalex-snapshot
Fully dynamic update of arc-flags
inferred← citeshttps://doi.org/10.1002/net.22027openalex-snapshot
A novel pseudo‐polynomial approach for shortest path problems
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_125openalex-snapshot
Engineering Algorithms for Large Network Applications
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_125openalex-snapshot
Engineering Algorithms for Large Network Applications
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_353openalex-snapshot
Routing in Road Networks with Transit Nodes
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_377openalex-snapshot
Single-Source Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-030-92905-3_11openalex-snapshot
Routing Vehicles on Highways by Augmenting Traffic Flow Network: A Review on Speed Up Techniques
inferred← citeshttps://doi.org/10.1007/978-3-030-98108-2_8openalex-snapshot
Routing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-00467-9_19openalex-snapshot
Large Graphs: Fast Cost Update and Query Algorithms. Application for Emergency Vehicles
inferred← citeshttps://doi.org/10.1007/978-3-319-18120-2_14openalex-snapshot
On Efficient Passenger Assignment for Group Transportation
inferred← citeshttps://doi.org/10.1007/978-3-319-28567-2_11openalex-snapshot
Genetic Diversity in the Multiobjective Optimization of Paths in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_23openalex-snapshot
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_24openalex-snapshot
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_6openalex-snapshot
Point-to-Point Shortest Path Algorithms with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_3openalex-snapshot
Speed-Up Techniques for Shortest-Path Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_2openalex-snapshot
Engineering Fast Route Planning Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_4openalex-snapshot
Better Landmarks Within Reach
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_6openalex-snapshot
Dynamic Highway-Node Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_58openalex-snapshot
Fast and Compact Oracles for Approximate Distances in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_28openalex-snapshot
Time-Dependent SHARC-Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_61openalex-snapshot
Mobile Route Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_13openalex-snapshot
The Shortcut Problem – Complexity and Approximation
inferred← citeshttps://doi.org/10.1007/978-3-642-02011-7_17openalex-snapshot
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_7openalex-snapshot
Engineering Route Planning Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_24openalex-snapshot
Car or Public Transport—Two Worlds
inferred← citeshttps://doi.org/10.1007/978-3-642-05465-5_7openalex-snapshot
Engineering Time-Expanded Graphs for Faster Timetable Information
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_32openalex-snapshot
Preprocessing Speed-Up Techniques Is Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_6openalex-snapshot
The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-16007-3_2openalex-snapshot
Approximate Shortest Path Queries Using Voronoi Duals
inferred← citeshttps://doi.org/10.1007/978-3-642-16248-0_101openalex-snapshot
Computing the Point-to-Point Shortest Path: Quotient Space Theory’s Application in Complex Network
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_13openalex-snapshot
Levelwise Mesh Sparsification for Shortest Path Queries
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_8openalex-snapshot
Dynamic Arc-Flags in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_38openalex-snapshot
Scope-Based Route Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-24425-4_72openalex-snapshot
Path Queries on Massive Graphs Based on Multi-granular Graph Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_1openalex-snapshot
Algorithm Engineering for Route Planning – An Update –
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_377-2openalex-snapshot
Single-Source Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-29350-4_51openalex-snapshot
Multi-agent System for Parallel Road Network Hierarchization
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_13openalex-snapshot
Fully Dynamic Maintenance of Arc-Flags in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-33260-9_36openalex-snapshot
Using Extended Raster File for Real Time Traffic Information Mining
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-981-97-3052-0_9openalex-snapshot
A Multi-objective Route Selection Model Based on Mobile Connected Information
inferred← citeshttps://doi.org/10.1007/s00453-009-9341-0openalex-snapshot
Time-Dependent SHARC-Routing
inferred← citeshttps://doi.org/10.1007/s10288-010-0121-0openalex-snapshot
Point-to-point shortest paths on dynamic time-dependent road networks
inferred← citeshttps://doi.org/10.1007/s10472-010-9217-7openalex-snapshot
Optimization of heuristic search using recursive algorithm selection and reinforcement learning
inferred← citeshttps://doi.org/10.1007/s10589-008-9172-yopenalex-snapshot
Fast paths in large-scale dynamic road networks
inferred← citeshttps://doi.org/10.1007/s11042-018-6714-xopenalex-snapshot
Intelligent route planning system based on interval computing
inferred← citeshttps://doi.org/10.1007/s11786-007-0023-5openalex-snapshot
Dynamic Multi-level Overlay Graphs for Shortest Paths
inferred← citeshttps://doi.org/10.1016/j.cie.2022.108223openalex-snapshot
A novel shortest path algorithm with topology transformation for urban rail transit network
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.123311openalex-snapshot
Boosting existing shortest path algorithms through highly efficient building of node cut set-based overlay
inferred← citeshttps://doi.org/10.1016/j.inffus.2024.102413openalex-snapshot
A survey of route recommendations: Methods, applications, and opportunities
inferred← citeshttps://doi.org/10.1016/j.ins.2013.07.009openalex-snapshot
Processing time-dependent shortest path queries without pre-computed speed information on road networks
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.1016/j.jag.2010.07.003openalex-snapshot
Path-finding through flexible hierarchical road networks: An experiential approach using taxi trajectory data
inferred← citeshttps://doi.org/10.1080/13658816.2019.1660781openalex-snapshot
Accelerating the shortest-path calculation using cut nodes for problem reduction and division
inferred← citeshttps://doi.org/10.1080/19427867.2024.2315359openalex-snapshot
Route and charging planning for electric vehicles: a multi-objective approach
inferred← citeshttps://doi.org/10.1090/dimacs/074/05openalex-snapshot
Reach for A*: shortest path algorithms with preprocessing
inferred← citeshttps://doi.org/10.1090/dimacs/074/06openalex-snapshot
Highway hierarchies star
inferred← citeshttps://doi.org/10.1090/dimacs/074/08openalex-snapshot
Robust, almost constant time shortest-path queries in road networks
inferred← citeshttps://doi.org/10.1098/rsta.2017.0232openalex-snapshot
Aggregation of Markov flows I: theory
inferred← citeshttps://doi.org/10.1109/access.2020.3026677openalex-snapshot
Route Planning Through Distributed Computing by Road Side Units
inferred← citeshttps://doi.org/10.1109/bdcloud.2014.85openalex-snapshot
Real Time Routing in Road Networks
inferred← citeshttps://doi.org/10.1109/bigdataservice58306.2023.00038openalex-snapshot
SparkACO: A Spark-Based Ant Colony Optimization for Path Planning of Large-Scale Complex Road Networks
inferred← citeshttps://doi.org/10.1109/csci.2014.74openalex-snapshot
Dealing with Bus Delay and User History for Personalized Transportation Recommendation
inferred← citeshttps://doi.org/10.1109/geoinformatics.2009.5293532openalex-snapshot
Hierarchical route planning based on taxi GPS-trajectories
inferred← citeshttps://doi.org/10.1109/icde.2016.7498328openalex-snapshot
SPDO: High-throughput road distance computations on Spark using Distance Oracles
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/icde60146.2024.00194openalex-snapshot
Querying Numeric-Constrained Shortest Distances on Road Networks
inferred← citeshttps://doi.org/10.1109/icfc49376.2020.00009openalex-snapshot
On Decentralized Route Planning Using the Road Side Units as Computing Resources
inferred← citeshttps://doi.org/10.1109/icnisc.2018.00082openalex-snapshot
Mixed Traffic Mode Based Travel Route Recommendation
inferred← citeshttps://doi.org/10.1109/icrtit.2011.5972476openalex-snapshot
Optimizing shortest path queries with parallelized arc flags
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470362openalex-snapshot
A multi-source label-correcting algorithm for the all-pairs shortest paths problem
inferred← citeshttps://doi.org/10.1109/isorc49007.2020.00018openalex-snapshot
Time-dependent Decentralized Routing using Federated Learning
inferred← citeshttps://doi.org/10.1109/isvd.2009.30openalex-snapshot
Approximate Shortest Path Queries in Graphs Using Voronoi Duals
inferred← citeshttps://doi.org/10.1109/itsc.2010.5625085openalex-snapshot
The predecessor and the accounting algorithm speed up shortest path calculations in traffic routing applications
inferred← citeshttps://doi.org/10.1109/nabic.2011.6089614openalex-snapshot
Ant colony inspired algorithm for adaptive traffic routing
inferred← citeshttps://doi.org/10.1109/pacc.2011.5979048openalex-snapshot
Parallelized Multilevel Arc Flags Improve Speedup in Shortest Path Queries
inferred← citeshttps://doi.org/10.1109/scet.2012.6341969openalex-snapshot
A Fast Route Planning Algorithm
inferred← citeshttps://doi.org/10.1109/tits.2018.2867834openalex-snapshot
On Evaluating Floating Car Data Quality for Knowledge Discovery
inferred← citeshttps://doi.org/10.1109/tits.2019.2912430openalex-snapshot
Heuristic Coarsening for Generating Multiscale Transport Networks
inferred← citeshttps://doi.org/10.1109/tkde.2013.176openalex-snapshot
Towards Online Shortest Path Computation
inferred← citeshttps://doi.org/10.1111/j.1467-9671.2010.01189.xopenalex-snapshot
The Experience of Realizing a Semantic Web Urban Computing Application
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2008.00649.xopenalex-snapshot
Shortest paths on dynamic graphs
inferred← citeshttps://doi.org/10.1137/1.9781611972870.4openalex-snapshot
Computing Many-to-Many Shortest Paths Using Highway Hierarchies
inferred← citeshttps://doi.org/10.1137/1.9781611972870.5openalex-snapshot
In Transit to Constant Time Shortest-Path Queries in Road Networks
inferred← citeshttps://doi.org/10.1142/9781786346766_0009openalex-snapshot
Single-Source Shortest Paths
inferred← citeshttps://doi.org/10.1145/1412228.1412239openalex-snapshot
Engineering multilevel overlay graphs for shortest-path queries
inferred← citeshttps://doi.org/10.1145/1498698.1537599openalex-snapshot
SHARC
inferred← citeshttps://doi.org/10.1145/1527125.1527134openalex-snapshot
Computing single source shortest paths using single-objective fitness
inferred← citeshttps://doi.org/10.1145/1671970.1671976openalex-snapshot
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
inferred← citeshttps://doi.org/10.1145/1739041.1739084openalex-snapshot
Probabilistic path queries in road networks
inferred← citeshttps://doi.org/10.1145/1830483.1830618openalex-snapshot
Edge-based representation beats vertex-based representation in shortest path problems
inferred← citeshttps://doi.org/10.1145/1989323.1989368openalex-snapshot
On k-skip shortest paths
inferred← citeshttps://doi.org/10.1145/2133803.2330080openalex-snapshot
Engineering highway hierarchies
inferred← citeshttps://doi.org/10.1145/2330784.2330928openalex-snapshot
Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity
inferred← citeshttps://doi.org/10.1145/2424321.2424365openalex-snapshot
HLDB
inferred← citeshttps://doi.org/10.1145/2530531openalex-snapshot
Shortest-path queries in static networks
inferred← citeshttps://doi.org/10.1145/2674918.2674924openalex-snapshot
Realtime response of shortest path computation
inferred← citeshttps://doi.org/10.1145/2723372.2749456openalex-snapshot
Efficient Route Planning on Public Transportation Networks
inferred← citeshttps://doi.org/10.1145/2820783.2820806openalex-snapshot
Analytical queries on road networks
inferred← citeshttps://doi.org/10.1145/2996913.2996921openalex-snapshot
CDO
inferred← citeshttps://doi.org/10.1145/3186728.3164141openalex-snapshot
An experimental study on hub labeling based shortest path algorithms
inferred← citeshttps://doi.org/10.1145/3274895.3274898openalex-snapshot
DOS
inferred← citeshttps://doi.org/10.1145/3318464.3389718openalex-snapshot
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks
inferred← citeshttps://doi.org/10.1145/3721145.3725744openalex-snapshot
Parallel Contraction Hierarchies Can Be Efficient and Scalable
inferred← citeshttps://doi.org/10.12677/ojtt.2025.141002openalex-snapshot
Research on Path Planning Methods for Navigation Systems to Avoid Overloaded and Overweight Trucks
inferred← citeshttps://doi.org/10.12694/scpe.v12i3.724openalex-snapshot
Vehicle routing problems with the use of multi-agent system
inferred← citeshttps://doi.org/10.14264/uql.2014.487openalex-snapshot
Efficient Distance-based Query Processing in Spatial Networks
inferred← citeshttps://doi.org/10.14778/1921071.1921074openalex-snapshot
Graph indexing of road networks for shortest path queries with label restrictions
inferred← citeshttps://doi.org/10.14778/3476249.3476267openalex-snapshot
An experimental evaluation and guideline for path finding in weighted dynamic network
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31467openalex-snapshot
Multi-Objective Electric Vehicle Route and Charging Planning with Contraction Hierarchies
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21773openalex-snapshot
Light Contraction Hierarchies: Hierarchical Search Without Shortcuts
inferred← citeshttps://doi.org/10.1609/socs.v8i1.18434openalex-snapshot
Feasibility Study: Subgoal Graphs on State Lattices
inferred← citeshttps://doi.org/10.2200/s00618ed1v01y201412tcs001openalex-snapshot
The Shortest-Path Problem: Analysis and Comparison of Methods
inferred← citeshttps://doi.org/10.2478/itms-2013-0012openalex-snapshot
Suitability Analysis of Routing Algorithms for Web-based Transportation Planning
inferred← citeshttps://doi.org/10.25911/5d611e273981bopenalex-snapshot
Fast and optimal pathfinding
inferred← citeshttps://doi.org/10.26083/tuprints-00001989openalex-snapshot
Fully Realistic Multi-Criteria Timetable Information Systems
inferred← citeshttps://doi.org/10.26524/krj.2020.8openalex-snapshot
Performance routing with shortest path exploration in wireless mesh networks
inferred← citeshttps://doi.org/10.32657/10356/68898openalex-snapshot
Efficient index structures for reachability and shortest path queries
inferred← citeshttps://doi.org/10.3390/futuretransp6040134openalex-snapshot
Optimized Customizable Route Planning in Large Road Networks with Batch Processing
inferred← citeshttps://doi.org/10.3390/s21155074openalex-snapshot
Scalable Data Model for Traffic Congestion Avoidance in a Vehicle to Cloud Infrastructure
inferred← citeshttps://doi.org/10.35376/10324/16003openalex-snapshot
Parallel approaches to shortest-path problems for multilevel heterogeneous computing
inferred← citeshttps://doi.org/10.3846/1648-4142.2009.24.21-25openalex-snapshot
DEVELOPING CO‐OPERATIVE TRANSPORT SYSTEM AND ROUTE PLANNING
inferred← citeshttps://doi.org/10.3846/transport.2010.21openalex-snapshot
ROUTE PLANNING METHODOLOGY OF AN ADVANCED TRAVELLER INFORMATION SYSTEM IN VILNIUS CITY
inferred← citeshttps://doi.org/10.3846/transport.2020.12106openalex-snapshot
A COMPUTATION METHOD ON TIME-DEPENDENT ACCESSIBILITY OF URBAN RAIL TRANSIT NETWORKS FOR THE LAST SERVICE
inferred← citeshttps://doi.org/10.3929/ethz-a-006782257openalex-snapshot
I/O efficiency of highway hierarchies
inferred← citeshttps://doi.org/10.4018/jghpc.2013070103openalex-snapshot
A Novel Path Planning to Provide Real-Time Backup Paths for Vehicle Navigation Systems
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2007.1171openalex-snapshot
15. Maintenance of Multi-level Overlay Graphs for Timetable Queries
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2008.1582openalex-snapshot
Engineering Time-Expanded Graphs for Faster Timetable Information
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2009.2149openalex-snapshot
Arc-Flags in Dynamic Graphs
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2010.45openalex-snapshot
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
inferred← citeshttps://doi.org/10.48550/arxiv.1002.4330openalex-snapshot
Defining and Computing Alternative Routes in Road Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1101.3182openalex-snapshot
Multi-Stage Improved Route Planning Approach: theoretical foundations
inferred← citeshttps://doi.org/10.48550/arxiv.1501.04262openalex-snapshot
Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1705.02044openalex-snapshot
A Survey of Shortest-Path Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1905.04469openalex-snapshot
A New Shortest Path Algorithm Generalized on Dynamic Graph for Commercial Intelligent Navigation for Transportation Management
inferred← citeshttps://doi.org/10.48550/arxiv.1907.09041openalex-snapshot
Combining the Connection Scan Algorithm with Contraction Hierarchies
inferred← citeshttps://doi.org/10.5120/7506-0618openalex-snapshot
Performance Analysis of Parallel Speedup Techniques for Shortest Path Queries in Networks of Random and Planar Types
inferred← citeshttps://doi.org/10.5445/ir/1000006961openalex-snapshot
Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
inferred← citeshttps://doi.org/10.5445/ir/1000007755openalex-snapshot
Route Planning in Road Networks
inferred← citeshttps://doi.org/10.5445/ir/1000009237openalex-snapshot
Engineering Planar-Separator and Shortest-Path Algorithms
inferred← citeshttps://doi.org/10.5445/ir/1000011046openalex-snapshot
Engineering and Augmenting Route Planning Algorithms
inferred← citeshttps://doi.org/10.6083/m40p0x2sopenalex-snapshot
Prioritization and pruning : efficient inference with weighted context-free grammars : a dissertaion
inferred← citeshttps://doi.org/10.70675/63acce04z153cz427fza2e8z9d761cc9467eopenalex-snapshot
Calcul d'itinéraires multiples et de trajets synchronisés dans des réseaux de transport multimodaux
inferred← citeshttps://doi.org/10.70675/6b530360z2716z433cza0efz9e6e2cb6ff76openalex-snapshot
Recherche de chemins multiobjectifs pour la conception et la réalisation d'une centrale de mobilité destinées aux cyclistes
inferred← citeshttps://doi.org/10.70675/c2641364z59f3z47f7z96d9z6a96bcb3d067openalex-snapshot
Privacy-enhancing technologies for ridesharing
inferred← citeshttps://doi.org/10.70675/dd90d5a6zf059z4fcez8774z43ddfbe5807aopenalex-snapshot
Algorithmes de recherche d'itinéraires en transport multimodal
inferred← citeshttps://doi.org/10.7155/jgaa.00270openalex-snapshot
The Shortcut Problem - Complexity and Algorithms
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.