Probabilistic Diagnosis of Large Systems Using a Parallel Genetic Approach. - Mourad Elhadef; Kaouther Abrougui; Shantanu Das 001; Amiya Nayak (PDPTA, 2005)

Distributed Exploration of an Unknown Graph. - Shantanu Das 001; Paola Flocchini; Amiya Nayak; Nicola Santoro (SIROCCO, 2005)

A parallel genetic algorithm for identifying faults in large diagnosable systems. - Mourad Elhadef; Shantanu Das 001; Amiya Nayak (Parallel Algorithms Appl., 2005)

A Novel Artificial-Immune-Based Approach for System-Level Fault Diagnosis. - Mourad Elhadef; Shantanu Das 001; Amiya Nayak (ARES, 2006)

Improved Distributed Exploration of Anonymous Networks. - Shantanu Das 001; Shay Kutten; Ayelet Yifrach (ICDCN, 2006)

Effective Elections for Anonymous Mobile Agents. - Shantanu Das 001; Paola Flocchini; Amiya Nayak; Nicola Santoro (ISAAC, 2006)

Groupings and Pairings in Anonymous Networks. - Jérémie Chalopin; Shantanu Das 001; Nicola Santoro (DISC, 2006)

System-Level Fault Diagnosis Using Comparison Models: An Artificial-Immune-Systems-Based Approach. - Mourad Elhadef; Shantanu Das 001; Amiya Nayak (J. Networks, 2006)

A Parallel Probabilistic System-level Fault Diagnosis Approach for Large Multiprocessor Systems. - Mourad Elhadef; Kaouther Abrougui; Shantanu Das 001; Amiya Nayak (Parallel Process. Lett., 2006)

Localized Movement Control for Fault Tolerance of Mobile Robot Networks. - Shantanu Das 001; Hai Liu 001; Ajith Kamath; Amiya Nayak; Ivan Stojmenovic (WSAN, 2007)

Semi-Beaconless Power and Cost Efficient Georouting with Guaranteed Delivery using Variable Transmission Radii for Wireless Sensor Networks. - Shantanu Das 001; Amiya Nayak; Stefan Rührup; Ivan Stojmenovic (MASS, 2007)

Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. - Shantanu Das 001; Paola Flocchini; Nicola Santoro; Masafumi Yamashita (SIROCCO, 2007)

Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. - Jérémie Chalopin; Shantanu Das 001; Nicola Santoro (DISC, 2007)

Map construction of unknown graphs by multiple agents. - Shantanu Das 001; Paola Flocchini; Shay Kutten; Amiya Nayak; Nicola Santoro (Theor. Comput. Sci., 2007)

Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments. - Eduardo Mesa Barrameda; Shantanu Das 001; Nicola Santoro (ALGOSENSORS, 2008)

Mobile Agent Rendezvous in a Ring Using Faulty Tokens. - Shantanu Das 001 (ICDCN, 2008)

Computing Best Swaps in Optimal Tree Spanners. - Shantanu Das 001; Beat Gfeller; Peter Widmayer (ISAAC, 2008)

Rendezvous of Mobile Agents When Tokens Fail Anytime. - Shantanu Das 001; Matús Mihalák; Rastislav Srámek; Elias Vicari; Peter Widmayer (OPODIS, 2008)

Detecting and Preventing IP-spoofed Distributed DoS Attacks. - Yao Chen; Shantanu Das 001; Pulak Dhar; Abdulmotaleb El-Saddik; Amiya Nayak (Int. J. Netw. Secur., 2008)

Review of SIROCCO 2009. - Shantanu Das 001 (SIGACT News, 2009)

A localized algorithm for bi-connectivity of connected mobile robots. - Shantanu Das 001; Hai Liu 001; Amiya Nayak; Ivan Stojmenovic (Telecommun. Syst., 2009)

How Simple Robots Benefit from Looking Back. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (CIAC, 2010)

Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. - Andreas Emil Feldmann; Shantanu Das 001; Peter Widmayer (COCOA (1), 2010)

Rendezvous of Mobile Agents without Agreement on Local Orientation. - Jérémie Chalopin; Shantanu Das 001 (ICALP (2), 2010)

Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. - Jérémie Chalopin; Shantanu Das 001; Adrian Kosowski (OPODIS, 2010)

On the computational power of oblivious robots: forming a series of geometric patterns. - Shantanu Das 001; Paola Flocchini; Nicola Santoro; Masafumi Yamashita (PODC, 2010)

Rendezvous of Mobile Agents in Directed Graphs. - Jérémie Chalopin; Shantanu Das 001; Peter Widmayer (DISC, 2010)

