On the public citation graph

Finding k-shortest paths with limited overlap

https://doi.org/10.1007/s00778-020-00604-x

0 signed · 102 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/978-3-642-02011-7_13openalex-snapshot

Pareto Paths with SHARC

inferredcites →https://doi.org/10.1007/978-3-642-19754-3_5openalex-snapshot

Alternative Route Graphs in Road Networks

inferredcites →https://doi.org/10.1007/978-3-642-29038-1_41openalex-snapshot

Traffic Aware Route Planning in Dynamic 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/s10288-002-0010-2openalex-snapshot

A new implementation of Yen?s ranking loopless paths algorithm

inferredcites →https://doi.org/10.1007/s10479-012-1284-1openalex-snapshot

Solving multi-objective traffic assignment

inferredcites →https://doi.org/10.1007/s10707-016-0265-yopenalex-snapshot

Discovering historic traffic-tolerant paths in road networks

inferredcites →https://doi.org/10.1007/s12205-010-0041-8openalex-snapshot

A dissimilar alternative paths-search algorithm for navigation services: A heuristic approach

inferredcites →https://doi.org/10.1016/s0377-2217(99)00214-3openalex-snapshot

On finding dissimilar paths

inferredcites →https://doi.org/10.1023/a:1015231126594openalex-snapshot

A Framework for Generating Network-Based Moving Objects

inferredcites →https://doi.org/10.1038/sdata.2016.46openalex-snapshot

A protocol to convert spatial polyline data to network formats and applications to world urban road networks

inferredcites →https://doi.org/10.1109/ds-rt.2013.17openalex-snapshot

ROThAr: Real-Time On-Line Traffic Assignment with Load Estimation

inferredcites →https://doi.org/10.1109/icde.2010.5447845openalex-snapshot

Route skyline queries: A multi-preference path planning approach

inferredcites →https://doi.org/10.1109/icde.2010.5447851openalex-snapshot

Preference queries in large multi-cost transportation networks

inferredcites →https://doi.org/10.1109/icde.2011.5767890openalex-snapshot

Discovering popular routes from trajectories

inferredcites →https://doi.org/10.1109/mdm.2015.29openalex-snapshot

Vehicle Routing with User-Generated Trajectory Data

inferredcites →https://doi.org/10.1109/tkde.2016.2621104openalex-snapshot

Citywide Traffic Volume Estimation Using Trajectory Data

inferredcites →https://doi.org/10.1109/tkde.2017.2773492openalex-snapshot

Finding Top-k Shortest Paths with Diversity

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/tvt.2015.2476958openalex-snapshot

SAINT: Self-Adaptive Interactive Navigation Tool for Cloud-Based Vehicular Traffic Optimization

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

The Complexity of Enumeration and Reliability Problems

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

Constructing pairwise disjoint paths with few links

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

Finding the k shortest simple paths

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

Scalable network distance browsing in spatial databases

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

T-drive

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

Constructing popular routes from uncertain trajectories

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

Finding Alternative Shortest Paths in Spatial Networks

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

Alternative routes in road networks

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

Shortest-path queries in static networks

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

Traffic matrix estimation from road sensor data

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

Alternative routing

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

Finding The Most Preferred Path

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

Finding k -dissimilar paths with minimum collective length

inferredcites →https://doi.org/10.1287/mnsc.17.11.712openalex-snapshot

Finding the K Shortest Loopless Paths in a Network

inferredcites →https://doi.org/10.3390/s16020157openalex-snapshot

A Survey on Urban Traffic Management System Using Wireless Sensor Networks

inferredcites →https://doi.org/10.5441/002/edbt.2017.37openalex-snapshot

Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap

inferredcites →https://doi.org/10.7155/jgaa.00142openalex-snapshot

Estimating the Number of s-t Paths in a Graph

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.4673353openalex-extracted

Encoding Path Sets in Acyclic Subgraphs

inferred← citeshttps://doi.org/10.1007/978-3-031-15512-3_6openalex-snapshot

Diverse Shortest Paths in Game Maps: A Comparative User Study and Experiments

inferred← citeshttps://doi.org/10.1007/978-3-031-78541-2_20openalex-snapshot

On Mining Dynamic Graphs for k Shortest Paths

inferred← citeshttps://doi.org/10.1007/978-3-032-31390-4_24openalex-snapshot

Comparison of Path Generation Techniques for Optical Network Optimization

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

Diversity in Routing: From Vertices and Edges to Paths

inferred← citeshttps://doi.org/10.1007/978-981-92-0378-9_15openalex-snapshot

Diversified Top-k Optimal Routes with Collective Spatial Keywords in Road Networks

