On the public citation graph

Piecemeal learning of an unknown environment

https://doi.org/10.1007/bf00993411
0 signed · 49 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/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1016/0304-3975(91)90263-2openalex-snapshot
Shortest paths without a map
inferredcites →https://doi.org/10.1109/fscs.1990.89554openalex-snapshot
Exploring an unknown graph
inferredcites →https://doi.org/10.1109/sfcs.1991.185382openalex-snapshot
How to learn an unknown environment
inferredcites →https://doi.org/10.1145/103418.103419openalex-snapshot
Navigating in unfamiliar geometric terrain
inferredcites →https://doi.org/10.1145/321958.321974openalex-snapshot
On the complexity of edge traversing
inferredcites →https://doi.org/10.1145/73007.73047openalex-snapshot
Inference of finite automata using homing sequences
inferredcites →https://doi.org/10.2172/10180101openalex-snapshot
Robot navigation in unknown terrains: Introductory survey of non-heuristic 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/net.20127openalex-snapshot
Collective Tree Exploration
inferred← citeshttps://doi.org/10.1006/inco.1999.2795openalex-snapshot
Piecemeal Graph Exploration by a Mobile Robot
inferred← citeshttps://doi.org/10.1006/inco.2001.2972openalex-snapshot
Optimal Robot Localization in Trees
inferred← citeshttps://doi.org/10.1006/inco.2001.3081openalex-snapshot
The Power of a Pebble: Exploring and Mapping Directed Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1999.1043openalex-snapshot
Exploring Unknown Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_5openalex-snapshot
Exploration of Convex Terrains by a Deterministic Automaton with Pebbles
inferred← citeshttps://doi.org/10.1007/978-3-032-23396-7_2openalex-snapshot
Implementing Piecemeal-DFS and Adversarial-DFS Algorithms on General Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_22openalex-snapshot
Competitive Exploration of Rectilinear Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_14openalex-snapshot
More Efficient Periodic Traversal in Anonymous Undirected Graphs
inferred← citeshttps://doi.org/10.1007/s00453-024-01275-8openalex-snapshot
Energy Constrained Depth First Search
inferred← citeshttps://doi.org/10.1007/s00453-026-01378-4openalex-snapshot
Graph Exploration: The Impact of a Distance Constraint
inferred← citeshttps://doi.org/10.1016/j.dam.2007.11.001openalex-snapshot
Impact of memory size on graph exploration capability
inferred← citeshttps://doi.org/10.1016/j.dam.2024.05.024openalex-snapshot
Graph exploration by a deterministic memoryless automaton with pebbles
inferred← citeshttps://doi.org/10.1016/j.ic.2008.07.005openalex-snapshot
Tree exploration with advice
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.10.002openalex-snapshot
Tree exploration with little memory
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.09.004openalex-snapshot
Fast periodic graph exploration with constant memory
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.10.004openalex-snapshot
Drawing maps with advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.031openalex-snapshot
Optimal graph exploration without good maps
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.014openalex-snapshot
Graph exploration by a finite automaton
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.032openalex-snapshot
Competitive exploration of rectilinear polygons
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.007openalex-snapshot
Remembering without memory: Tree exploration by asynchronous oblivious robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.034openalex-snapshot
Online graph exploration: New results on old and new algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.04.018openalex-snapshot
Collaborative delivery with energy-constrained mobile robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.008openalex-snapshot
Near-gathering of energy-constrained mobile agents
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.009openalex-snapshot
Gossiping by energy-constrained mobile agents in tree networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.004openalex-snapshot
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00014-9openalex-snapshot
Utility-based on-line exploration for repeated navigation in an embedded graph
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00028-6openalex-snapshot
Parallel searching on m rays
inferred← citeshttps://doi.org/10.1109/icra.2018.8462867openalex-snapshot
Coverage Path Planning Under the Energy Constraint
inferred← citeshttps://doi.org/10.1109/ivs.2003.1212912openalex-snapshot
An approach of a determination model about autonomous action using the depth cue from T-junctions
inferred← citeshttps://doi.org/10.1142/s0129054114500129openalex-snapshot
EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN
inferred← citeshttps://doi.org/10.1142/s0129054116500313openalex-snapshot
Exploration of Faulty Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1145/1159892.1159897openalex-snapshot
Optimal constrained graph exploration
inferred← citeshttps://doi.org/10.1145/1921659.1921663openalex-snapshot
Tree exploration with logarithmic memory
inferred← citeshttps://doi.org/10.1145/2594581openalex-snapshot
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
inferred← citeshttps://doi.org/10.1145/2611462.2611473openalex-snapshot
Time versus cost tradeoffs for deterministic rendezvous in networks
inferred← citeshttps://doi.org/10.1145/279943.279998openalex-snapshot
Polylogarithmic-overhead piecemeal graph exploration
inferred← citeshttps://doi.org/10.1145/3280823openalex-snapshot
Deterministic Graph Exploration with Advice
inferred← citeshttps://doi.org/10.1145/3700838.3700858openalex-snapshot
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
inferred← citeshttps://doi.org/10.1201/9781420011296.ch8openalex-snapshot
Computing with Mobile Agents in Distributed Networks
inferred← citeshttps://doi.org/10.3390/app7070729openalex-snapshot
Data-Foraging-Oriented Reconnaissance Based on Bio-Inspired Indirect Communication for Aerial Vehicles
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.