Formation of General Position by Asynchronous Mobile Robots. - Subhash Bhagat; Sruti Gan Chaudhuri; Krishnendu Mukhopadhyaya (CoRR, 2014)

Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement. - Subhash Bhagat; Sruti Gan Chaudhuri; Krishnendu Mukhopadhyaya (WALCOM, 2016)

A Get-Together for Deaf and Dumb Robots in Three dimensional Space. - Subhash Bhagat; Sruti Gan Chaudhuri; Krishnendu Mukhopadhyaya (CoRR, 2016)

Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. - Subhash Bhagat; Sruti Gan Chaudhuri; Krishnendu Mukhopadhyaya (J. Discrete Algorithms, 2016)

Optimum Gathering of Asynchronous Robots. - Subhash Bhagat; Krishnendu Mukhopadhyaya (CALDAM, 2017)

Fault-tolerant Gathering of Semi-synchronous Robots. - Subhash Bhagat; Krishnendu Mukhopadhyaya (ICDCN, 2017)

Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights. - Subhash Bhagat; Krishnendu Mukhopadhyaya (SSS, 2017)

Gathering Asynchronous Robots in the Presence of Obstacles. - Subhash Bhagat; Krishnendu Mukhopadhyaya (WALCOM, 2017)

Gathering of Opaque Robots in 3D Space. - Subhash Bhagat; Sruti Gan Chaudhuri; Krishnendu Mukhopadhyaya (ICDCN, 2018)

Mutual Visibility by Robots with Persistent Memory. - Subhash Bhagat; Krishnendu Mukhopadhyaya (FAW, 2019)

Mutual Visibility for Asynchronous Robots. - Subhash Bhagat; Sruti Gan Chaudhuri; Krishnendu Mukhopadhyaya (SIROCCO, 2019)

Computation Under Restricted Visibility. - Subhash Bhagat; Krishnendu Mukhopadhyaya; Srabani Mukhopadhyaya (Distributed Computing by Mobile Entities, 2019)

Gathering over Meeting Nodes in Infinite Grid. - Subhash Bhagat; Abhinav Chakraborty 001; Bibhuti Das 001; Krishnendu Mukhopadhyaya (CALDAM, 2020)

Weak robots performing conflicting tasks without knowing who is in their team. - Subhash Bhagat; Paola Flocchini; Krishnendu Mukhopadhyaya; Nicola Santoro (ICDCN, 2020)

Optimum Algorithm for the Mutual Visibility Problem. - Subhash Bhagat (WALCOM, 2020)

Min-Max Gathering of Oblivious Robots. - Subhash Bhagat; Anisur Rahaman Molla (SPAA, 2021)

k-Circle Formation and k-epf by Asynchronous Robots. - Subhash Bhagat; Bibhuti Das 001; Abhinav Chakraborty 001; Krishnendu Mukhopadhyaya (Algorithms, 2021)

How to Meet at a Node of Any Connected Graph. - Subhash Bhagat; Andrzej Pelc (DISC, 2022)

Optimal Gathering over Meeting Nodes in Infinite Grid. - Subhash Bhagat; Abhinav Chakraborty 001; Bibhuti Das 001; Krishnendu Mukhopadhyaya (CoRR, 2022)

Gathering over Meeting Nodes in Infinite Grid*. - Subhash Bhagat; Abhinav Chakraborty 001; Bibhuti Das 001; Krishnendu Mukhopadhyaya (Fundam. Informaticae, 2022)

k-Circle formation by disoriented asynchronous robots. - Bibhuti Das 001; Abhinav Chakraborty 001; Subhash Bhagat; Krishnendu Mukhopadhyaya (Theor. Comput. Sci., 2022)

Optimal Gathering Over Weber Meeting Nodes in Infinite Grid. - Subhash Bhagat; Abhinav Chakraborty 001; Bibhuti Das 001; Krishnendu Mukhopadhyaya (Int. J. Found. Comput. Sci., 2023)

Collision-Free Linear Time Mutual Visibility for Asynchronous Fat Robots. - Subhash Bhagat; Paulomi Dey; Rajarshi Ray 001 (ICDCN, 2024)

Maximal Independent Set via Mobile Agents. - Debasish Pattanayak; Subhash Bhagat; Sruti Gan Chaudhuri; Anisur Rahaman Molla (ICDCN, 2024)

Gathering Over Heterogeneous Meeting Nodes. - Abhinav Chakraborty 001; Subhash Bhagat; Krishnendu Mukhopadhyaya (Comput. J., 2024)

Deterministic rendezvous in infinite trees. - Subhash Bhagat; Andrzej Pelc (Theor. Comput. Sci., 2024)

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. - Subhash Bhagat; Andrzej Pelc (ICDCN, 2025)

The min-move mutual visibility problem for disoriented asynchronous robots. - Subhash Bhagat; Krishnendu Mukhopadhyaya; Rajarshi Ray 001 (Theor. Comput. Sci., 2025)

Exploring wedges of an oriented grid by an automaton with pebbles. - Subhash Bhagat; Andrzej Pelc (J. Comput. Syst. Sci., 2026)