On the public citation graph

Shortest paths without a map

0 signed · 120 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-17179-7_9openalex-snapshot
Shortest-path motion
inferredcites →https://doi.org/10.1016/0020-0190(85)90029-8openalex-snapshot
An algorithm for shortest-path motion in three dimensions
inferredcites →https://doi.org/10.1016/0022-0000(85)90045-5openalex-snapshot
Games against nature
inferredcites →https://doi.org/10.1109/sfcs.1987.42openalex-snapshot
New lower bound techniques for robot motion planning problems
inferredcites →https://doi.org/10.1137/0216045openalex-snapshot
The Discrete Geodesic Problem
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/28395.28435openalex-snapshot
An optimal online algorithm for metrical task systems
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199603)27:2<133::aid-net5>3.0.co;2-lopenalex-snapshot
Stochastic shortest path problems with recourse
inferred← citeshttps://doi.org/10.1002/net.3230220404openalex-snapshot
Paths through a maze of rectangles
inferred← citeshttps://doi.org/10.1006/inco.1993.1054openalex-snapshot
Searching in the Plane
inferred← citeshttps://doi.org/10.1006/jagm.1994.1039openalex-snapshot
Online Navigation in a Room
inferred← citeshttps://doi.org/10.1006/jpdc.1996.1257openalex-snapshot
Competitive Analysis of Network Load Balancing
inferred← citeshttps://doi.org/10.1007/11561071_5openalex-snapshot
Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio
inferred← citeshttps://doi.org/10.1007/11940128_65openalex-snapshot
Online Multi-path Routing in a Maze
inferred← citeshttps://doi.org/10.1007/3-540-36477-3_20openalex-snapshot
A Lower Bound for Randomized Searching on m Rays
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_33openalex-snapshot
Computing Shortest Paths with Uncertainty
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_27openalex-snapshot
Online Parallel Heuristics and Robot Searching under the Competitive Framework
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_48openalex-snapshot
The CNN Problem and Other k-Server Variants
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_12openalex-snapshot
Parallel Searching on m Rays
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_178openalex-snapshot
On-line algorithms for weighted bipartite matching and stable marriages
inferred← citeshttps://doi.org/10.1007/3-540-54891-2_10openalex-snapshot
Moving along a street (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_56openalex-snapshot
An on-line algorithm for navigating in unknown terrain
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_180openalex-snapshot
A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_65openalex-snapshot
Constructing competitive tours from local information
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_266openalex-snapshot
Robot mapping: Foot-prints vs tokens
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_104openalex-snapshot
Efficient strategies for robot navigation in unknown environment
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_11openalex-snapshot
The Ultimate Strategy to Search on m Rays?
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_32openalex-snapshot
Priority Evacuation from a Disk Using Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-030-14094-6_5openalex-snapshot
Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_36openalex-snapshot
Most Vital Segment Barriers
inferred← citeshttps://doi.org/10.1007/978-3-030-70354-7_11openalex-snapshot
Computational Complexity as Anthropic Principle: A Fable
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_2openalex-snapshot
The Complexity of Graph Exploration Games
inferred← citeshttps://doi.org/10.1007/978-3-319-23540-0_5openalex-snapshot
State Space Search with Stochastic Costs and Risk Aversion
inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_4openalex-snapshot
Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_46openalex-snapshot
Hyperbolic Dovetailing
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_47openalex-snapshot
Competitive Search in Symmetric Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-38016-7_6openalex-snapshot
Online Exploration of Polygons with Holes
inferred← citeshttps://doi.org/10.1007/bf02098286openalex-snapshot
Dynamic vehicle routing: Status and prospects
inferred← citeshttps://doi.org/10.1007/bf02189324openalex-snapshot
On convex body chasing
inferred← citeshttps://doi.org/10.1007/bfb0029565openalex-snapshot
Metrical task systems, the server problem and the work function algorithm
inferred← citeshttps://doi.org/10.1007/bfb0036204openalex-snapshot
Lower bounds in on-line geometric searching metric searching
inferred← citeshttps://doi.org/10.1007/s00446-017-0296-0openalex-snapshot
Search on a line with faulty robots
inferred← citeshttps://doi.org/10.1007/s10878-007-9120-2openalex-snapshot
Finding the anti-block vital edge of a shortest path between two nodes
inferred← citeshttps://doi.org/10.1007/s10878-015-9905-7openalex-snapshot
The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation
inferred← citeshttps://doi.org/10.1007/s10957-017-1145-9openalex-snapshot
Shortest Paths with Shortest Detours
inferred← citeshttps://doi.org/10.1007/s11750-015-0384-xopenalex-snapshot
Robust optimization for routing problems on trees
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90140-6openalex-snapshot
An efficient strategy for robot navigation in unknown environment
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90154-6openalex-snapshot
Competitive algorithms for the weighted server problem
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90155-4openalex-snapshot
Constructing competitive tours from local information
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90010-popenalex-snapshot
Walking an unknown street with bounded detour
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90032-2openalex-snapshot
A competitive analysis of algorithms for searching unknown scenes
inferred← citeshttps://doi.org/10.1016/b978-1-55860-203-8.50041-3openalex-snapshot
High Level Path Planning with Uncertainty
inferred← citeshttps://doi.org/10.1016/b978-85-352-7814-9.50009-9openalex-snapshot
Problemas de Conexão: Árvores, Caminhos e Emparelhamento
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.005openalex-snapshot
Computing shortest paths with uncertainty
inferred← citeshttps://doi.org/10.1016/j.jda.2018.04.002openalex-snapshot
A pathfinding problem for search trees with unknown edge length
inferred← citeshttps://doi.org/10.1016/j.seps.2015.10.003openalex-snapshot
Debris removal during disaster response: A case for Turkey
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.08.001openalex-snapshot
On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.029openalex-snapshot
Group search of the plane with faulty robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.026openalex-snapshot
Priority evacuation from a disk: The case of n = 1,2,3
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00033-2openalex-snapshot
On stable social laws and qualitative equilibria
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00191-4openalex-snapshot
Tight analysis of a self-approaching strategy for the online kernel-search problem
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80060-1openalex-snapshot
Competitive k-server algorithms
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1023/a:1018917719749openalex-snapshot
Dynamic non-Bayesian decision making in multi-agent systems
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00036openalex-snapshot
Shortest Paths without a Map, but with an Entropic Regularizer
inferred← citeshttps://doi.org/10.1109/fscs.1990.89566openalex-snapshot
Competitive k-server algorithms
inferred← citeshttps://doi.org/10.1109/icemms.2011.6015686openalex-snapshot
Online rescue vehicle scheduling problem of emergency logistics
inferred← citeshttps://doi.org/10.1109/icmlc.2003.1259845openalex-snapshot
On-line multi-CBR agent dispatching
inferred← citeshttps://doi.org/10.1109/icra.2019.8794252openalex-snapshot
The Robust Canadian Traveler Problem Applied to Robot Routing
inferred← citeshttps://doi.org/10.1109/icra57147.2024.10610476openalex-snapshot
Multi-Sample Long Range Path Planning under Sensing Uncertainty for Off-Road Autonomous Driving
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019273openalex-snapshot
The travelling miser problem
inferred← citeshttps://doi.org/10.1109/iros.2015.7353915openalex-snapshot
Online robotic adversarial coverage
inferred← citeshttps://doi.org/10.1109/istcs.1993.253459openalex-snapshot
Competitive algorithms for the weighted server problem
inferred← citeshttps://doi.org/10.1109/iwqos.2010.5542719openalex-snapshot
Routing with uncertainty in wireless mesh networks
inferred← citeshttps://doi.org/10.1109/robot.1994.351179openalex-snapshot
Reactive algorithms for grasping using a modified parallel jaw gripper
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185365openalex-snapshot
On selecting a satisfying truth assignment
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185381openalex-snapshot
Competitive algorithms for layered graph traversal
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185382openalex-snapshot
How to learn an unknown environment
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185383openalex-snapshot
Walking an unknown street with bounded detour
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366887openalex-snapshot
An on-line algorithm for improving performance in navigation
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365677openalex-snapshot
Beyond competitive analysis [on-line algorithms]
inferred← citeshttps://doi.org/10.1109/tnet.2006.880164openalex-snapshot
The traveling miser problem
inferred← citeshttps://doi.org/10.1109/tsmcb.2008.2004505openalex-snapshot
Robust Navigation in an Unknown Environment With Minimal Sensing and Representation
inferred← citeshttps://doi.org/10.1109/vnis.1993.585692openalex-snapshot
The optimal way for looking around a corner
inferred← citeshttps://doi.org/10.1111/coin.12098openalex-snapshot
Exact and Heuristic Algorithms for Risk‐Aware Stochastic Physical Search
inferred← citeshttps://doi.org/10.1117/12.25506openalex-snapshot
Algorithmic approaches to optimal route planning
inferred← citeshttps://doi.org/10.1137/s0097539791194931openalex-snapshot
Navigating in Unfamiliar Geometric Terrain
inferred← citeshttps://doi.org/10.1137/s0097539792224838openalex-snapshot
Lower Bounds for Randomized k -Server and Motion-Planning Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539796299540openalex-snapshot
Beyond Competitive Analysis
inferred← citeshttps://doi.org/10.1142/s0129054121500209openalex-snapshot
Search on a Line by Byzantine Robots
inferred← citeshttps://doi.org/10.1145/103418.103419openalex-snapshot
Navigating in unfamiliar geometric terrain
inferred← citeshttps://doi.org/10.1145/103418.103450openalex-snapshot
Lower bounds for randomized k-server and motion-planning algorithms
inferred← citeshttps://doi.org/10.1145/103418.103451openalex-snapshot
Infinite games
inferred← citeshttps://doi.org/10.1145/195058.195125openalex-snapshot
The minimum latency problem
inferred← citeshttps://doi.org/10.1145/237218.237395openalex-snapshot
Optimal robot localization in trees
inferred← citeshttps://doi.org/10.1145/262839.263062openalex-snapshot
New competitive strategies for searching in unknown star-shaped polygons
inferred← citeshttps://doi.org/10.1145/2933057.2933102openalex-snapshot
Search on a Line with Faulty Robots
inferred← citeshttps://doi.org/10.1145/337244.337251openalex-snapshot
An axiomatic treatment of three qualitative decision criteria
inferred← citeshttps://doi.org/10.1145/3564246.3585132openalex-snapshot
The Randomized 𝑘-Server Conjecture Is False!
inferred← citeshttps://doi.org/10.1177/0278364915625785openalex-snapshot
Robotic adversarial coverage of known environments
inferred← citeshttps://doi.org/10.1613/jair.447openalex-snapshot
Dynamic Non-Bayesian Decision Making
inferred← citeshttps://doi.org/10.1613/jair.51openalex-snapshot
On Planning while Learning
inferred← citeshttps://doi.org/10.18682/cyt.v1i12.653openalex-snapshot
Algoritmos Genéticos Basados en Criterios para rompecabezas NP-Completos
inferred← citeshttps://doi.org/10.22215/etd/2021-14519openalex-snapshot
Search and Rendezvous by Mobile Robots in Continuous Domains
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-20openalex-snapshot
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models
inferred← citeshttps://doi.org/10.32920/24231046openalex-snapshot
A Multi-Objective Optimization Problem on Evacuating 2 Robots from the Disk in the Face-to-Face Model; Trade-Offs between Worst-Case and Average-Case Analysis
inferred← citeshttps://doi.org/10.32920/24231046.v1openalex-snapshot
A Multi-Objective Optimization Problem on Evacuating 2 Robots from the Disk in the Face-to-Face Model; Trade-Offs between Worst-Case and Average-Case Analysis
inferred← citeshttps://doi.org/10.32920/24231049openalex-snapshot
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models
inferred← citeshttps://doi.org/10.3390/a14120367openalex-snapshot
A Pathfinding Problem for Fork-Join Directed Acyclic Graphs with Unknown Edge Length
inferred← citeshttps://doi.org/10.3390/books978-3-0365-2843-4openalex-snapshot
Distributed Systems and Mobile Computing
inferred← citeshttps://doi.org/10.3390/info11110506openalex-snapshot
A Multi-Objective Optimization Problem on Evacuating 2 Robots from the Disk in the Face-to-Face Model; Trade-Offs between Worst-Case and Average-Case Analysis
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2020.54openalex-snapshot
Parametrized Metrical Task Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00284openalex-snapshot
Bayesian Policy Search for Stochastic Domains
inferred← citeshttps://doi.org/10.5220/0004760604010408openalex-snapshot
Optimal Fixed Interval Satellite Range Scheduling
inferred← citeshttps://doi.org/10.5555/127787.127835openalex-snapshot
The Canadian Traveller Problem
inferred← citeshttps://doi.org/10.5555/2772879.2773263openalex-snapshot
Frontier-Based RTDP: A New Approach to Solving the Robotic Adversarial Coverage Problem
inferred← citeshttps://doi.org/10.5555/313559.313843openalex-snapshot
On traversing layered graphs on-line
inferred← citeshttps://doi.org/10.5555/313559.313847openalex-snapshot
On-line choice of on-line 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.