5 citations · 17 across the 26 of their papers we have counts for
34 papers
Black Hole Search: Dynamics, Distribution, and Emergence
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal +1
A black hole is a malicious node in a graph that destroys resources entering into it without leaving any trace. The problem of Black Hole Search (BHS) using mobile agents requires…
Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents
Rajashree Bar, Daibik Barik, Adri Bhattacharya +1
Network decontamination is a well-known problem, in which the aim of the mobile agents should be to decontaminate the network (i.e., both nodes and edges). This problem comes with…
Separation of Unconscious Robots with Obstructed Visibility
Prajyot Pyati, Navjot Kaur, Saswata Jana +2
We study a recently introduced \textit{unconscious} mobile robot model, where each robot is associated with a \textit{color}, which is visible to other robots but not to itself. Th…
Asynchronous Gathering of Opaque Robots with Mobility Faults
Subhajit Pramanick, Saswata Jana, Partha Sarathi Mandal +1
We consider the fundamental benchmarking problem of gathering in an -fault system consisting of robots, of which at most might fail at any execution, under asynchron…
Graph Traversal via Connected Mobile Agents
Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal
This paper considers the Hamiltonian walk problem in the multi-agent coordination framework, referred to as -agents Hamiltonian walk problem (-HWP). In this problem, a set of…
Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots
Saswata Jana, Subhajit Pramanick, Adri Bhattacharya +1
In a connected graph with an autonomous robot swarm with limited visibility, it is natural to ask whether the robots can be deployed to certain vertices satisfying a given property…