24 citations · 40 across the 17 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
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…
cs.DC2021
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…