On the public citation graph
An Isoperimetric Inequality and Pursuit-Evasion Games on Triangular Grid Graphs
0 signed · 26 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.1007/978-3-030-95519-9_8openalex-extracted
Lions and Contamination, Triangular Grids, and Cheeger Constants
inferredcites →https://doi.org/10.1007/978-3-319-08016-1_6openalex-extracted
The Complexity of Zero-Visibility Cops and Robber
inferredcites →https://doi.org/10.1007/978-3-540-77120-3_8openalex-extracted
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
inferredcites →https://doi.org/10.1007/978-3-642-55566-4_35openalex-extracted
A Discrete Isoperimetric Inequality and Its Application to Sphere Packings
inferredcites →https://doi.org/10.1007/bf02699376openalex-extracted
Concentration of measure and isoperimetric inequalities in product spaces
inferredcites →https://doi.org/10.1016/0012-365x(83)90160-7openalex-extracted
Vertex-to-vertex pursuit in a graph
inferredcites →https://doi.org/10.1016/0097-3165(91)90021-8openalex-extracted
Compressions and isoperimetric inequalities
inferredcites →https://doi.org/10.1016/0166-218x(84)90073-8openalex-extracted
A game of cops and robbers
inferredcites →https://doi.org/10.1016/j.disc.2008.01.021openalex-extracted
Bounds on isoperimetric values of trees
inferredcites →https://doi.org/10.1016/j.disc.2013.09.004openalex-extracted
An evasion game on a graph
inferredcites →https://doi.org/10.1016/j.ejc.2015.08.002openalex-extracted
How to hunt an invisible rabbit on a graph
inferredcites →https://doi.org/10.1016/j.tcs.2008.02.040openalex-extracted
An annotated bibliography on guaranteed graph searching
inferredcites →https://doi.org/10.1016/j.tcs.2013.04.015openalex-extracted
Fast–mixed searching and related problems on graphs
inferredcites →https://doi.org/10.1016/j.tcs.2015.03.022openalex-extracted
The complexity of zero-visibility cops and robber
inferredcites →https://doi.org/10.1016/s0012-365x(97)00165-9openalex-extracted
A game of cops and robbers played on products of graphs
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6014-xopenalex-extracted
Pursuit Games - An Introduction to the Theory and Applications of Differential Games of Pursuit and Evasion
inferredcites →https://doi.org/10.1017/s0963548303005625openalex-extracted
Randomized Pursuit-Evasion in Graphs
inferredcites →https://doi.org/10.1109/100.580977openalex-extracted
The dynamic window approach to collision avoidance
inferredcites →https://doi.org/10.1137/0403004openalex-extracted
An Isoperimetric Inequality on the Discrete Torus
inferredcites →https://doi.org/10.1214/aop/1024404285openalex-extracted
An isoperimetric inequality on the discrete cube, and an elementary proof of the isoperimetric inequality in Gauss space
inferredcites →https://doi.org/10.2748/tmj/1178243286openalex-extracted
Weighted sums of certain dependent random variables
inferredcites →https://doi.org/10.3390/a2031069openalex-extracted
How Many Lions Are Needed to Clear a Grid?
inferredcites →https://doi.org/10.37236/10577openalex-extracted
Searching for an Intruder on Graphs and Their Subdivisions
inferredcites →https://doi.org/10.37236/2296openalex-extracted
Finding a Princess in a Palace: a Pursuit-Evasion Problem
inferredcites →https://doi.org/10.4310/sdg.2004.v9.n1.a3openalex-extracted
Discrete isoperimetric inequalities
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.