On the public citation graph

Computing the shortest path: A search meets graph theory

0 signed · 685 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/3-540-44676-1_19openalex-snapshot

A Simple Shortest Path Algorithm with Linear Average Time

inferredcites →https://doi.org/10.1007/3-540-45678-3_43openalex-snapshot

Shortest Path Algorithms: Engineering Aspects

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-642-59179-2_15openalex-snapshot

Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets

inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot

A note on two problems in connexion with graphs

inferredcites →https://doi.org/10.1007/bf01840435openalex-snapshot

Shortest paths in euclidean graphs

inferredcites →https://doi.org/10.1016/0004-3702(89)90069-6openalex-snapshot

BS∗: An admissible bidirectional staged heuristic search algorithm

inferredcites →https://doi.org/10.1016/j.jalgor.2003.08.001openalex-snapshot

Compact roundtrip routing in directed networks

inferredcites →https://doi.org/10.1016/j.jcss.2005.05.007openalex-snapshot

Planar graphs, negative weight edges, shortest paths, and near linear time

inferredcites →https://doi.org/10.1016/s0167-6377(02)00192-xopenalex-snapshot

A new algorithm for reoptimizing shortest paths when the arc costs change

inferredcites →https://doi.org/10.1093/comjnl/9.3.275openalex-snapshot

Finding the Shortest Route between Two Points in a Network

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.1109/vnis.1994.396824openalex-snapshot

A fast algorithm for finding better routes by AI search techniques

inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot

Data Structures and Network Algorithms

inferredcites →https://doi.org/10.1145/1039488.1039493openalex-snapshot

Compact oracles for reachability and approximate distances in planar digraphs

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/316542.316548openalex-snapshot

Undirected single-source shortest paths with positive integer weights in linear time

inferredcites →https://doi.org/10.1145/322003.322004openalex-snapshot

An Improved Bidirectional Heuristic Search Algorithm

inferredcites →https://doi.org/10.1145/322358.322360openalex-snapshot

Bidirectional Heuristic Search Again

inferredcites →https://doi.org/10.1145/347792.347814openalex-snapshot

A computational study of routing algorithms for realistic transportation networks

inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot

An Appraisal of Some Shortest-Path Algorithms

inferredcites →https://doi.org/10.1287/opre.27.1.161openalex-snapshot

Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

inferredcites →https://doi.org/10.1287/trsc.32.1.65openalex-snapshot

Shortest Path Algorithms: An Evaluation Using Real Road Networks

inferredcites →https://doi.org/10.2307/2583667openalex-snapshot

Introduction to Algorithms

inferredcites →https://doi.org/10.2307/923005openalex-snapshot

Annals of Opera

inferredcites →https://doi.org/10.5555/314464.314638openalex-snapshot

Shortest paths algorithms: theory and experimental evaluation

inferredcites →https://doi.org/10.5555/3226663.3227073openalex-snapshot

Shortest paths algorithms

inferredcites →https://doi.org/10.7249/r366openalex-snapshot

Linear Programming and Extensions

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4015243openalex-extracted

Traffic3d: An Open-Source Traffic-Based Interactive Framework to Train Ai Agents

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.20438openalex-snapshot

BidirectionalA* search on time‐dependent road networks

inferred← citeshttps://doi.org/10.1002/net.21490openalex-snapshot

Shortest paths avoiding forbidden subpaths

inferred← citeshttps://doi.org/10.1002/net.21542openalex-snapshot

Fully dynamic update of arc-flags

inferred← citeshttps://doi.org/10.1007/11427186_13openalex-snapshot

Acceleration of Shortest Path and Constrained Shortest Path Computation

inferred← citeshttps://doi.org/10.1007/11427186_18openalex-snapshot

Partitioning Graphs to Speed Up Dijkstra’s Algorithm

inferred← citeshttps://doi.org/10.1007/11561071_51openalex-snapshot

Highway Hierarchies Hasten Exact Shortest Path Queries

inferred← citeshttps://doi.org/10.1007/11764298_29openalex-snapshot

Goal Directed Shortest Path Queries Using Precomputed Cluster Distances

inferred← citeshttps://doi.org/10.1007/11841036_71openalex-snapshot

Engineering Highway Hierarchies

inferred← citeshttps://doi.org/10.1007/978-1-4020-9086-8_2openalex-snapshot

Geodesic Methods for Shape and Surface Processing

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-3-030-12079-5_1openalex-snapshot

Batch Processing of Shortest Path Queries in Road Networks

inferred← citeshttps://doi.org/10.1007/978-3-030-19759-9_10openalex-snapshot

Algorithms for Cloud-Based Smart Mobility

inferred← citeshttps://doi.org/10.1007/978-3-030-32587-9_10openalex-snapshot

A Vertical Breadth-First Multilevel Path Algorithm to Find All Paths in a Graph

inferred← citeshttps://doi.org/10.1007/978-3-030-33720-9_45openalex-snapshot

Swarm Optimization Algorithm for Road Bypass Extrapolation

inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_6openalex-snapshot

Navigating a Shortest Path with High Probability in Massive Complex Networks

inferred← citeshttps://doi.org/10.1007/978-3-030-36671-1_16openalex-snapshot

Control of the “Cataphoresis” Process by Artificial Intelligence

inferred← citeshttps://doi.org/10.1007/978-3-030-60259-8_6openalex-snapshot

An Index Method for the Shortest Path Query on Vertex Subset for the Large Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-73216-5_9openalex-snapshot

Hop-Constrained Subgraph Query and Summarization on Large Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-77283-3_25openalex-snapshot

Outside the Lines: Visualizing Influence Across Heterogeneous Contexts in PTSD

inferred← citeshttps://doi.org/10.1007/978-3-030-91431-8_16openalex-snapshot

Representation Learning Based Query Decomposition for Batch Shortest Path Processing in Road Networks

inferred← citeshttps://doi.org/10.1007/978-3-031-02574-7_7openalex-snapshot

Conclusions

inferred← citeshttps://doi.org/10.1007/978-3-031-16620-4_9openalex-snapshot

Multi-Criteria Decision-Making for Sustainable Transport: A Case Study on Traffic Flow Prediction Using Spatial–Temporal Traffic Sequence

inferred← citeshttps://doi.org/10.1007/978-3-031-58405-3_77openalex-snapshot

Time-Dependent Shortest Path with Travel Time Equivalents of Inconveniences

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-11167-4_3openalex-snapshot

Efficient Profile Routing for Electric Vehicles

inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1567openalex-snapshot

Predictive Path Planning

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-20086-6_23openalex-snapshot

SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-22363-6_3openalex-snapshot

ParetoPrep: Efficient Lower Bounds for Path Skylines and Fast Path Computation

inferred← citeshttps://doi.org/10.1007/978-3-319-22849-5_2openalex-snapshot

Restricted Shortest Path in Temporal Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-23204-1_34openalex-snapshot

Finding Shortest Path and Transit Nodes in Public Transportation System

inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_1567-1openalex-snapshot

Predictive Path Planning

inferred← citeshttps://doi.org/10.1007/978-3-319-26190-4_34openalex-snapshot

Evaluating k Nearest Neighbor Query on Road Networks with no Information Leakage

inferred← citeshttps://doi.org/10.1007/978-3-319-46922-5_11openalex-snapshot

Finding Least On-Road Travel Time on Road Network

inferred← citeshttps://doi.org/10.1007/978-3-319-47289-8_10openalex-snapshot

Efficient Computation of Bypass Areas

inferred← citeshttps://doi.org/10.1007/978-3-319-49148-6_30openalex-snapshot

Service-Oriented Workflow Executability from a Security Perspective

inferred← citeshttps://doi.org/10.1007/978-3-319-49397-8_9openalex-snapshot

Finding Risk-Averse Shortest Path with Time-Dependent Stochastic Costs

inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_2openalex-snapshot

Route Planning in Transportation Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-55699-4_26openalex-snapshot

Efficient Landmark-Based Candidate Generation for kNN Queries on Road Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-60795-5_10openalex-snapshot

Link Prediction Using Top-k Shortest Distances

inferred← citeshttps://doi.org/10.1007/978-3-319-73748-5_8openalex-snapshot

Suggestion of an E-proof Environment in Mathematics Education

inferred← citeshttps://doi.org/10.1007/978-3-319-89920-6_1openalex-snapshot

Solving the Time-Dependent Shortest Path Problem Using Super-Optimal Wind

inferred← citeshttps://doi.org/10.1007/978-3-319-91479-4_54openalex-snapshot

