Kaushik Mondal

69 papers A* 1A 4B 3C 7Misc 9Journal 39Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Black Hole Search: Dynamics, Distribution, and Emergence.
CoRR
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal
2026 J jnl
Exploration on Highly Dynamic Graphs.
CoRR
Ashish Saxena, Kaushik Mondal
2026 J jnl
Maximal Independent Set via Leader Election by Mobile Agents from Arbitrary Initial Configuration Without Global Knowledge.
SN Comput. Sci.
Tanvir Kaur, Barun Gorain, Kaushik Mondal
2026 J jnl
Memory optimal distance-2-dispersion with termination.
Int. J. Parallel Emergent Distributed Syst.
Tanvir Kaur, Kaushik Mondal
2025 C conf
Black Hole Search by Scattered Agents on Time-Varying Dynamic Graphs.
SSS
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal
2025 Misc conf
Black Hole Search in Dynamic Graphs.
ICDCN
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal
2025 Misc conf
Dispersion on Time Varying Graphs.
ICDCN
Ashish Saxena, Tanvir Kaur, Kaushik Mondal
2025 J jnl
Distributed Independent Sets in Interval and Segment Intersection Graphs.
Int. J. Found. Comput. Sci.
Nirmala Bhatt, Barun Gorain, Kaushik Mondal, Supantha Pandit
2025 Misc conf
Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond.
ICDCIT
Tanvir Kaur, Kaustav Paul, Kaushik Mondal
2025 J jnl
Mobile agents on chordal graphs: Maximum independent set and beyond.
Theor. Comput. Sci.
Tanvir Kaur, Kaustav Paul, Kaushik Mondal
2025 A conf
Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic Graphs.
DISC
Ashish Saxena, Kaushik Mondal
2025 C conf
Optimal Dispersion of Silent Robots in a Ring.
SSS
Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit
2025 J jnl
Path Connected Dynamic Graphs with a Study of Dispersion and Exploration.
CoRR
Ashish Saxena, Kaushik Mondal
2025 Misc conf
Path Connected Dynamic Graphs with a Study of Efficient Dispersion.
ICDCN
Ashish Saxena, Kaushik Mondal
2025 J jnl
Path connected dynamic graphs with a study of dispersion and exploration.
Theor. Comput. Sci.
Ashish Saxena, Kaushik Mondal
2024 Misc conf
A Further Study on Weak Byzantine Gathering of Mobile Agents.
ICDCN
Ashish Saxena, Kaushik Mondal
2024 J jnl
A further study on weak Byzantine gathering of mobile agents.
Theor. Comput. Sci.
Ashish Saxena, Kaushik Mondal
2024 J jnl
Black Hole Search in Dynamic Graphs.
CoRR
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal
2024 C conf
Brief Announcement: Pebble Guided Rendezvous Despite Fault.
SSS
Ashish Saxena, Barun Gorain, Subhrangsu Mandal, Kaushik Mondal
2024 J jnl
Collaborative dispersion by silent robots.
J. Parallel Distributed Comput.
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit
2024 J jnl
Dispersion on Time-Varying Graphs.
CoRR
Ashish Saxena, Tanvir Kaur, Kaushik Mondal
2024 — conf
Distance-2-Dispersion with Termination by a Strong Team.
CALDAM
Barun Gorain, Tanvir Kaur, Kaushik Mondal
2024 J jnl
Efficient D-2-D with a Strong Group: Arbitrary Initial Configuration and No Global Knowledge.
CoRR
Tanvir Kaur, Barun Gorain, Kaushik Mondal
2024 J jnl
Optimal Dispersion of Silent Robots in a Ring.
CoRR
Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit
2023 J jnl
Burning and w-burning of geometric graphs.
Discret. Appl. Math.
Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit
2023 — conf
Distance-2-Dispersion: Dispersion with Further Constraints.
NETYS
Tanvir Kaur, Kaushik Mondal
2023 J jnl
Distance-2-Dispersion: Dispersion with Further Constraints.
CoRR
Tanvir Kaur, Kaushik Mondal
2023 J jnl
Edge exploration of anonymous graph by mobile agent with external help.
Computing
Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh
2023 A conf
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots.
IPDPS
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
2023 J jnl
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots.
CoRR
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
2022 J jnl
Area Convergence of Monoculus Robots With Additional Capabilities.
Comput. J.
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid
2022 C conf
Collaborative Dispersion by Silent Robots.
SSS
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit
2022 J jnl
Collaborative Dispersion by Silent Robots.
CoRR
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit
2022 J jnl
Demand-Aware Network Design With Minimal Congestion and Route Lengths.
IEEE/ACM Trans. Netw.
Chen Avin, Kaushik Mondal, Stefan Schmid
2022 C conf
Distributed Connected Dominating Sets in Unit Square and Disk Graphs.
TAMC
Barun Gorain, Kaushik Mondal, Supantha Pandit
2022 Misc conf
Distributed Dominating Sets in Interval Graphs.
COCOON
Barun Gorain, Kaushik Mondal, Supantha Pandit
2022 J jnl
Pebble guided optimal treasure hunt in anonymous graphs.
Theor. Comput. Sci.
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
2022 J jnl
Push-Down Trees: Optimal Self-Adjusting Complete Trees.
IEEE/ACM Trans. Netw.
Chen Avin, Kaushik Mondal, Stefan Schmid
2021 — conf
Burning Grids and Intervals.
CALDAM
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
2021 A conf
Byzantine Dispersion on Graphs.
IPDPS
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
2021 J jnl
Byzantine Dispersion on Graphs.
CoRR
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
2021 B conf
Distributed Independent Sets in Interval and Segment Intersection Graphs.
SOFSEM
Barun Gorain, Kaushik Mondal, Supantha Pandit
2021 J jnl
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots.
Theor. Comput. Sci.
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
2021 B conf
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs.
SIROCCO
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
2021 J jnl
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs.
CoRR
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
2020 J jnl
Demand-aware network designs of bounded degree.
Distributed Comput.
Chen Avin, Kaushik Mondal, Stefan Schmid
2020 B conf
Dynamically Optimal Self-adjusting Single-Source Tree Networks.
LATIN
Chen Avin, Kaushik Mondal, Stefan Schmid
2020 J jnl
Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots.
CoRR
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
2020 C conf
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots.
ALGOSENSORS
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
2020 J jnl
NP-completeness Results for Graph Burning on Geometric Graphs.
CoRR
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
2019 A* conf
Demand-Aware Network Design with Minimal Congestion and Route Lengths.
INFOCOM
Chen Avin, Kaushik Mondal, Stefan Schmid
2019 C conf
Edge Exploration of a Graph by Mobile Agent.
COCOA
Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh
2019 J jnl
Gathering of mobile robots with weak multiplicity detection in presence of crash-faults.
J. Parallel Distributed Comput.
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
2018 J jnl
A robust deterministic approach to node localisation using NLOS signal.
Int. J. Commun. Networks Distributed Syst.
Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha
2018 J jnl
Push-Down Trees: Optimal Self-Adjusting Complete Trees.
CoRR
Chen Avin, Kaushik Mondal, Stefan Schmid
2017 — conf
Convergence of Even Simpler Robots without Position Information.
NETYS
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid
2017 A conf
Demand-Aware Network Designs of Bounded Degree.
DISC
Chen Avin, Kaushik Mondal, Stefan Schmid
2017 J jnl
Demand-Aware Network Designs of Bounded Degree.
CoRR
Chen Avin, Kaushik Mondal, Stefan Schmid
2017 Misc conf
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection.
ICDCN
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
2017 J jnl
Range-Free Mobile Sensor Localization and a Novel Obstacle Detection Technique.
Wirel. Pers. Commun.
Kaushik Mondal, Partha Sarathi Mandal
2016 J jnl
Convergence of Even Simpler Robots without Location Information.
CoRR
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid
2016 J jnl
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection.
CoRR
Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
2016 J jnl
Path planning algorithms for mobile anchors towards range-free localization.
J. Parallel Distributed Comput.
Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal
2015 J jnl
Analysis of Multiple-Bound Signals Towards Localization: A Theoretical Approach.
Wirel. Pers. Commun.
Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha
2015 Misc conf
Path Planning Algorithm for Mobile Anchor in Connected Sensor Networks.
ICDCIT
Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal
2014 J jnl
Designing Path Planning Algorithms for Mobile Anchor towards Range-Free Localization.
CoRR
Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal
2013 Misc conf
Localization Based on Two-Bound Reflected Signals in Wireless Sensor Networks.
ICDCIT
Kaushik Mondal, Arjun Talwar, Partha Sarathi Mandal, Bhabani P. Sinha
2013 — conf
Range-Free Mobile Node Localization Using Static Anchor.
WASA
Kaushik Mondal, Partha Sarathi Mandal
2012 — conf
Localization in Presence of Multipath Effect in Wireless Sensor Networks.
WWIC
Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha