Graphs measure interactions between objects such as friendship links on Twitter,
transactions between Bitcoin users, and the flow of energy in a food chain. While graphs …

We define and study the following two-player game on a graph G. Let k∈ N⁎. A set of k
guards is occupying some vertices of G while one spy is standing at some node. At each …

\textit {Pursuit-evasion games} have been intensively studied for several decades due to
their numerous applications in artificial intelligence, robot motion planning, database theory …

In the Spy game played on a graph G, a single spy travels the vertices of G at speed s, while
multiple slow guards strive to have, at all times, one of them within distance d of that spy. In …

Cops and Robber is a well-studied two player pursuit-evasion game played on a graph. In
this game, a set of cops, controlled by the first player, tries to capture the position of a robber …

We consider a variant of Cops and Robbers in which the robber may traverse as many
edges as he likes in each turn, with the constraint that he cannot pass through any vertex …

The game of Cops and Robber is a pursuit-evasion game which is usually played on a
connected graph. In the game, a set of cops and a robber move around the vertices of a …

Cops and Robber is a two-player pursuit-evasion game played on graphs. Here, one player
controls a set of k cops, and the other player controls a single robber. The game starts with k …

Temporal networks have gained in popularity in the last decade for their ability to model how
connections vary over time. We are interested in understanding their structure and analyzing …

In this paper, we consider a variant of the cops and robbers game on a graph, introduced by
Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from …