Subhash Bhagat

Orcid: 0000-0003-4551-0613

According to our database1, Subhash Bhagat authored at least 28 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Deterministic rendezvous in infinite trees.
Theor. Comput. Sci., February, 2024

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs.
CoRR, 2024

Gathering Over Heterogeneous Meeting Nodes.
Comput. J., 2024

Maximal Independent Set via Mobile Agents.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

Collision-Free Linear Time Mutual Visibility for Asynchronous Fat Robots.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

2023
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid.
Int. J. Found. Comput. Sci., January, 2023

Exploring Wedges of an Oriented Grid by an Automaton with Pebbles.
CoRR, 2023

2022
<i>k</i>-Circle formation by disoriented asynchronous robots.
Theor. Comput. Sci., 2022

Gathering over Meeting Nodes in Infinite Grid<sup>*</sup>.
Fundam. Informaticae, 2022

Optimal Gathering over Meeting Nodes in Infinite Grid.
CoRR, 2022

How to Meet at a Node of Any Connected Graph.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

2021
k-Circle Formation and k-epf by Asynchronous Robots.
Algorithms, 2021

Min-Max Gathering of Oblivious Robots.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2020
Optimum Algorithm for the Mutual Visibility Problem.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Weak robots performing conflicting tasks without knowing who is in their team.
Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

Gathering over Meeting Nodes in Infinite Grid.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
Computation Under Restricted Visibility.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Mutual Visibility for Asynchronous Robots.
Proceedings of the Structural Information and Communication Complexity, 2019

Mutual Visibility by Robots with Persistent Memory.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018
Gathering of Opaque Robots in 3D Space.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Gathering Asynchronous Robots in the Presence of Obstacles.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Fault-tolerant Gathering of Semi-synchronous Robots.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

Optimum Gathering of Asynchronous Robots.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement.
J. Discrete Algorithms, 2016

A Get-Together for Deaf and Dumb Robots in Three dimensional Space.
CoRR, 2016

Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2014
Formation of General Position by Asynchronous Mobile Robots.
CoRR, 2014


  Loading...