Kaushik Mondal

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 43

Top Topics

Path Planning Algorithm

Location Information

Top Venues

J. Parallel Distributed Comput.

IEEE/ACM Trans. Netw.

Publications

Barun Gorain, Tanvir Kaur, Kaushik Mondal
Distance-2-Dispersion with Termination by a Strong Team. CALDAM (2024)
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit
Collaborative dispersion by silent robots. J. Parallel Distributed Comput. 188 (2024)
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal
Black Hole Search in Dynamic Graphs. CoRR (2024)
Ashish Saxena, Kaushik Mondal
A Further Study on Weak Byzantine Gathering of Mobile Agents. ICDCN (2024)
Tanvir Kaur, Kaushik Mondal
Distance-2-Dispersion: Dispersion with Further Constraints. NETYS (2023)
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. IPDPS (2023)
Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh
Edge exploration of anonymous graph by mobile agent with external help. Computing 105 (2) (2023)
Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit
Burning and w-burning of geometric graphs. Discret. Appl. Math. 336 (2023)
Tanvir Kaur, Kaushik Mondal
Distance-2-Dispersion: Dispersion with Further Constraints. CoRR (2023)
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. CoRR (2023)
Barun Gorain, Kaushik Mondal, Supantha Pandit
Distributed Dominating Sets in Interval Graphs. COCOON (2022)
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
Pebble guided optimal treasure hunt in anonymous graphs. Theor. Comput. Sci. 922 (2022)
Barun Gorain, Kaushik Mondal, Supantha Pandit
Distributed Connected Dominating Sets in Unit Square and Disk Graphs. TAMC (2022)
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid
Area Convergence of Monoculus Robots With Additional Capabilities. Comput. J. 65 (5) (2022)
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit
Collaborative Dispersion by Silent Robots. CoRR (2022)
Chen Avin, Kaushik Mondal, Stefan Schmid
Push-Down Trees: Optimal Self-Adjusting Complete Trees. IEEE/ACM Trans. Netw. 30 (6) (2022)
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit
Collaborative Dispersion by Silent Robots. SSS (2022)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-Aware Network Design With Minimal Congestion and Route Lengths. IEEE/ACM Trans. Netw. 30 (4) (2022)
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
Byzantine Dispersion on Graphs. CoRR (2021)
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. SIROCCO (2021)
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
Byzantine Dispersion on Graphs. IPDPS (2021)
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
Burning Grids and Intervals. CALDAM (2021)
Barun Gorain, Kaushik Mondal, Supantha Pandit
Distributed Independent Sets in Interval and Segment Intersection Graphs. SOFSEM (2021)
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots. Theor. Comput. Sci. 887 (2021)
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. CoRR (2021)
Chen Avin, Kaushik Mondal, Stefan Schmid
Dynamically Optimal Self-adjusting Single-Source Tree Networks. LATIN (2020)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-aware network designs of bounded degree. Distributed Comput. 33 (3-4) (2020)
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots. CoRR (2020)
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots. ALGOSENSORS (2020)
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
NP-completeness Results for Graph Burning on Geometric Graphs. CoRR (2020)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-Aware Network Design with Minimal Congestion and Route Lengths. INFOCOM (2019)
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
Gathering of mobile robots with weak multiplicity detection in presence of crash-faults. J. Parallel Distributed Comput. 123 (2019)
Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh
Edge Exploration of a Graph by Mobile Agent. COCOA (2019)
Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha
A robust deterministic approach to node localisation using NLOS signal. Int. J. Commun. Networks Distributed Syst. 20 (3) (2018)
Chen Avin, Kaushik Mondal, Stefan Schmid
Push-Down Trees: Optimal Self-Adjusting Complete Trees. CoRR (2018)
Kaushik Mondal, Partha Sarathi Mandal
Range-Free Mobile Sensor Localization and a Novel Obstacle Detection Technique. Wirel. Pers. Commun. 92 (2) (2017)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-Aware Network Designs of Bounded Degree. DISC (2017)
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid
Convergence of Even Simpler Robots without Position Information. NETYS (2017)
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. ICDCN (2017)
Chen Avin, Kaushik Mondal, Stefan Schmid
Demand-Aware Network Designs of Bounded Degree. CoRR (2017)
Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal
Path planning algorithms for mobile anchors towards range-free localization. J. Parallel Distributed Comput. 97 (2016)
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid
Convergence of Even Simpler Robots without Location Information. CoRR (2016)
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. CoRR (2016)
Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal
Path Planning Algorithm for Mobile Anchor in Connected Sensor Networks. ICDCIT (2015)
Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha
Analysis of Multiple-Bound Signals Towards Localization: A Theoretical Approach. Wirel. Pers. Commun. 83 (1) (2015)
Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal
Designing Path Planning Algorithms for Mobile Anchor towards Range-Free Localization. CoRR (2014)
Kaushik Mondal, Partha Sarathi Mandal
Range-Free Mobile Node Localization Using Static Anchor. WASA (2013)
Kaushik Mondal, Arjun Talwar, Partha Sarathi Mandal, Bhabani P. Sinha
Localization Based on Two-Bound Reflected Signals in Wireless Sensor Networks. ICDCIT (2013)
Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha
Localization in Presence of Multipath Effect in Wireless Sensor Networks. WWIC (2012)