Computing All Best Swaps for Minimum-Stretch Tree Spanners. - Shantanu Das 001; Beat Gfeller; Peter Widmayer (J. Graph Algorithms Appl., 2010)

Tight Bounds for Scattered Black Hole Search in a Ring. - Jérémie Chalopin; Shantanu Das 001; Arnaud Labourel; Euripides Markou (SIROCCO, 2011)

Telling convex from reflex allows to map a polygon. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (STACS, 2011)

Black Hole Search with Finite Automata Scattered in a Synchronous Torus. - Jérémie Chalopin; Shantanu Das 001; Arnaud Labourel; Euripides Markou (DISC, 2011)

Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. - Andreas Emil Feldmann; Shantanu Das 001; Peter Widmayer (WG, 2011)

The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Masafumi Yamashita (ICDCS, 2012)

Brief Announcement: Wait-Free Gathering of Mobile Robots. - Zohir Bouzid; Shantanu Das 001; Sébastien Tixeuil (DISC, 2012)

Wait-Free Gathering of Mobile Robots - Zohir Bouzid; Shantanu Das 001; Sébastien Tixeuil (CoRR, 2012)

Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes. - Eduardo Mesa Barrameda; Shantanu Das 001; Nicola Santoro (ALGOSENSORS, 2013)

Data Delivery by Energy-Constrained Mobile Agents. - Jérémie Chalopin; Shantanu Das 001; Matús Mihalák; Paolo Penna; Peter Widmayer (ALGOSENSORS, 2013)

Distributed Verification Using Mobile Agents. - Shantanu Das 001; Shay Kutten; Zvi Lotker (ICDCN, 2013)

Gathering of Mobile Robots Tolerating Multiple Crash Faults. - Zohir Bouzid; Shantanu Das 001; Sébastien Tixeuil (ICDCS, 2013)

Mapping Simple Polygons: How Robots Benefit from Looking Back. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (Algorithmica, 2013)

Simple agents learn to find their way: An introduction on mapping polygons. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (Discret. Appl. Math., 2013)

Corner cuts are close to optimal: From solid grids to polygons and back. - Andreas Emil Feldmann; Shantanu Das 001; Peter Widmayer (Discret. Appl. Math., 2013)

Mobile agents in distributed computing: Network exploration. - Shantanu Das 001 (Bull. EATCS, 2013)

Tight bounds for black hole search with scattered agents in synchronous rings. - Jérémie Chalopin; Shantanu Das 001; Arnaud Labourel; Euripides Markou (Theor. Comput. Sci., 2013)

Synchronized Dancing of Oblivious Chameleons. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (FUN, 2014)

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. - Shantanu Das 001; Dariusz Dereniowski; Adrian Kosowski; Przemyslaw Uznanski (SIROCCO, 2014)

Lock-in Problem for Parallel Rotor-router Walks. - Jérémie Chalopin; Shantanu Das 001; Pawel Gawrychowski; Adrian Kosowski; Arnaud Labourel; Przemyslaw Uznanski (CoRR, 2014)

Mobile Agents Rendezvous in Spite of a Malicious Agent. - Shantanu Das 001; Flaminia L. Luccio; Euripides Markou (ALGOSENSORS, 2015)

Collaborative Exploration by Energy-Constrained Mobile Robots. - Shantanu Das 001; Dariusz Dereniowski; Christina Karousatou (SIROCCO, 2015)

Limit Behavior of the Multi-agent Rotor-Router System. - Jérémie Chalopin; Shantanu Das 001; Pawel Gawrychowski; Adrian Kosowski; Arnaud Labourel; Przemyslaw Uznanski (DISC, 2015)

Forming sequences of geometric patterns with oblivious mobile robots. - Shantanu Das 001; Paola Flocchini; Nicola Santoro; Masafumi Yamashita (Distributed Comput., 2015)

Mapping Simple Polygons: The Power of Telling Convex from Reflex. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (ACM Trans. Algorithms, 2015)

Gathering of Robots in a Ring with Mobile Faults. - Shantanu Das 001; Riccardo Focardi; Flaminia L. Luccio; Euripides Markou; Davide Moro; Marco Squarcina (ICTCS, 2016)

Distributed Evacuation in Graphs with Multiple Exits. - Piotr Borowiecki; Shantanu Das 001; Dariusz Dereniowski; Lukasz Kuszner (SIROCCO, 2016)