A Proposal for Adaptive Maps

inferred← citeshttps://doi.org/10.1007/978-3-319-93713-7_7openalex-snapshot

Preprocessing Parallelization for the ALT-Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-319-98809-2_19openalex-snapshot

Community Structure Based Shortest Path Finding for Social Networks

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-68552-4_25openalex-snapshot

Bidirectional A ∗ Search for Time-Dependent Fast Paths

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_5openalex-snapshot

Landmark-Based Routing in Dynamic Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_33openalex-snapshot

BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps

inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_48openalex-snapshot

Approximate Shortest Paths Guided by a Small Index

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-77903-2_70openalex-snapshot

Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps

inferred← citeshttps://doi.org/10.1007/978-3-540-87477-5_57openalex-snapshot

Transfer Graph Approach for Multimodal Transport Problems

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-92182-0_71openalex-snapshot

Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks

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-02538-9_6openalex-snapshot

Algorithm Engineering: Concepts and Practice

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-03547-0_11openalex-snapshot

Optimized Graph Search Using Multi-Level Graph Clustering

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-05465-5_8openalex-snapshot

Time-Dependent Route Planning

inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_79openalex-snapshot

Succinct Greedy Geometric Routing in the Euclidean Plane

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-13193-6_5openalex-snapshot

Space-Efficient SHARC-Routing

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-14866-8_5openalex-snapshot

Chapter 5. Realistic Computer Models

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-20149-3_24openalex-snapshot

Real-Time Diameter Monitoring for Time-Evolving Graphs

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_32openalex-snapshot

Customizable Route Planning

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-20847-8_4openalex-snapshot

Efficient Centrality Monitoring for Time-Evolving Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-22351-8_16openalex-snapshot

Querying Shortest Path Distance with Bounded Errors in Large Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-22543-7_74openalex-snapshot

COCA: Combining Speedup Techniques Based on Containers and Arc-Flags

inferred← citeshttps://doi.org/10.1007/978-3-642-22922-0_7openalex-snapshot

Online Computation of Fastest Path in Time-Dependent Spatial Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-22922-0_8openalex-snapshot

Dynamic Pickup and Delivery with Transfers

inferred← citeshttps://doi.org/10.1007/978-3-642-23535-1_52openalex-snapshot

Synthesizing Routes for Low Sampling Trajectories with Absorbing Markov Chains

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-24704-0_15openalex-snapshot

Context-Aware Nearest Neighbor Query on Social Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-24983-9_16openalex-snapshot

An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-25274-7_25openalex-snapshot

Heuristic Multiobjective Search for Hazmat Transportation Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-27579-1_71openalex-snapshot

Routing with Free Geodata on Mobile Devices

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-30850-5_21openalex-snapshot

A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network

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-32316-4_4openalex-snapshot

A Hybrid Shortest Path Algorithm for Intra-Regional Queries on Hierarchical Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-32548-9_10openalex-snapshot

Mobile Robot Navigation Using Graph Search Techniques over an Approximate Cell Decomposition of the Free Space

inferred← citeshttps://doi.org/10.1007/978-3-642-34213-4_13openalex-snapshot

A Survey on Proximity Measures for Social Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-34862-4_7openalex-snapshot

Efficient Route Compression for Hybrid Route Planning

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-39652-6_4openalex-snapshot

The Quest for the Shortest Route

inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_4openalex-snapshot

Computing the Greedy Spanner in Linear Space

inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_7openalex-snapshot

Boundary-to-Boundary Flows in Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-53703-5_38openalex-snapshot

Multi-Point Shortest Path in the Complex Road Network Based on Floyd Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-658-02282-2_2openalex-snapshot

Algorithmen auf dem Laufsteg

inferred← citeshttps://doi.org/10.1007/978-3-658-21214-8_16openalex-snapshot

Dynamische Planung von Fahrgemeinschaften

inferred← citeshttps://doi.org/10.1007/978-3-658-26270-9_2openalex-snapshot

Grundlagen der Navigation in komplexen Umgebungen

inferred← citeshttps://doi.org/10.1007/978-3-662-49179-9_11openalex-snapshot

Transit Journaling and Traffic Sensitive Routing for a Mixed Mode Public Transportation System

inferred← citeshttps://doi.org/10.1007/978-981-15-0974-2_6openalex-snapshot

Autonomous Navigation Using Monocular ORB SLAM2

