Subhash Bhagat
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Subhash Bhagat has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Krishnendu Mukhopadhyaya
Indian Statistical Institute
8 shared publications Krishnendu Mukhopadhyaya
6 shared publicationsSruti Gan Chaudhuri
Jadavpur University
3 shared publicationsAbhinav Chakraborty
2 shared publicationsAndrzej Pelc
2 shared publicationsBibhuti Das
2 shared publications
Latest Publications
- 31 July 2025
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 155
Exploring wedges of an oriented grid by an automaton with pebbles
- 31 July 2025
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 155
Exploring wedges of an oriented grid by an automaton with pebbles
- 19 February 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1035
The min-move mutual visibility problem for disoriented asynchronous robots
- 19 February 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1035
The min-move mutual visibility problem for disoriented asynchronous robots
- Open Access
- 4 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 115-124
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
- 4 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 115-124
Open AccessDeterministic Collision-Free Exploration of Unknown Anonymous Graphs
- Open Access
- 4 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 74-83
Maximal Independent Set via Mobile Agents
- 4 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 74-83
Open AccessMaximal Independent Set via Mobile Agents
- Open Access
- 4 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 84-93
Collision-Free Linear Time Mutual Visibility for Asynchronous Fat Robots
This paper studies the mutual visibility problem for a distributed system of n ≥ 3 asynchronous opaque fat robots under the obstructed visibility model. Robots are represented as unit discs in the Euclidean plane and they block both motions and visions of the other robots through them. The mutual visibility problem requires the robots to reposition themselves in such a way that all the robots in the system become mutually visible to each other. Collision-free movement is one of the desirable features that any algorithm for fat robots needs to satisfy. This paper proposes a distributed collision-free mutual visibility algorithm for asynchronous fat robots with externally visible lights. The proposed algorithm uses O(1) colors for the lights of the robots, assumes one-axis agreement, and runs in O(n) asynchronous rounds.
- 4 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 84-93
Open AccessCollision-Free Linear Time Mutual Visibility for Asynchronous Fat Robots
This paper studies the mutual visibility problem for a distributed system of n ≥ 3 asynchronous opaque fat robots under the obstructed visibility model. Robots are represented as unit discs in the Euclidean plane and they block both motions and visions of the other robots through them. The mutual visibility problem requires the robots to reposition themselves in such a way that all the robots in the system become mutually visible to each other. Collision-free movement is one of the desirable features that any algorithm for fat robots needs to satisfy. This paper proposes a distributed collision-free mutual visibility algorithm for asynchronous fat robots with externally visible lights. The proposed algorithm uses O(1) colors for the lights of the robots, assumes one-axis agreement, and runs in O(n) asynchronous rounds.
- 22 November 2023
- Published by Elsevier in Theoretical Computer Science
- Vol. 984
Deterministic rendezvous in infinite trees
- 22 November 2023
- Published by Elsevier in Theoretical Computer Science
- Vol. 984
Deterministic rendezvous in infinite trees
- Open Access
Optimal Gathering over Weber Meeting Nodes in Infinite Grid
The gathering over meeting nodes problem requires the robots to gather at one of the pre-defined meeting nodes. This paper investigates the problem with respect to the objective function that minimizes the total number of moves made by all the robots. In other words, the sum of the distances traveled by all the robots is minimized while accomplishing the gathering task. The robots are deployed on the nodes of an anonymous two-dimensional infinite grid which has a subset of nodes marked as meeting nodes. The robots do not agree on a global coordinate system and operate under an asynchronous scheduler. A deterministic distributed algorithm has been proposed to solve the problem for all those solvable configurations, and the initial configurations for which the problem is unsolvable have been characterized. The proposed gathering algorithm is optimal with respect to the total number of moves performed by all the robots in order to finalize the gathering.
Open AccessOptimal Gathering over Weber Meeting Nodes in Infinite Grid
The gathering over meeting nodes problem requires the robots to gather at one of the pre-defined meeting nodes. This paper investigates the problem with respect to the objective function that minimizes the total number of moves made by all the robots. In other words, the sum of the distances traveled by all the robots is minimized while accomplishing the gathering task. The robots are deployed on the nodes of an anonymous two-dimensional infinite grid which has a subset of nodes marked as meeting nodes. The robots do not agree on a global coordinate system and operate under an asynchronous scheduler. A deterministic distributed algorithm has been proposed to solve the problem for all those solvable configurations, and the initial configurations for which the problem is unsolvable have been characterized. The proposed gathering algorithm is optimal with respect to the total number of moves performed by all the robots in order to finalize the gathering.
- 7 March 2022
- Published by Elsevier in Theoretical Computer Science
- Vol. 916, 40-61
k-Circle formation by disoriented asynchronous robots
- 7 March 2022
- Published by Elsevier in Theoretical Computer Science
- Vol. 916, 40-61
k-Circle formation by disoriented asynchronous robots
- 20 February 2020
- Published by Springer Nature
- p. 31-42
Optimum Algorithm for the Mutual Visibility Problem
- 20 February 2020
- Published by Springer Nature
- p. 31-42
Optimum Algorithm for the Mutual Visibility Problem