Convergence of Even Simpler Robots without Location Information. - Debasish Pattanayak; Kaushik Mondal 001; Partha Sarathi Mandal 001; Stefan Schmid 001 (CoRR, 2016)

Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. - Debasish Pattanayak; Kaushik Mondal 001; H. Ramesh 001; Partha Sarathi Mandal 001 (ICDCN, 2017)

Convergence of Even Simpler Robots without Position Information. - Debasish Pattanayak; Kaushik Mondal 001; Partha Sarathi Mandal 001; Stefan Schmid 001 (NETYS, 2017)

Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk. - Debasish Pattanayak; H. Ramesh 001; Partha Sarathi Mandal 001; Stefan Schmid 001 (CoRR, 2017)

Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication. - Debasish Pattanayak; H. Ramesh 001; Partha Sarathi Mandal 001; Stefan Schmid 001 (ICDCN, 2018)

Chauffeuring a Crashed Robot from a Disk. - Debasish Pattanayak; H. Ramesh 001; Partha Sarathi Mandal 001 (ALGOSENSORS, 2019)

Gathering of mobile robots with weak multiplicity detection in presence of crash-faults. - Debasish Pattanayak; Kaushik Mondal 001; H. Ramesh 001; Partha Sarathi Mandal 001 (J. Parallel Distributed Comput., 2019)

Conic Formation in Presence of Faulty Robots. - Debasish Pattanayak; Klaus-Tycho Foerster; Partha Sarathi Mandal 001; Stefan Schmid 001 (ALGOSENSORS, 2020)

Collaborative Evacuation of Mobile Robots. - Debasish Pattanayak; H. Ramesh 001; Partha Sarathi Mandal 001 (ICDCN, 2020)

Surveillance of Uneven Surface with Unmanned Aerial Vehicles. - Dibakar Saha; Debasish Pattanayak; Partha Sarathi Mandal 001 (ICDCN, 2020)

Distributed Pattern Formation With Faulty Robots. - Debasish Pattanayak; Klaus-Tycho Foerster; Partha Sarathi Mandal 001; Stefan Schmid 001 (CoRR, 2020)

Fort Formation by an Automaton. - Kartikey Kant; Debasish Pattanayak; Partha Sarathi Mandal 001 (COMSNETS, 2021)

A Reconstructive Model for Identifying the Global Spread in a Pandemic. - Debasish Pattanayak; Dibakar Saha; Debarati Mitra; Partha Sarathi Mandal 001 (ICDCIT, 2021)

Dispersion of Mobile Robots Tolerating Faults. - Debasish Pattanayak; Gokarna Sharma; Partha Sarathi Mandal 001 (ICDCN (Adjunct Volume), 2021)

Filling MIS Vertices by Myopic Luminous Robots. - Sai Vamshi Samala; Subhajit Pramanick; Debasish Pattanayak; Partha Sarathi Mandal 001 (CoRR, 2021)

Randomized gathering of asynchronous mobile robots. - Debasish Pattanayak; John Augustine 001; Partha Sarathi Mandal 001 (Theor. Comput. Sci., 2021)

Dispersion of Mobile Robots on Directed Anonymous Graphs. - Giuseppe F. Italiano; Debasish Pattanayak; Gokarna Sharma (SIROCCO, 2022)

Area Convergence of Monoculus Robots With Additional Capabilities. - Debasish Pattanayak; Kaushik Mondal 001; Partha Sarathi Mandal 001; Stefan Schmid 001 (Comput. J., 2022)

On maximal 3-edge-connected subgraphs of undirected graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas; Debasish Pattanayak (CoRR, 2022)

Surveillance of Uneven Surface With Self-Organizing Unmanned Aerial Vehicles. - Dibakar Saha; Debasish Pattanayak; Partha Sarathi Mandal 001 (IEEE Trans. Mob. Comput., 2022)

Filling MIS Vertices of a Graph by Myopic Luminous Robots. - Subhajit Pramanick; Sai Vamshi Samala; Debasish Pattanayak; Partha Sarathi Mandal 001 (ICDCIT, 2023)

Dispersion of Mobile Robots in Spite of Faults. - Debasish Pattanayak; Gokarna Sharma; Partha Sarathi Mandal 001 (SSS, 2023)

Computing Functions by Teams of Deterministic Finite Automata. - Debasish Pattanayak; Andrzej Pelc (CoRR, 2023)

Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots. - Subhajit Pramanick; Sai Vamshi Samala; Debasish Pattanayak; Partha Sarathi Mandal 001 (Theor. Comput. Sci., 2023)

Asynchronous Separation of Unconscious Colored Robots. - Paola Flocchini; Debasish Pattanayak; Francesco Piselli; Nicola Santoro; Yukiko Yamauchi (CANDARW, 2024)

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

Time-Color Tradeoff on Uniform Circle Formation by Asynchronous Robots. - Debasish Pattanayak; Gokarna Sharma (IPDPS, 2024)

The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. - Paola Flocchini; Debasish Pattanayak; Nicola Santoro; Masafumi Yamashita (IWOCA, 2024)

Brief Announcement: Optimal Uniform Circle Formation by Asynchronous Luminous Robots. - Caterina Feletti; Debasish Pattanayak; Gokarna Sharma (DISC, 2024)

Optimal Uniform Circle Formation by Asynchronous Luminous Robots. - Caterina Feletti; Debasish Pattanayak; Gokarna Sharma (CoRR, 2024)

Graph exploration by a deterministic memoryless automaton with pebbles. - Debasish Pattanayak; Andrzej Pelc (Discret. Appl. Math., 2024)

Deterministic treasure hunt and rendezvous in arbitrary connected graphs. - Debasish Pattanayak; Andrzej Pelc (Inf. Process. Lett., 2024)

Exploring Dangerous Graphs with Byzantine Companions. - Giuseppe Antonio Di Luna; Paola Flocchini; Debasish Pattanayak; Giuseppe Prencipe; Francesco Piselli; Nicola Santoro (ICDCS, 2025)

Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation. - Paola Flocchini; Alfredo Navarra; Debasish Pattanayak; Francesco Piselli; Nicola Santoro (SIROCCO, 2025)

Dispersion is (Almost) Optimal under (A)synchrony. - Ajay D. Kshemkalyani; Manish Kumar 014; Anisur Rahaman Molla; Debasish Pattanayak; Gokarna Sharma (SPAA, 2025)

Brief Announcement: Universal Dancing by Luminous Robots Under Sequential Schedulers. - Caterina Feletti; Paola Flocchini; Debasish Pattanayak; Giuseppe Prencipe; Nicola Santoro (DISC, 2025)

Brief Announcement: Optimal Dispersion Under Asynchrony. - Debasish Pattanayak; Ajay D. Kshemkalyani; Manish Kumar 014; Anisur Rahaman Molla; Gokarna Sharma (DISC, 2025)

Optimal Dispersion Under Asynchrony. - Debasish Pattanayak; Ajay D. Kshemkalyani; Manish Kumar 014; Anisur Rahaman Molla; Gokarna Sharma (CoRR, 2025)

Universal Dancing by Luminous Robots under Sequential Schedulers. - Caterina Feletti; Paola Flocchini; Debasish Pattanayak; Giuseppe Prencipe; Nicola Santoro (CoRR, 2025)

Faster leader election via mobile agents and its applications. - Ajay D. Kshemkalyani; Manish Kumar 014; Anisur Rahaman Molla; Debasish Pattanayak; Gokarna Sharma (Theor. Comput. Sci., 2026)