inferred← citeshttps://doi.org/10.1007/978-981-15-2914-6_2openalex-snapshot

Charging Strategy of Temporal-SoC for Plug-in Electric Vehicles on Coupled Networks

inferred← citeshttps://doi.org/10.1007/978-981-16-0980-0_12openalex-snapshot

Infrastructure as a Service (IaaS) for Smart Education

inferred← citeshttps://doi.org/10.1007/978-981-16-2324-0_14openalex-snapshot

An Online Processing Method for the Cooperative Control of Connected and Automated Vehicle Platoons

inferred← citeshttps://doi.org/10.1007/s00453-008-9228-5openalex-snapshot

Approximate Shortest Paths Guided by a Small Index

inferred← citeshttps://doi.org/10.1007/s00453-015-0001-2openalex-snapshot

Computing the Greedy Spanner in Linear Space

inferred← citeshttps://doi.org/10.1007/s00453-019-00655-9openalex-snapshot

Energy-Optimal Routes for Battery Electric Vehicles

inferred← citeshttps://doi.org/10.1007/s00778-012-0304-8openalex-snapshot

Outsourcing shortest distance computing with privacy protection

inferred← citeshttps://doi.org/10.1007/s00778-017-0457-6openalex-snapshot

Distributed shortest path query processing on dynamic road networks

inferred← citeshttps://doi.org/10.1007/s00778-018-0499-4openalex-snapshot

Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory

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/s00778-021-00707-zopenalex-snapshot

Fast fully dynamic labelling for distance queries

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/s10472-021-09775-xopenalex-snapshot

Heuristic search for one-to-many shortest path queries

inferred← citeshttps://doi.org/10.1007/s10514-008-9095-6openalex-snapshot

Geodesic Gaussian kernels for value function approximation

inferred← citeshttps://doi.org/10.1007/s10586-012-0238-3openalex-snapshot

Asymmetrical topology and entropy-based heterogeneous link for many-core massive data communication

inferred← citeshttps://doi.org/10.1007/s10586-015-0458-4openalex-snapshot

GRAPPE : a system for determining optimal connecting route to target person based on mutual intimacy index

inferred← citeshttps://doi.org/10.1007/s10586-016-0543-3openalex-snapshot

Operational cost-aware resource provisioning for continuous write applications in cloud-of-clouds

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-013-0179-xopenalex-snapshot

A comparative study of two approaches for supporting optimal network location queries

inferred← citeshttps://doi.org/10.1007/s10707-015-0229-7openalex-snapshot

SPLZ: An efficient algorithm for single source shortest path problem using compression method

inferred← citeshttps://doi.org/10.1007/s10846-012-9773-7openalex-snapshot

Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment

inferred← citeshttps://doi.org/10.1007/s10846-021-01437-8openalex-snapshot

Enhanced Center Constraint Weighted A* Algorithm for Path Planning of Petrochemical Inspection Robot

inferred← citeshttps://doi.org/10.1007/s10958-015-2612-1openalex-snapshot

Algorithms for Searching Paths in Huge Graphs

inferred← citeshttps://doi.org/10.1007/s10994-024-06697-7openalex-snapshot

Enhanced route planning with calibrated uncertainty set

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/s11067-021-09516-xopenalex-snapshot

Uncertainties of Sub-Scaled Supply and Demand in Agent-Based Mobility Simulations with Queuing Traffic Model

inferred← citeshttps://doi.org/10.1007/s11227-021-04072-0openalex-snapshot

Best path in mountain environment based on parallel A* algorithm and Apache Spark

inferred← citeshttps://doi.org/10.1007/s11280-014-0276-2openalex-snapshot

Ranked content advertising in online social networks

inferred← citeshttps://doi.org/10.1007/s11280-021-00871-wopenalex-snapshot

An efficient index method for the optimal path query over multi-cost networks

inferred← citeshttps://doi.org/10.1007/s11390-017-1711-5openalex-snapshot

Reverse Furthest Neighbors Query in Road Networks

inferred← citeshttps://doi.org/10.1007/s11390-024-4020-9openalex-snapshot

UFN: User-Friendly Navigation Framework Based on Systematic Utilization of User-Friendliness Features from Historical Traffic Data

inferred← citeshttps://doi.org/10.1007/s11786-007-0023-5openalex-snapshot

