24 citations · 24 across the 2 of their papers we have counts for
7 papers
Collaborative Dispersion by Silent Robots
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal +1
In the dispersion problem, a set of co-located mobile robots must relocate themselves in distinct nodes of an unknown network. The network is modeled as an anonymous graph $G=(…
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
Barun Gorain, Kaushik Mondal, Himadri Nayak +1
We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node of degree are labeled arbitrarily as…
Byzantine Dispersion on Graphs
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
This paper considers the problem of Byzantine dispersion and extends previous work along several parameters. The problem of Byzantine dispersion asks: given robots, up to o…
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
The problem of dispersion of mobile robots on a graph asks that robots initially placed arbitrarily on the nodes of an -node anonymous graph, autonomously move to reach a fi…
NP-Completeness Results for Graph Burning on Geometric Graphs
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given graph in the least number of time steps. This number is known to be the burning number of…
Push-Down Trees: Optimal Self-Adjusting Complete Trees
Chen Avin, Kaushik Mondal, Stefan Schmid
This paper studies a fundamental algorithmic problem related to the design of demand-aware networks: networks whose topologies adjust toward the traffic patterns they serve, in an…