On the public citation graph
How Many Lions Are Needed to Clear a Grid?
0 signed · 31 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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/0097-3165(91)90021-8openalex-snapshot
Compressions and isoperimetric inequalities
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.tcs.2008.02.039openalex-snapshot
Offline variants of the “lion and man” problem
inferredcites →https://doi.org/10.1090/dimacs/005/02openalex-snapshot
Graph searching, path-width, tree-width and related problems (A survey)
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1145/151261.151263openalex-snapshot
Recontamination does not help to search a graph
inferredcites →https://doi.org/10.1287/ijoc.4.4.447openalex-snapshot
“Lion and Man”: Upper and Lower Bounds
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.1007/978-3-030-24766-9_35openalex-snapshot
Geometric Firefighting in the Half-Plane
inferred← citeshttps://doi.org/10.1007/978-3-030-95519-9_8openalex-snapshot
Lions and Contamination, Triangular Grids, and Cheeger Constants
inferred← citeshttps://doi.org/10.1007/978-3-319-63604-7_6openalex-snapshot
Collaborative Patrolling Swarms in Stochastically Expanding Environments
inferred← citeshttps://doi.org/10.1007/978-3-319-89593-2openalex-snapshot
Research in Computational Topology
inferred← citeshttps://doi.org/10.1007/978-3-319-89593-2_5openalex-snapshot
Sweeping Costs of Planar Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-41498-5_4openalex-snapshot
Geometric Problems on Coverage in Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.03.001openalex-snapshot
Improved bounds for cops-and-robber pursuit
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.10.003openalex-snapshot
Reversibility properties of the fire-fighting problem in graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101728openalex-snapshot
Geometric firefighting in the half-plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101961openalex-snapshot
Lions and contamination: Monotone clearings
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.2015.08.036openalex-snapshot
A local strategy for cleaning expanding cellular domains by simple robots
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.1137/070700991openalex-snapshot
Vision-Based Pursuit-Evasion in a Grid
inferred← citeshttps://doi.org/10.1142/s0129054119500023openalex-snapshot
On a Fire Fighter’s Problem
inferred← citeshttps://doi.org/10.1142/s0129054124500023openalex-snapshot
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects.
inferred← citeshttps://doi.org/10.1145/2951860.2951870openalex-snapshot
Computational Geometry Column 63
inferred← citeshttps://doi.org/10.37236/10577openalex-snapshot
Searching for an Intruder on Graphs and Their Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.1905.02067openalex-snapshot
Geometric Firefighting in the Half-plane
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.