Subhash Bhagat

Theor. Comput. Sci., February, 2024

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Gathering Over Heterogeneous Meeting Nodes.

[BibT_eX]

[DOI]

Comput. J., 2024

Maximal Independent Set via Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

Collision-Free Linear Time Mutual Visibility for Asynchronous Fat Robots.

[BibT_eX]

[DOI]

Paulomi Dey

Rajarshi Ray

Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

2023

Optimal Gathering Over Weber Meeting Nodes in Infinite Grid.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., January, 2023

Exploring Wedges of an Oriented Grid by an Automaton with Pebbles.

[BibT_eX]

[DOI]

CoRR, 2023

2022

<i>k</i>-Circle formation by disoriented asynchronous robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Gathering over Meeting Nodes in Infinite Grid<sup>*</sup>.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2022

Optimal Gathering over Meeting Nodes in Infinite Grid.

[BibT_eX]

[DOI]

CoRR, 2022

How to Meet at a Node of Any Connected Graph.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

2021

k-Circle Formation and k-epf by Asynchronous Robots.

[BibT_eX]

[DOI]

Algorithms, 2021

Min-Max Gathering of Oblivious Robots.

[BibT_eX]

[DOI]

Anisur Rahaman Molla

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2020

Optimum Algorithm for the Mutual Visibility Problem.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Weak robots performing conflicting tasks without knowing who is in their team.

[BibT_eX]

[DOI]

Paola Flocchini

Nicola Santoro

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

Gathering over Meeting Nodes in Infinite Grid.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Computation Under Restricted Visibility.

[BibT_eX]

[DOI]

Srabani Mukhopadhyaya

Proceedings of the Distributed Computing by Mobile Entities, 2019

Mutual Visibility for Asynchronous Robots.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Mutual Visibility by Robots with Persistent Memory.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018

Gathering of Opaque Robots in 3D Space.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

Gathering Asynchronous Robots in the Presence of Obstacles.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Fault-tolerant Gathering of Semi-synchronous Robots.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

Optimum Gathering of Asynchronous Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2014

Formation of General Position by Asynchronous Mobile Robots.

[BibT_eX]

[DOI]