Autonomous mobile robots with lights. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Masafumi Yamashita (Theor. Comput. Sci., 2016)

Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots. - Evangelos Bampas; Shantanu Das 001; Dariusz Dereniowski; Christina Karousatou (ALGOSENSORS, 2017)

Energy-Efficient Delivery by Heterogeneous Mobile Agents. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Daniel Graf 001; Jan Hackfeld; Paolo Penna (STACS, 2017)

Mediated Population Protocols: Leader Election and Applications. - Shantanu Das 001; Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta (TAMC, 2017)

Brief Announcement: Energy Constrained Depth First Search. - Shantanu Das 001; Dariusz Dereniowski; Przemyslaw Uznanski (ICALP, 2018)

Maximal Exploration of Trees with Energy-Constrained Agents. - Evangelos Bampas; Jérémie Chalopin; Shantanu Das 001; Jan Hackfeld; Christina Karousatou (CoRR, 2018)

Collaborative Exploration of Trees by Energy-Constrained Mobile Robots. - Shantanu Das 001; Dariusz Dereniowski; Christina Karousatou (Theory Comput. Syst., 2018)

Oblivious Permutations on the Plane. - Shantanu Das 001; Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (OPODIS, 2019)

Gathering of Robots in a Grid with Mobile Faults. - Shantanu Das 001; Nikos Giachoudis; Flaminia L. Luccio; Euripides Markou (SOFSEM, 2019)

Patrolling on Dynamic Ring Networks. - Shantanu Das 001; Giuseppe Antonio Di Luna; Leszek Antoni Gasieniec (SOFSEM, 2019)

Compacting and Grouping Mobile Agents on Dynamic Rings. - Shantanu Das 001; Giuseppe Antonio Di Luna; Linda Pagli; Giuseppe Prencipe (TAMC, 2019)

Gathering of robots in a ring with mobile faults. - Shantanu Das 001; Riccardo Focardi; Flaminia L. Luccio; Euripides Markou; Marco Squarcina (Theor. Comput. Sci., 2019)

Moving and Computing Models: Agents. - Shantanu Das 001; Nicola Santoro (Distributed Computing by Mobile Entities, 2019)

Graph Explorations with Mobile Agents. - Shantanu Das 001 (Distributed Computing by Mobile Entities, 2019)

Leader Election and Compaction for Asynchronous Silent Programmable Matter. - Gianlorenzo D'Angelo; Mattia D'Emidio; Shantanu Das 001; Alfredo Navarra; Giuseppe Prencipe (AAMAS, 2020)

Broadcasting with Mobile Agents in Dynamic Networks. - Shantanu Das 001; Nikos Giachoudis; Flaminia L. Luccio; Euripides Markou (OPODIS, 2020)

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. - Gianlorenzo D'Angelo; Mattia D'Emidio; Shantanu Das 001; Alfredo Navarra; Giuseppe Prencipe (IEEE Access, 2020)

Forming Sequences of Patterns With Luminous Robots. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (IEEE Access, 2020)

Collaborative delivery with energy-constrained mobile robots. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Barbara Geissmann; Daniel Graf 001; Arnaud Labourel; Matús Mihalák (Theor. Comput. Sci., 2020)

Special issue on Structural Information and Communication Complexity. - Shantanu Das 001; Sébastien Tixeuil (Theor. Comput. Sci., 2020)

Compacting oblivious agents on dynamic rings. - Shantanu Das 001; Giuseppe Antonio Di Luna; Daniele Mazzei; Giuseppe Prencipe (PeerJ Comput. Sci., 2021)

Near-gathering of energy-constrained mobile agents. - Andreas Bärtschi; Evangelos Bampas; Jérémie Chalopin; Shantanu Das 001; Christina Karousatou; Matús Mihalák (Theor. Comput. Sci., 2021)

Collaborative delivery on a fixed path with homogeneous energy-constrained agents. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Arnaud Labourel; Matús Mihalák (Theor. Comput. Sci., 2021)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction. - Jérémie Chalopin; Shantanu Das 001; Maria Kokkou (SIROCCO, 2024)

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. - Jérémie Chalopin; Shantanu Das 001; Maria Kokkou (DISC, 2024)

Energy Constrained Depth First Search. - Shantanu Das 001; Dariusz Dereniowski; Przemyslaw Uznanski (Algorithmica, 2024)

Discrete evacuation in graphs with multiple exits. - Piotr Borowiecki; Shantanu Das 001; Dariusz Dereniowski; Lukasz Kuszner (Theor. Comput. Sci., 2025)

Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes. - Jérémie Chalopin; Shantanu Das 001; Maria Kokkou (CoRR, 2025)