The past two decades have seen the rapid growth and development of the field of distributed
computing by mobile entities, whose concern is the study of the computational and …

Graph searching encompasses a wide variety of combinatorial problems related to the
problem of capturing a fugitive residing in a graph using the minimum number of searchers …

Programmers extensively use application programming interfaces (APIs) to leverage
existing libraries and frameworks. However, correctly and efficiently choosing and using …

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 vision for programmable matter is to realize a physical substance that is scalable,
versatile, instantly reconfigurable, safe to handle, and robust to failures. Programmable …

Consider a networked environment, supporting mobile agents, where there is a black hole: a
harmful host that disposes of visiting agents upon their arrival, leaving no observable trace …

We present graph-clear: a novel pursuit-evasion problem on graphs which models the
detection of intruders in complex indoor environments by robot teams. The environment is …

Consider a group of N robots aiming to converge towards a single point. The robots cannot
communicate, and their only input is obtained by visual sensors. A natural algorithm for the …

This paper is concerned with the graph searching game: we are given a graph containing a
fugitive (or lost) entity or item; the goal is to clear the edges of the graph, using searchers; an …

The Rendezvous of anonymous mobile agents in a anonymous network is an intensively
studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study …