On the public citation graph

Searching for an Intruder on Graphs and Their Subdivisions

https://doi.org/10.37236/10577
0 signed · 19 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-1-4419-7997-1_76openalex-snapshot
Graph Searching and Related Problems
inferredcites →https://doi.org/10.1016/0022-247x(65)90125-3openalex-snapshot
Topology of series-parallel networks
inferredcites →https://doi.org/10.1016/0196-6774(91)90003-hopenalex-snapshot
Monotonicity in graph searching
inferredcites →https://doi.org/10.1016/j.dam.2007.02.006openalex-snapshot
Lower bounds on the pathwidth of some grid-like graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.05.033openalex-snapshot
Sweeping graphs with large clique number
inferredcites →https://doi.org/10.1016/j.ejc.2015.08.002openalex-snapshot
How to hunt an invisible rabbit 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.1016/j.tcs.2012.06.035openalex-snapshot
Locating a robber on a graph via distance queries
inferredcites →https://doi.org/10.1016/j.tcs.2015.03.022openalex-snapshot
The complexity of zero-visibility cops and robber
inferredcites →https://doi.org/10.1142/s0129054118410022openalex-snapshot
A Combinatorial Model of Two-Sided Search
inferredcites →https://doi.org/10.1145/151261.151263openalex-snapshot
Recontamination does not help to search a graph
inferredcites →https://doi.org/10.3390/a2031069openalex-snapshot
How Many Lions Are Needed to Clear a Grid?
inferredcites →https://doi.org/10.37236/2296openalex-snapshot
Finding a Princess in a Palace: a Pursuit-Evasion Problem

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.70073openalex-snapshot
Shelters and Multiple Shots in a Hunters and Rabbit Game
inferred← citeshttps://doi.org/10.1016/j.dam.2023.04.026openalex-snapshot
How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
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.tcs.2023.114186openalex-snapshot
The one-visibility localization game
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517981openalex-snapshot
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects
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.