Over the years, much research involving mobile computational entities ha...
The aim of the dispersion problem is to place a set of k(≤ n) mobile
rob...
In the dispersion problem, a set of k co-located mobile robots must
relo...
We study the problem of treasure hunt in a graph by a mobile agent. The ...
This paper considers the problem of Byzantine dispersion and extends pre...
The problem of dispersion of mobile robots on a graph asks that n robots...
Graph burning runs on discrete time steps. The aim of the graph burning
...
Since Sleator and Tarjan's seminal work on self-adjusting lists, heaps a...