Book Chapters

2. Subhash Bhagat, Krishnendu Mukhopadhyaya and Srabani Mukhopadhyaya. Computation  under Restricted Visibility. In Distributed Computing by Mobile Entities (Edited by P. Flocchini, G. Prencipe and N. Santoro), LNCS-Volume 11340, pages 134-183, Springer, 2019.

1. Subhash Bhagat and Krishnendu Mukhopadhyaya. Optimum circle formation by autonomous Robots. In Advances in Intelligent Systems and Computing (Edited by R. Chaki, A. Cortesi, K. Saeed, N. Chaki ), Volume 666, pages 153-165, Springer, 2018. 

Publications in Peer Reviewed Journals

9.  Subhash Bhagat, Andrzej Pelc: Exploring wedges of an oriented grid by an automaton with pebbles, Journal of Computer and System Sciences, Volume 155, Pages 103696, 2026, DOI: https://doi.org/10.1016/j.jcss.2025.103696 . 

8. Subhash Bhagat; Krishnendu Mukhopadhyaya; Rajarshi Ray. The Min-Move Mutual Visibility Problem for Disoriented Asynchronous Robots. Theoretical Computer Science. Volume 2025-02 DOI: 10.1016/j.tcs.2025.115125

7.  Subhash Bhagat, Andrzej Pelc: Deterministic rendezvous in infinite trees. Theoretical Computer Science. Volume 984: page:114313, 2024.

6. Abhinav Chakraborty; Subhash Bhagat; Krishnendu Mukhopadhyaya Gathering over Heterogeneous Meeting Nodes,  The Computer Journal, bxad101, 2023.

5. Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, and Krishnendu Mukhopadhyaya. Optimal Gathering over Meeting Nodes in Infinite Grid.  International Journal of Foundations of Computer Science (IJFCS), Volume 34 (01), pages 25-49, 2023.

4. Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das and Krishnendu Mukhopadhyaya. Gathering over Meeting Nodes in Infinite Grid. Fundamenta Informaticae, Volume 187, 1-30, 2022. 

3. Bibhuti Das, Abhinav Chakraborty, Subhash Bhagat, and Krishnendu Mukhopadhyaya. k-Circle formation by disoriented asynchronous robots. Theoretical Computer Science, Volume 916, pages 40-61, 2022.

2. Subhash Bhagat, Bibhuti Das, Abhinav Chakraborty, Krishnendu Mukhopadhyaya. k- Circle Formation and k-epf by Asynchronous Robots. Algorithms, Volume 14(2), pages 62-88, 2021.

1. Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya. Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. Journal of Discrete Algorithms, Volume 36, pages 50-62, 2016. 

Publications in Peer-Reviewed Conference Proceedings

17. Subhash Bhagat, Andrzej Pelc: Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. . In the 26th International Conference on Distributed Computing and Networking (ICDCN-2025), pages 115-124,  ACM, 2025. 

16. Subhash Bhagat, Paulomi Dey, and Rajarshi Ray. Collision-Free Linear Time Mutual Visibility for Asynchronous Fat Robots. In the 25th International Conference on Distributed Computing and Networking (ICDCN-2024), pages 84-93, ACM, 2024.

15. Debasish Pattanayak, Subhash Bhagat, Sruti Gan Chaudhuri, and Anisur R. Molla Maximal Independent Set via Mobile Agents. In the 25th International Conference on Distributed Computing and Networking (ICDCN-2024), pages 74-83, ACM, 2024.

14. Subhash Bhagat and Andrzej Pelc. How to Meet at a Node of any Connected Graph. In 36th International Symposium on Distributed Computing (DISC- 2022),  pages 11:1-11:16, 2022.

13. Subhash Bhagat and Anisur Rahaman Molla. Min-Max Gathering of Oblivious Robots. In proc .  33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) as a brief announcement, pages 420-422, ACM, 2021.

12. Subhash Bhagat. Optimum Algorithm for the Mutual Visibility Problem. In proc. 14th International Conference and Workshop on Algorithms and Computation (WALCOM-2020), pages 31-42, Springer, 2020.

11. Subhash Bhagat, Paola Flocchini, Krishnendu Mukhopadhyaya and Nicola Santoro. Weak Robots Performing Conflicting Tasks without Knowing Who’s in Their Team. In proc. 21st International Conference on Distributed Computing and Networking (ICDCN-2020), pages 29:1- 29:6, ACM, 2020.

10. Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das and Krishnendu Mukhopadhyaya. Gathering over Meeting Nodes of Infinite Grid. In proc. 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM-2020), pages 318-330, Springer, 2020.

9. Subhash Bhagat, Sruti Gan Chaudhuri and Krishnendu Mukhopadhyaya. Mutual Visibility For Asynchronous Robots. In proc. 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Pages 336-339, Springer, 2019.

8. Subhash Bhagat and Krishnendu Mukhopadhyaya. Mutual Visibility by Robots with Persistent Memory. In proc. 13th International Workshop On Frontiers in Algorithmics (FAW), pages 144-145, Springer, 2019.

7. Subhash Bhagat, Sruti Gan Chaudhuri and Krishnendu Mukhopadhyaya. Gathering of Opaque Robots in 3D Space. In proc. 19th International Conference on Distributed Computing and Networking (ICDCN), pages 2:1-2:10, ACM, 2018.

6. Subhash Bhagat and Krishnendu Mukhopadhyaya. Optimum Algorithm for Mutual Visibility among Asynchronous Robots with Lights. In proc. 19th International symposium on Stabilization, Safety and Security of Distributed System (SSS), pages 341-355, Springer, 2017.

5. Subhash Bhagat and Krishnendu Mukhopadhyaya. Gathering Asynchronous Robots in the Presence of Obstacles. In proc. 11th International Workshop on Algorithms and Computation (WALCOM), pages 279-291, Springer, 2017.

4. Subhash Bhagat and Krishnendu Mukhopadhyaya. Optimum Gathering of Asynchronous Robots. In proc. 3rd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), pages 37-49, Springer, 2017.

3. Subhash Bhagat and Krishnendu Mukhopadhyaya. Fault-tolerant Gathering of Semisynchronous Robots. In proc. 18th International Conference on Distributed Computing and Networking (ICDCN), ACM, 2017.

2. Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya. Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement. In proc. 10th International Workshop on Algorithms and Computation (WALCOM), pages 80-91, Springer, 2016.

1. Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya. Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement. In proc. 9th International Workshop on Algorithms and Computation (WALCOM), pages 149-160, Springer, 2015.