24 citations · 40 across the 17 of their papers we have counts for
4 papers · 1 filter
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…
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…