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 …

The localization game is a pursuit-evasion game analogous to Cops and Robbers, where
the robber is invisible and the cops send distance probes in an attempt to identify the …

We study a variant of the Localization game in which the cops have limited visibility, along
with the corresponding optimization parameter, the $ k $-visibility localization number …

We study the localization number of incidence graphs of designs. In the localization game
played on a graph, the cops attempt to determine the location of an invisible robber via …

One important problem in a network is to locate an (invisible) moving entity by using
distance-detectors placed at strategical locations. For instance, the metric dimension of a …

For a graph, a subset is called a resolving set if for any two vertices, there exists a vertex
such that. The Metric Dimension problem takes as input a graph and a positive integer, and …

We consider the localization game played on graphs, wherein a set of cops attempt to
determine the exact location of an invisible robber by exploiting distance probes. The …

We introduce a variant of the Localization game in which the cops only have visibility one,
along with the corresponding optimization parameter, the one-visibility localization number ζ …

We consider the localization number and metric dimension of certain graphs of diameter $2
$, focusing on families of Kneser graphs and graphs without 4-cycles. For the Kneser graphs …

In the localization game, introduced by Seager in 2013, an invisible and immobile target is
hidden at some vertex of a graph G. At every step, one vertex v of G can be probed which …