1 citations · 1 across the 10 of their papers we have counts for
17 papers
Robust Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
Gaurav Gaur, Barun Gorain, Rishi Ranjan Singh +1
We study how to find a hidden treasure in anonymous graphs using an agent that has no persistent memory. The nodes are indistinguishable, and only edges have local port numbers. Cl…
Forest Covers and Bounded Forest Covers
Daya Ram Gaur, Barun Gorain, Shaswati Patra +1
We study approximation algorithms for the forest cover and bounded forest cover problems. A probabilistic approximation algorithm for the forest cover problem is given using…
Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
Tanvir Kaur, Barun Gorain, Kaushik Mondal
Distance-2-Dispersion (D-2-D) problem aims to disperse mobile agents starting from an arbitrary initial configuration on an anonymous port-labeled graph with nodes such…
Collision-free Exploration by Mobile Agents Using Pebbles
Sajal K. Das, Amit Kumar Dhar, Barun Gorain +1
In this paper, we study collision-free graph exploration in an anonymous pot labeled network. Two identical mobile agents, starting from different nodes in have to explore the…
Optimal Dispersion of Silent Robots in a Ring
Bibhuti Das, Barun Gorain, Kaushik Mondal +2
Given a set of co-located mobile robots in an unknown anonymous graph, the robots must relocate themselves in distinct graph nodes to solve the dispersion problem. In this paper, w…
Pebble guided Treasure Hunt in Plane
Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal
We study the problem of treasure hunt in a Euclidean plane by a mobile agent with the guidance of pebbles. The initial position of the agent and position of the treasure are modele…