inferred← citeshttps://doi.org/10.1007/978-981-95-3906-2_20openalex-snapshot

ShareDP: Finding k Disjoint Paths for Multiple Vertex Pairs

inferred← citeshttps://doi.org/10.1007/s00521-022-07485-xopenalex-snapshot

Most relevant point query on road networks

inferred← citeshttps://doi.org/10.1007/s00778-021-00674-5openalex-snapshot

Efficient Hop-constrained s-t Simple Path Enumeration

inferred← citeshttps://doi.org/10.1007/s00778-025-00940-wopenalex-snapshot

Route optimization with collective spatial keywords: A skyline-based approach

inferred← citeshttps://doi.org/10.1007/s10707-025-00553-zopenalex-snapshot

The path is the goal: A study on the nature and effects of shortest-path stability under perturbation of destination

inferred← citeshttps://doi.org/10.1007/s11067-022-09582-9openalex-snapshot

Traffic Graph Convolutional Network for Dynamic Urban Travel Speed Estimation

inferred← citeshttps://doi.org/10.1007/s11067-024-09618-2openalex-snapshot

Finding the $$\mathrm{K}$$ Mean-Standard Deviation Shortest Paths Under Travel Time Uncertainty

inferred← citeshttps://doi.org/10.1007/s11280-023-01188-6openalex-snapshot

Efficiently computing alternative paths in game maps

inferred← citeshttps://doi.org/10.1007/s11280-026-01426-7openalex-snapshot

UniRoute: A unified framework for keyword-aware route planning on road networks

inferred← citeshttps://doi.org/10.1007/s12667-026-00827-xopenalex-snapshot

An open-source benchmark of the state-of-the-art in electrical cable routing

inferred← citeshttps://doi.org/10.1016/j.comnet.2026.112067openalex-snapshot

PathWeaver: Enhancing LEO satellite networks resilience via topology design and randomized routing against link flooding attacks

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

A bi-level framework for heterogeneous fleet sizing of ride-hailing services considering an approximated mixed equilibrium between automated and non-automated traffic

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

Robust co-location pattern mining in urban areas based on multi-path proximity consideration

inferred← citeshttps://doi.org/10.1016/j.ifacol.2025.12.374openalex-snapshot

Integration of a Graph-Based Path Planner and Mixed-Integer MPC for Robot Navigation in Cluttered Environments

inferred← citeshttps://doi.org/10.1016/j.osn.2025.100826openalex-snapshot

Selection of candidate paths based on diversity in resource allocation problems on optical networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114272openalex-snapshot

Almost disjoint paths and separating by forbidden pairs

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

Data driven origin–destination matrix estimation on large networks—A joint origin–destination-path-choice formulation

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

An optimal method for resource allocation in SDN optical networks

inferred← citeshttps://doi.org/10.1049/itr2.12191openalex-snapshot

Adaptive personalized routing for vulnerable road users

inferred← citeshttps://doi.org/10.1080/20464177.2021.1996071openalex-snapshot

Integrating vulnerability analysis into the early stage distributed naval ship system design process

inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9671357openalex-snapshot

City-Scale System-Optimal Route Planning with Route Replanning

inferred← citeshttps://doi.org/10.1109/bigdata55660.2022.10020237openalex-snapshot

Generation of Synthetic Urban Vehicle Trajectories

inferred← citeshttps://doi.org/10.1109/globecom54140.2023.10437338openalex-snapshot

Minimizing Route Overlap for Priority Data Delivery in Next Generation IoT Networks

inferred← citeshttps://doi.org/10.1109/icde55515.2023.00194openalex-snapshot

Global Routing Optimization In Road Networks

inferred← citeshttps://doi.org/10.1109/icde60146.2024.00322openalex-snapshot

Approximate Skyline Index for Constrained Shortest Pathfinding with Theoretical Guarantee

inferred← citeshttps://doi.org/10.1109/icde60146.2024.00347openalex-snapshot

Managing the Future: Route Planning Influence Evaluation in Transportation Systems

inferred← citeshttps://doi.org/10.1109/icde60146.2024.00349openalex-snapshot

Congestion-Mitigating Spatiotemporal Routing in Road Networks

inferred← citeshttps://doi.org/10.1109/icde60146.2024.00350openalex-snapshot

A Just-In-Time Framework for Continuous Routing

inferred← citeshttps://doi.org/10.1109/icde65706.2026.00149openalex-snapshot

iKSP: A Path Enumeration Index in Road Networks

inferred← citeshttps://doi.org/10.1109/icdm54844.2022.00069openalex-snapshot

Efficient Navigation for Constrained Shortest Path with Adaptive Expansion Control

inferred← citeshttps://doi.org/10.1109/mdm55031.2022.00083openalex-snapshot