Dynamic Multi-level Overlay Graphs for Shortest Paths

inferred← citeshttps://doi.org/10.1007/s13278-013-0095-yopenalex-snapshot

Hypergraph index: an index for context-aware nearest neighbor query on social networks

inferred← citeshttps://doi.org/10.1007/s13676-015-0092-6openalex-snapshot

Shortest path problem with arc failure scenarios

inferred← citeshttps://doi.org/10.1007/s13762-021-03507-8openalex-snapshot

A blockchain-based approach using smart contracts to develop a smart waste management system

inferred← citeshttps://doi.org/10.1007/s40745-017-0119-yopenalex-snapshot

Approximate Shortest Distance Computing Using k-Medoids Clustering

inferred← citeshttps://doi.org/10.1007/s41095-015-0018-0openalex-snapshot

Subregion graph: A path planning acceleration structure for characters with various motion types in very large environments

inferred← citeshttps://doi.org/10.1007/s41095-021-0211-2openalex-snapshot

Efficient fastest-path computations for road maps

inferred← citeshttps://doi.org/10.1007/s42452-020-2635-1openalex-snapshot

A novel graph matrix representation: sequence of neighbourhood matrices with an application

inferred← citeshttps://doi.org/10.1016/b978-0-12-812993-7.00002-4openalex-snapshot

ARTS for Last-Mile Transport Designing and Integrating in Cities

inferred← citeshttps://doi.org/10.1016/j.aej.2021.08.029openalex-snapshot

Multimodal transport distribution model for autonomous driving vehicles based on improved ALNS

inferred← citeshttps://doi.org/10.1016/j.apor.2018.12.001openalex-snapshot

Smoothed A* algorithm for practical unmanned surface vehicle path planning

inferred← citeshttps://doi.org/10.1016/j.artint.2017.05.004openalex-snapshot

MM: A bidirectional search algorithm that is guaranteed to meet in the middle

inferred← citeshttps://doi.org/10.1016/j.asoc.2020.107049openalex-snapshot

Skills2Job: A recommender system that encodes job offer embeddings on graph databases

inferred← citeshttps://doi.org/10.1016/j.autcon.2016.04.001openalex-snapshot

Graph theory based representation of building information models for access control applications

inferred← citeshttps://doi.org/10.1016/j.autcon.2021.103967openalex-snapshot

A data structure for studying 3D modeling design behavior based on event logs

inferred← citeshttps://doi.org/10.1016/j.bdr.2021.100221openalex-snapshot

Network-Based Trajectory Search over Time Intervals

inferred← citeshttps://doi.org/10.1016/j.cag.2021.11.007openalex-snapshot

Parallel near-optimal pathfinding based on landmarks

inferred← citeshttps://doi.org/10.1016/j.cie.2008.03.016openalex-snapshot

A comparison of algorithms for origin–destination matrix generation on real road networks and an approximation approach

inferred← citeshttps://doi.org/10.1016/j.compenvurbsys.2015.07.004openalex-snapshot

From raster to vector cellular automata models: A new approach to simulate urban growth with the help of graph theory

inferred← citeshttps://doi.org/10.1016/j.cor.2014.04.015openalex-snapshot

A lower bound for the quickest path problem

inferred← citeshttps://doi.org/10.1016/j.dam.2019.08.027openalex-snapshot

Bundling all shortest paths

inferred← citeshttps://doi.org/10.1016/j.datak.2011.10.001openalex-snapshot

A safe-exit approach for efficient network-based moving range queries

inferred← citeshttps://doi.org/10.1016/j.ejor.2008.09.032openalex-snapshot

A new bidirectional search algorithm with shortened postprocessing

inferred← citeshttps://doi.org/10.1016/j.ejor.2010.06.003openalex-snapshot

Note on “A new bidirectional algorithm for shortest paths”

inferred← citeshttps://doi.org/10.1016/j.ejor.2019.01.007openalex-snapshot

A biobjective Dijkstra algorithm

inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.122openalex-snapshot

Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem

inferred← citeshttps://doi.org/10.1016/j.engappai.2021.104378openalex-snapshot

BiS4EV: A fast routing algorithm considering charging stations and preferences for electric vehicles

inferred← citeshttps://doi.org/10.1016/j.eswa.2011.12.022openalex-snapshot

Multiobjective heuristic search in road maps

