research
∙
05/02/2023
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots
Over the years, much research involving mobile computational entities ha...
share
research
∙
01/12/2023
Distance-2-Dispersion: Dispersion with Further Constraints
The aim of the dispersion problem is to place a set of k(≤ n) mobile rob...
research
∙
02/11/2022
Collaborative Dispersion by Silent Robots
In the dispersion problem, a set of k co-located mobile robots must relo...
research
∙
03/10/2021
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
We study the problem of treasure hunt in a graph by a mobile agent. The ...
research
∙
02/15/2021
Byzantine Dispersion on Graphs
This paper considers the problem of Byzantine dispersion and extends pre...
research
∙
04/23/2020
Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots
The problem of dispersion of mobile robots on a graph asks that n robots...
research
∙
03/17/2020
NP-completeness Results for Graph Burning on Geometric Graphs
Graph burning runs on discrete time steps. The aim of the graph burning ...
research
∙
07/12/2018
