17 citations · 32 across the 4 of their papers we have counts for
5 papers
Locating a robber with multiple probes
John Haslegrave, Richard A. B. Johnson, Sebastian Koch
We consider a game in which a cop searches for a moving robber on a connected graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi,…
Subdivisions in the Robber Locating Game
John Haslegrave, Richard A. B. Johnson, Sebastian Koch
We consider a game in which a cop searches for a moving robber on a graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt,…
The time of graph bootstrap percolation
Karen Gunderson, Sebastian Koch, Michał Przykucki
Graph bootstrap percolation, introduced by Bollobás in 1968, is a cellular automaton defined as follows. Given a "small" graph and a "large" graph , in c…
Subgraphs and Colourability of Locatable Graphs
Richard A. B. Johnson, Sebastian Koch
We study a game of pursuit and evasion introduced by Seager in 2012, in which a cop searches the robber from outside the graph, using distance queries. A graph on which the cop win…
The Robber Locating game
John Haslegrave, Richard A. B. Johnson, Sebastian Koch
We consider a game in which a cop searches for a moving robber on a graph using distance probes, studied by Carragher, Choi, Delcourt, Erickson and West, which is a slight variatio…