Initial knowledge regarding group size can be crucial for collective performance. We study
this relation in the context of the Ants Nearby Treasure Search (ANTS) problem [18], which …

We study how the arboreal turtle ant (Cephalotes goniodontus) solves a fundamental
computing problem: maintaining a trail network and finding alternative paths to route around …

We consider the problem of searching for an unknown target vertex $ t $ in a (possibly edge-
weighted) graph. Each\emph {vertex-query} points to a vertex $ v $ and the response either …

We consider a search problem on trees in which the goal is to find an adversarially placed
treasure, while relying on local, partial information. Specifically, each node in the tree holds …

We consider a search problem on trees aiming to find a treasure that an adversary places at
one of the nodes. The algorithm can query nodes and extract directional information from …

We study the problem of finding a destination node t by a mobile agent in an unreliable
network having the structure of an unweighted graph, in a model first proposed by Hanusse …

We consider a search problem on trees in which an agent starts at the root of a tree and
aims to locate an adversarially placed treasure, by moving along the edges, while relying on …

We study the biased random walk where at each step of a random walk a “controller” can,
with a certain small probability, move the walk to an arbitrary neighbour. This model was …

We consider a search problem on trees using unreliable guiding instructions. Specifically,
an agent starts a search at the root of a tree aiming to find a treasure hidden at one of the …

Algorithmic Complexity Between Structure and Knowledge How Pursuit-Evasion Games help
Page 1 1/33 Intro C&R Graph Searching Modeling Conclusion Algorithmic Complexity Between …