On the public citation graph

How to hunt an invisible rabbit on a graph

https://doi.org/10.1016/j.ejc.2015.08.002
0 signed · 29 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.1006/inco.1994.1064openalex-snapshot
The Vertex Separation and Search Number of a Graph
inferredcites →https://doi.org/10.1016/0012-365x(83)90160-7openalex-snapshot
Vertex-to-vertex pursuit in a graph
inferredcites →https://doi.org/10.1016/0012-365x(85)90046-9openalex-snapshot
Interval graphs and seatching
inferredcites →https://doi.org/10.1016/0095-8956(85)90093-0openalex-snapshot
A short note about pursuit games played on a graph with a given genus
inferredcites →https://doi.org/10.1016/0304-3975(86)90146-5openalex-snapshot
Searching and pebbling
inferredcites →https://doi.org/10.1016/j.comgeo.2008.08.001openalex-snapshot
Escaping offline searchers and isoperimetric theorems
inferredcites →https://doi.org/10.1016/j.disc.2013.09.004openalex-snapshot
An evasion game on a graph
inferredcites →https://doi.org/10.1016/j.tcs.2008.02.040openalex-snapshot
An annotated bibliography on guaranteed graph searching
inferredcites →https://doi.org/10.1017/s0963548303005625openalex-snapshot
Randomized Pursuit-Evasion in Graphs
inferredcites →https://doi.org/10.1090/stml/061openalex-snapshot
The Game of Cops and Robbers on Graphs
inferredcites →https://doi.org/10.37236/2296openalex-snapshot
Finding a Princess in a Palace: a Pursuit-Evasion Problem
inferredcites →https://doi.org/10.48550/arxiv.1502.06591openalex-snapshot
Catching a mouse on a tree
inferredcites →https://doi.org/10.5860/choice.49-4505openalex-snapshot
The game of cops and robbers on graphs

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.4814559openalex-extracted
An Isoperimetric Inequality and Pursuit-Evasion Games on Triangular Grid Graphs
inferred← citeshttps://doi.org/10.1002/net.22234openalex-snapshot
A cops and robber game and the meeting time of synchronous directed walks
inferred← citeshttps://doi.org/10.1002/net.22284openalex-snapshot
Complexity Results for a Cops and Robber Game on Directed Graphs
inferred← citeshttps://doi.org/10.1002/net.70073openalex-snapshot
Shelters and Multiple Shots in a Hunters and Rabbit Game
inferred← citeshttps://doi.org/10.1007/978-3-319-48532-4_23openalex-snapshot
On Evasion Games on Graphs
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_13openalex-snapshot
Hunting a Rabbit Is Hard
inferred← citeshttps://doi.org/10.1016/j.dam.2019.12.007openalex-snapshot
Limited visibility Cops and Robber
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.025openalex-snapshot
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.011openalex-snapshot
Hunting rabbits on the hypercube
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.03.004openalex-snapshot
A competitive search game with a moving target
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105302openalex-snapshot
Further results on the Hunters and Rabbit game through monotonicity
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115946openalex-snapshot
Hunting a rabbit: Complexity, approximability and some characterizations
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517981openalex-snapshot
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects
inferred← citeshttps://doi.org/10.1142/s0129054124500023openalex-snapshot
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects.
inferred← citeshttps://doi.org/10.37236/10577openalex-snapshot
Searching for an Intruder on Graphs and Their Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.1708.07179openalex-snapshot
Limited Visibility Cops and Robbers
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.