inferred← citeshttps://doi.org/10.1016/j.eswa.2020.113816openalex-snapshot

Self-driving cars: A survey

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.ins.2016.12.013openalex-snapshot

Disk-based shortest path discovery using distance index over large dynamic graphs

inferred← citeshttps://doi.org/10.1016/j.ins.2017.12.031openalex-snapshot

Map matching for low-sampling-rate GPS trajectories by exploring real-time moving directions

inferred← citeshttps://doi.org/10.1016/j.is.2017.05.004openalex-snapshot

Efficient processing of shortest path queries in evolving graph sequences

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.is.2019.101453openalex-snapshot

Efficient Path Routing Over Road Networks in the Presence of Ad-Hoc Obstacles

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.1016/j.jcss.2015.06.008openalex-snapshot

Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs

inferred← citeshttps://doi.org/10.1016/j.jcss.2016.09.011openalex-snapshot

Computing source-to-target shortest paths for complex networks in RDBMS

inferred← citeshttps://doi.org/10.1016/j.jda.2007.08.003openalex-snapshot

A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

inferred← citeshttps://doi.org/10.1016/j.jda.2017.09.001openalex-snapshot

Engineering graph-based models for dynamic timetable information systems

inferred← citeshttps://doi.org/10.1016/j.measurement.2014.10.014openalex-snapshot

A decremental approach with the A ∗ algorithm for speeding-up the optimization process in dynamic shortest path problems

inferred← citeshttps://doi.org/10.1016/j.neucom.2009.04.005openalex-snapshot

A modified pulse coupled neural network for shortest-path problem

inferred← citeshttps://doi.org/10.1016/j.physa.2020.125718openalex-snapshot

Probabilistic model based path planning

inferred← citeshttps://doi.org/10.1016/j.pnsc.2008.01.031openalex-snapshot

A shortest path algorithm for moving objects in spatial network databases

inferred← citeshttps://doi.org/10.1016/j.proeng.2017.02.477openalex-snapshot

Environmental Optimization of Urban Travel Using Mobile Devices Detection

inferred← citeshttps://doi.org/10.1016/j.sbi.2015.02.015openalex-snapshot

From local to global changes in proteins: a network view

inferred← citeshttps://doi.org/10.1016/j.simpat.2015.05.005openalex-snapshot

SEMSim Cloud Service: Large-scale urban systems simulation in the cloud

inferred← citeshttps://doi.org/10.1016/j.trc.2015.07.011openalex-snapshot

A real-time Active Routing approach via a database for airport surface movement

inferred← citeshttps://doi.org/10.1016/j.trc.2015.09.010openalex-snapshot

Large-scale transit itinerary planning under uncertainty

inferred← citeshttps://doi.org/10.1016/j.trc.2016.09.009openalex-snapshot

Algorithms to find shortest and alternative paths in free flow and congested traffic regimes

inferred← citeshttps://doi.org/10.1016/j.trc.2024.104689openalex-snapshot

Improving multi-modal transportation recommendation systems through contrastive De-biased heterogenous graph neural networks

inferred← citeshttps://doi.org/10.1016/j.tre.2019.11.013openalex-snapshot

Efficient algorithm for finding k shortest paths based on re-optimization technique

inferred← citeshttps://doi.org/10.1016/j.trpro.2016.12.087openalex-snapshot

A Matching Algorithm for Dynamic Ridesharing

inferred← citeshttps://doi.org/10.1016/j.yofte.2018.12.021openalex-snapshot

Capacity-bounded lightpath routing in WDM optical networks

inferred← citeshttps://doi.org/10.1038/s41467-021-23319-1openalex-snapshot

Health improvement framework for actionable treatment planning using a surrogate Bayesian model

inferred← citeshttps://doi.org/10.1051/matecconf/201822002004openalex-snapshot

A Route Reservation Approach for an Autonomous Vehicles Routing Problem

inferred← citeshttps://doi.org/10.1061/9780784481547.006openalex-snapshot

Algorithms to Find Shortest Paths with Added Constraint on Travel Fuel Consumption for Transportation Networks

inferred← citeshttps://doi.org/10.1061/jcemd4.coeng-14956openalex-snapshot

Clarifying Unsafe Behaviors of Construction Workers through a Complex Network of Unsafe Behavior Chains

showing the first 200 of 657

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.