Localization in Presence of Multipath Effect in Wireless Sensor Networks. - Kaushik Mondal 001; Partha Sarathi Mandal 001; Bhabani P. Sinha (WWIC, 2012)

Localization Based on Two-Bound Reflected Signals in Wireless Sensor Networks. - Kaushik Mondal 001; Arjun Talwar; Partha Sarathi Mandal 001; Bhabani P. Sinha (ICDCIT, 2013)

Range-Free Mobile Node Localization Using Static Anchor. - Kaushik Mondal 001; Partha Sarathi Mandal 001 (WASA, 2013)

Designing Path Planning Algorithms for Mobile Anchor towards Range-Free Localization. - Kaushik Mondal 001; Arindam Karmakar; Partha Sarathi Mandal 001 (CoRR, 2014)

Path Planning Algorithm for Mobile Anchor in Connected Sensor Networks. - Kaushik Mondal 001; Arindam Karmakar; Partha Sarathi Mandal 001 (ICDCIT, 2015)

Analysis of Multiple-Bound Signals Towards Localization: A Theoretical Approach. - Kaushik Mondal 001; Partha Sarathi Mandal 001; Bhabani P. Sinha (Wirel. Pers. Commun., 2015)

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

Path planning algorithms for mobile anchors towards range-free localization. - Kaushik Mondal 001; Arindam Karmakar; Partha Sarathi Mandal 001 (J. Parallel Distributed Comput., 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)

Range-Free Mobile Sensor Localization and a Novel Obstacle Detection Technique. - Kaushik Mondal 001; Partha Sarathi Mandal 001 (Wirel. Pers. Commun., 2017)

A robust deterministic approach to node localisation using NLOS signal. - Kaushik Mondal 001; Partha Sarathi Mandal 001; Bhabani P. Sinha (Int. J. Commun. Networks Distributed Syst., 2018)

Edge Exploration of a Graph by Mobile Agent. - Amit Kumar Dhar; Barun Gorain; Kaushik Mondal 001; Shaswati Patra; Rishi Ranjan Singh (COCOA, 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)

Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (ALGOSENSORS, 2020)

Dynamically Optimal Self-adjusting Single-Source Tree Networks. - Chen Avin; Kaushik Mondal 001; Stefan Schmid 001 (LATIN, 2020)

NP-completeness Results for Graph Burning on Geometric Graphs. - Arya Tanmay Gupta; Swapnil A. Lokhande; Kaushik Mondal 001 (CoRR, 2020)

Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (CoRR, 2020)

Demand-aware network designs of bounded degree. - Chen Avin; Kaushik Mondal 001; Stefan Schmid 001 (Distributed Comput., 2020)

Burning Grids and Intervals. - Arya Tanmay Gupta; Swapnil A. Lokhande; Kaushik Mondal 001 (CALDAM, 2021)

Byzantine Dispersion on Graphs. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (IPDPS, 2021)

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. - Barun Gorain; Kaushik Mondal 001; Himadri Nayak; Supantha Pandit (SIROCCO, 2021)

Distributed Independent Sets in Interval and Segment Intersection Graphs. - Barun Gorain; Kaushik Mondal 001; Supantha Pandit (SOFSEM, 2021)

Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (Theor. Comput. Sci., 2021)

Distributed Dominating Sets in Interval Graphs. - Barun Gorain; Kaushik Mondal 001; Supantha Pandit (COCOON, 2022)

Distributed Connected Dominating Sets in Unit Square and Disk Graphs. - Barun Gorain; Kaushik Mondal 001; Supantha Pandit (TAMC, 2022)

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

Pebble guided optimal treasure hunt in anonymous graphs. - Barun Gorain; Kaushik Mondal 001; Himadri Nayak; Supantha Pandit (Theor. Comput. Sci., 2022)

Demand-Aware Network Design With Minimal Congestion and Route Lengths. - Chen Avin; Kaushik Mondal 001; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2022)

Push-Down Trees: Optimal Self-Adjusting Complete Trees. - Chen Avin; Kaushik Mondal 001; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2022)

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (IPDPS, 2023)

Distance-2-Dispersion: Dispersion with Further Constraints. - Tanvir Kaur; Kaushik Mondal 001 (NETYS, 2023)

Edge exploration of anonymous graph by mobile agent with external help. - Amit Kumar Dhar; Barun Gorain; Kaushik Mondal 001; Shaswati Patra; Rishi Ranjan Singh (Computing, 2023)

Burning and w-burning of geometric graphs. - Barun Gorain; Arya Tanmay Gupta; Swapnil A. Lokhande; Kaushik Mondal 001; Supantha Pandit (Discret. Appl. Math., 2023)

Distance-2-Dispersion with Termination by a Strong Team. - Barun Gorain; Tanvir Kaur; Kaushik Mondal 001 (CALDAM, 2024)

Brief Announcement: Pebble Guided Rendezvous Despite Fault. - Ashish Saxena; Barun Gorain; Subhrangsu Mandal; Kaushik Mondal 001 (SSS, 2024)

Optimal Dispersion of Silent Robots in a Ring. - Bibhuti Das 001; Barun Gorain; Kaushik Mondal 001; Krishnendu Mukhopadhyaya; Supantha Pandit (CoRR, 2024)

Efficient D-2-D with a Strong Group: Arbitrary Initial Configuration and No Global Knowledge. - Tanvir Kaur; Barun Gorain; Kaushik Mondal 001 (CoRR, 2024)

Collaborative dispersion by silent robots. - Barun Gorain; Partha Sarathi Mandal 001; Kaushik Mondal 001; Supantha Pandit (J. Parallel Distributed Comput., 2024)

A further study on weak Byzantine gathering of mobile agents. - Ashish Saxena; Kaushik Mondal 001 (Theor. Comput. Sci., 2024)

Black Hole Search in Dynamic Graphs. - Tanvir Kaur; Ashish Saxena; Partha Sarathi Mandal 001; Kaushik Mondal 001 (ICDCN, 2025)

Path Connected Dynamic Graphs with a Study of Efficient Dispersion. - Ashish Saxena; Kaushik Mondal 001 (ICDCN, 2025)

Dispersion on Time Varying Graphs. - Ashish Saxena; Tanvir Kaur; Kaushik Mondal 001 (ICDCN, 2025)

Mobile agents on chordal graphs: Maximum independent set and beyond. - Tanvir Kaur; Kaustav Paul; Kaushik Mondal 001 (Theor. Comput. Sci., 2025)

Path connected dynamic graphs with a study of dispersion and exploration. - Ashish Saxena; Kaushik Mondal 001 (Theor. Comput. Sci., 2025)

Distributed Independent Sets in Interval and Segment Intersection Graphs. - Nirmala Bhatt; Barun Gorain; Kaushik Mondal 001; Supantha Pandit (Int. J. Found. Comput. Sci., 2025)