ASTRO-K: Finding Top-k Sufficiently Distinct Indoor-Outdoor Paths

inferred← citeshttps://doi.org/10.1109/mdm61037.2024.00036openalex-snapshot

Generating Trajectories from Implicit Neural Models

inferred← citeshttps://doi.org/10.1109/tits.2023.3343490openalex-snapshot

Flexible Paths: A Path Planning Approach to Dynamic Navigation

inferred← citeshttps://doi.org/10.1109/tits.2024.3396173openalex-snapshot

Efficient Alternative Route Planning in Road Networks

inferred← citeshttps://doi.org/10.1109/tits.2025.3544252openalex-snapshot

Finding the Maximum Density Path Within Constrained Length in a Graph

inferred← citeshttps://doi.org/10.1109/tkde.2021.3063717openalex-snapshot

Comparing Alternative Route Planning Techniques: A Comparative User Study on Melbourne, Dhaka and Copenhagen Road Networks

inferred← citeshttps://doi.org/10.1109/tkde.2023.3312566openalex-snapshot

TED+: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database

inferred← citeshttps://doi.org/10.1109/tkde.2024.3439409openalex-snapshot

Global Optimal Travel Planning for Massive Travel Queries in Road Networks

inferred← citeshttps://doi.org/10.1109/tnet.2023.3270565openalex-snapshot

Realizing Fine-Grained Inference of AS Path With a Generative Measurable Process

inferred← citeshttps://doi.org/10.1145/3474717.3483955openalex-snapshot

Most Diverse Near-Shortest Paths

inferred← citeshttps://doi.org/10.1145/3486629.3490695openalex-snapshot

A study of rerouting beyond ad hoc decision making

inferred← citeshttps://doi.org/10.1145/3588736openalex-snapshot

TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database

inferred← citeshttps://doi.org/10.1145/3771722openalex-snapshot

OCP: Proactive Optimal Charging Planning for Electric Vehicles

inferred← citeshttps://doi.org/10.1155/2024/4250807openalex-snapshot

Route Guidance Model with Limited Overlap on Freeway Network under Traffic Incidents

inferred← citeshttps://doi.org/10.14778/3407790.3407822openalex-snapshot

Continuously monitoring alternative shortest paths on road networks

inferred← citeshttps://doi.org/10.14778/3746405.3746440openalex-snapshot

Beyond Shortest Paths: Node Fairness in Route Recommendation

inferred← citeshttps://doi.org/10.14778/3748191.3748199openalex-snapshot

X-Blossom: Massive Parallelization of Graph Maximum Matching

inferred← citeshttps://doi.org/10.1609/aaai.v36i4.20290openalex-snapshot

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study

inferred← citeshttps://doi.org/10.2139/ssrn.5002491openalex-snapshot

Multipath Island-Based Genetic Algorithm for the K-Most Diverse Near-Shortest Paths

inferred← citeshttps://doi.org/10.32614/cran.package.spoptopenalex-snapshot

spopt: Spatial Optimization for Regionalization, Facility Location, and Market Analysis

inferred← citeshttps://doi.org/10.3390/a14080220openalex-snapshot

Time-Dependent Alternative Route Planning: Theory and Practice

inferred← citeshttps://doi.org/10.3390/app131810071openalex-snapshot

Application of Traffic Weighted Multi-Maps Based on Disjoint Routing Areas for Static Traffic Assignment

inferred← citeshttps://doi.org/10.3390/electronics12030518openalex-snapshot

Random Routing Algorithm for Enhancing the Cybersecurity of LEO Satellite Networks

inferred← citeshttps://doi.org/10.3390/ijgi11080434openalex-snapshot

Optimal Routing of Wide Multi-Modal Energy and Infrastructure Corridors

inferred← citeshttps://doi.org/10.3390/ijgi13040107openalex-snapshot

Road Accessibility during Natural Hazards Based on Volunteered Geographic Information Data and Network Analysis

inferred← citeshttps://doi.org/10.3390/systems12030089openalex-snapshot

Impact of Static Urban Traffic Flow-Based Traffic Weighted Multi-Maps Routing Strategies on Pollutant Emissions

inferred← citeshttps://doi.org/10.5311/josis.2023.26.221openalex-snapshot

Representative dissimilar path queries: accommodating human movement dynamics in road networks

inferred← citeshttps://doi.org/10.59782/sidr.v1i1.36openalex-snapshot

SDN dynamic flow scheduling algorithm based on discrete particle swarm

inferred← citeshttps://doi.org/10.70675/1001bb5az8603z4bddzb362z7fe030cf7216openalex-snapshot

Strategic planning for unmaned traffic management

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.