On the public citation graph
Experimental study of speed up techniques for timetable information systems
0 signed · 107 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.20382openalex-snapshot
Experimental study of speed up techniques for timetable information systems
inferredcites →https://doi.org/10.1007/11427186_13openalex-snapshot
Acceleration of Shortest Path and Constrained Shortest Path Computation
inferredcites →https://doi.org/10.1007/11427186_18openalex-snapshot
Partitioning Graphs to Speed Up Dijkstra’s Algorithm
inferredcites →https://doi.org/10.1007/3-540-45643-0_4openalex-snapshot
Using Multi-level Graphs for Timetable Information in Railway Systems
inferredcites →https://doi.org/10.1007/978-3-540-24838-5_20openalex-snapshot
Combining Speed-Up Techniques for Shortest-Path Computations
inferredcites →https://doi.org/10.1007/978-3-540-68552-4_23openalex-snapshot
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-68552-4_25openalex-snapshot
Bidirectional A ∗ Search for Time-Dependent Fast Paths
inferredcites →https://doi.org/10.1007/978-3-540-70918-3_3openalex-snapshot
Speed-Up Techniques for Shortest-Path Computations
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_2openalex-snapshot
Engineering Fast Route Planning Algorithms
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_5openalex-snapshot
Landmark-Based Routing in Dynamic Graphs
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-74247-0_3openalex-snapshot
Timetable Information: Models and Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-87744-8_28openalex-snapshot
Time-Dependent SHARC-Routing
inferredcites →https://doi.org/10.1007/978-3-540-92182-0_71openalex-snapshot
Bidirectional Core-Based Routing in Dynamic Time-Dependent 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-05465-5_10openalex-snapshot
Efficient Timetable Information in the Presence of Delays
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s10115-003-0128-3openalex-snapshot
Characterizing and Mining the Citation Graph of the Computer Science Literature
inferredcites →https://doi.org/10.1016/0022-247x(66)90009-6openalex-snapshot
The shortest route through a network with time-dependent internodal transit times
inferredcites →https://doi.org/10.1016/j.entcs.2003.12.024openalex-snapshot
Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach
inferredcites →https://doi.org/10.1090/dimacs/074/04openalex-snapshot
High-performance multi-level routing
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.2007.370687openalex-snapshot
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
inferredcites →https://doi.org/10.1109/ipdps.2008.4536261openalex-snapshot
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale 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.1126/science.1137521openalex-snapshot
Fast Routing in Road Networks with Transit Nodes
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.9781611972863.15openalex-snapshot
Engineering Multi-Level Overlay Graphs for Shortest-Path Queries
inferredcites →https://doi.org/10.1137/1.9781611972870.3openalex-snapshot
An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
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.2openalex-snapshot
SHARC: Fast and Robust Unidirectional Routing
inferredcites →https://doi.org/10.1145/1064546.1103378openalex-snapshot
Geometric containers for efficient shortest-path computation
inferredcites →https://doi.org/10.1145/1064546.1180616openalex-snapshot
Combining speed-up techniques for shortest-path computations
inferredcites →https://doi.org/10.1145/1187436.1216585openalex-snapshot
Partitioning graphs to speedup Dijkstra's algorithm
inferredcites →https://doi.org/10.1145/1227161.1227166openalex-snapshot
Efficient models for timetable information in public transportation systems
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/564585.564602openalex-snapshot
Topology control and routing in ad hoc networks
inferredcites →https://doi.org/10.1145/778415.778447openalex-snapshot
Worst-Case optimal and average-case efficient geometric ad-hoc routing
inferredcites →https://doi.org/10.4230/oasics.atmos.2008.1584openalex-snapshot
Efficient On-Trip Timetable Information in the Presence of Delays
inferredcites →https://doi.org/10.4230/oasics.atmos.2009.2148openalex-snapshot
Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected
inferredcites →https://doi.org/10.5555/1070432.1070455openalex-snapshot
Computing the shortest path: A search meets graph theory
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-50578-3_21openalex-snapshot
Geospatial Partitioning of Open Transit Data
inferred← citeshttps://doi.org/10.1007/978-3-319-00029-9_17openalex-snapshot
Route Search Algorithm in Timetable Graphs and Extension for Block Agents
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-49487-6_2openalex-snapshot
Route Planning in Transportation 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_26openalex-snapshot
Multi-criteria Shortest Paths in Time-Dependent Train Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02011-7_7openalex-snapshot
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
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-13193-6_4openalex-snapshot
Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks
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-38527-8_24openalex-snapshot
Computing Multimodal Journeys in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_6openalex-snapshot
Intriguingly Simple and Fast Transit Routing
inferred← citeshttps://doi.org/10.1007/978-981-33-4901-8_16openalex-snapshot
Multimodal Routing for Connecting People and Events
inferred← citeshttps://doi.org/10.1007/s12469-009-0014-9openalex-snapshot
Integrating line planning, timetabling, and vehicle scheduling: a customer-oriented heuristic
inferred← citeshttps://doi.org/10.1016/j.cor.2011.03.020openalex-snapshot
Integrating public transportation in personalised electronic tourist guides
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.11.023openalex-snapshot
Itinerary planning with time budget for risk-averse travelers
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.osn.2015.01.004openalex-snapshot
Maximizing the reliability of dual homed, critical services in wireless/cellular networks
inferred← citeshttps://doi.org/10.1016/j.procs.2017.05.379openalex-snapshot
A new time-dependent shortest path algorithm for multimodal transportation network
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.trb.2008.05.010openalex-snapshot
Hyperstar: A multi-path Astar algorithm for risk averse vehicle navigation
inferred← citeshttps://doi.org/10.1016/j.trb.2013.05.002openalex-snapshot
Incorporating space–time constraints and activity-travel time profiles in a multi-state supernetwork approach to individual activity-travel scheduling
inferred← citeshttps://doi.org/10.1016/j.trpro.2015.09.003openalex-snapshot
A Real-time Information System for Public Transport in Case of Delays and Service Disruptions
inferred← citeshttps://doi.org/10.1016/j.trpro.2015.09.028openalex-snapshot
Memetic Algorithm for Computing Shortest Paths in Multimodal Transportation Networks
inferred← citeshttps://doi.org/10.1080/19475683.2016.1276100openalex-snapshot
Time-dependent, activity-based itinerary personal tour planning in multimodal transportation networks
inferred← citeshttps://doi.org/10.1090/dimacs/074/03openalex-snapshot
Fast point-to-point shortest path computations with arc-flags
inferred← citeshttps://doi.org/10.1109/aim.2013.6584061openalex-snapshot
Hybrid Dijkstra-PSO algorithm for motion planning of non-holonomic multiple-trailer platforms in dense contexts
inferred← citeshttps://doi.org/10.1109/icctac.2016.7567336openalex-snapshot
Effective route planning in road networks using multi constraint routing algorithm
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470345openalex-snapshot
Parallel computation of best connections in public transportation networks
inferred← citeshttps://doi.org/10.1109/itsc.2015.422openalex-snapshot
Diversification of Route Planning Results for Improved User Satisfaction
inferred← citeshttps://doi.org/10.1109/tits.2012.2201478openalex-snapshot
A Real-Time Vehicle Navigation Algorithm in Sensor Network Environments
inferred← citeshttps://doi.org/10.1137/1.9781611972924.13openalex-snapshot
Round-Based Public Transit Routing
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/2133803.2330080openalex-snapshot
Engineering highway hierarchies
inferred← citeshttps://doi.org/10.1145/2133803.2345678openalex-snapshot
Parallel computation of best connections in public transportation networks
inferred← citeshttps://doi.org/10.1145/2723372.2749456openalex-snapshot
Efficient Route Planning on Public Transportation Networks
inferred← citeshttps://doi.org/10.1145/2812428.2812463openalex-snapshot
Navigation support for old and handicapped persons in urban regions
inferred← citeshttps://doi.org/10.1145/2985473openalex-snapshot
Highway Dimension and Provably Efficient Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1287/trsc.2014.0534openalex-snapshot
Round-Based Public Transit Routing
inferred← citeshttps://doi.org/10.1287/trsc.2021.1104openalex-snapshot
MUSE: Multimodal Separators for Efficient Route Planning in Transportation Networks
inferred← citeshttps://doi.org/10.1287/trsc.2022.0198openalex-snapshot
ULTRA: Unlimited Transfers for Efficient Multimodal Journey Planning
inferred← citeshttps://doi.org/10.13052/jwe1540-9589.2045openalex-snapshot
Geospatially Partitioning Public Transit Networks for Open Data Publishing
inferred← citeshttps://doi.org/10.3141/2256-05openalex-snapshot
Algorithm for Finding Optimal Paths in a Public Transit Network with Real-Time Data
inferred← citeshttps://doi.org/10.32657/10356/151191openalex-snapshot
Multi-criteria journey planning for enhancing user experience in multimodal transportation systems
inferred← citeshttps://doi.org/10.32657/10356/68898openalex-snapshot
Efficient index structures for reachability and shortest path queries
inferred← citeshttps://doi.org/10.35376/10324/16003openalex-snapshot
Parallel approaches to shortest-path problems for multilevel heterogeneous computing
inferred← citeshttps://doi.org/10.3929/ethz-b-000076385openalex-snapshot
Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2008.1582openalex-snapshot
Engineering Time-Expanded Graphs for Faster Timetable Information
inferred← citeshttps://doi.org/10.5445/ir/1000007755openalex-snapshot
Route Planning in Road Networks
inferred← citeshttps://doi.org/10.5445/ir/1000011046openalex-snapshot
Engineering and Augmenting Route Planning Algorithms
inferred← citeshttps://doi.org/10.5445/ir/1000035705openalex-snapshot
Building Blocks for Mapping Services
inferred← citeshttps://doi.org/10.6100/ir760432openalex-snapshot
Synchronizing networks : the modeling of supernetworks for activity-travel behavior
inferred← citeshttps://doi.org/10.70675/cdcadd40z8d68z404az9dcdze37c68fab0c2openalex-snapshot
Efficient route planning for dynamic and multimodal transportation networks
showing the first 60 of 61 · page through all 61
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.