Dr. Kaushik Mondal

Assistant Professor
  • Department of Mathematics
  • Indian Institute of Technology Ropar
  • Rupnagar, Punjab - 140001, India
AAA Caption
BBB Caption
Areas of Research: 
Distributed Algorithms for Swarm Robots, Algorithms for mobile agents, Distributed Graph Algorithms
Network Algorithms, Algorithms for Wireless Sensor Networks
  • Ph.D: Indian Institute of Technology Guwahati, 2015.
  • M.Sc: Visva Bharati, 2008
  • Assistant Professor, IIT Ropar, January 2020 – Till date
  • Assistant Professor, IIIT Vadodara, July 2019 – January 2020
  • Visiting Scientist, ACMU, ISI Kolkata, March 2019 – June 2019
  • Postdoctoral Fellow, Ben Gurion University of the Negev, Israel, December 2016 – February 2019
  • Postdoc, IIT Guwahati, August 2015 – November 2016
22. Tanvir Kaur, Kaushik Mondal, Memory optimal distance-2-dispersion with termination. Int. J. Parallel Emergent Distributed Syst. 41(2): 253-274 (2026).
21. Tanvir Kaur, Barun Gorain, Kaushik Mondal, Maximal Independent Set via Leader Election by Mobile Agents from Arbitrary Initial Configuration Without Global Knowledge. SN Comput. Sci. 7(1): 125 (2026).
20. Nirmala Bhatt, Barun Gorain, Kaushik Mondal, Supantha Pandit, Distributed Independent Sets in Interval and Segment Intersection Graphs. Int. J. Found. Comput. Sci. 36(1): 67-95 (2025).
19. Ashish Saxena, Kaushik Mondal, Path connected dynamic graphs with a study of dispersion and exploration. Theor. Comput. Sci. 1050: 115390 (2025).
18. Tanvir Kaur, Kaustav Paul, Kaushik Mondal, Mobile agents on chordal graphs: Maximum independent set and beyond. Theor. Comput. Sci. 1055: 115490 (2025).
17. Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit, Collaborative dispersion by silent robots. J. Parallel Distributed Comput. 188: 104852 (2024).
16. Ashish Saxena, Kaushik Mondal, A further study on weak Byzantine gathering of mobile agents. Theor. Comput. Sci. 1022: 114892 (2024).
15. 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): 483-506 (2023).
14. Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit, Burning and w-burning of geometric graphs. Discret. Appl. Math. 336: 83-98 (2023).
13. Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid, Area Convergence of Monoculus Robots With Additional Capabilities. Comput. J. 65(5): 1306-1319 (2022).
12. Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit, Pebble guided optimal treasure hunt in anonymous graphs. Theor. Comput. Sci. 922: 61-80 (2022).
11. Chen Avin, Kaushik Mondal, Stefan Schmid, Demand-Aware Network Design With Minimal Congestion and Route Lengths. IEEE/ACM Trans. Netw. 30(4): 1838-1848 (2022).
10. Chen Avin, Kaushik Mondal, Stefan Schmid, Push-Down Trees: Optimal Self-Adjusting Complete Trees. IEEE/ACM Trans. Netw. 30(6): 2419-2432 (2022).
9. Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.,"Optimal Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots", Theoretical Computer Science (Elsevier), 887:111-121 (2021).
8. Chen Avin, Kaushik Mondal, Stefan Schmid, "Demand-Aware Network Design of Bounded Degree", Distributed Computing (Springer), 33: 311-325 (2020).
7. Debasish Pattanayak, Kaushik Mondal, H. Ramesh and Partha Sarathi Mandal, "Gathering of Mobile Robots with Weak Multiplicity Detection in Presence of Crash-Faults", Journal of Parallel and Distributed Computing (Elsevier), 123: 145-155 (2019).
6. Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal, "Path planning algorithms for mobile anchors towards range-free localization", Journal of Parallel and Distributed Computing (Elsevier), 97: 35-46 (2016).
5. Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit, "Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs"" in the International Colloquium on Structural Information and Communication Complexity (SIROCCO 2021), 222-239, Wroclaw, Poland.
4. Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr., "Byzantine Dispersion on Graphs" in the International Parallel and Distributed Processing Symposium (IPDPS 2021),942-951, Lousiana, USA.
3. C. Avin, K. Mondal, and S. Schmid, "Dynamically Optimal Self-Adjusting Single-Source Tree Networks" in the Latin American Theoretical Informatics Symposium (LATIN 2020),143-154, Sao Paolo, Brazil.
2. Chen Avin, Kaushik Mondal, Stefan Schmid, "Demand-Aware Network Design with Minimal Congestion and Route Lengths" in the IEEE International Conference on Computer Communications (INFOCOM 2019) 1351-1359, Paris, France.
1. Chen Avin, Kaushik Mondal and Stefan Schmid, "Demand-Aware Network Designs of Bounded Degree" in the 31 st International Symposium on DIStributed Computing (DISC 2017), Oct 16-20, 2017 Vienna, Austria.
30. Tanvir Kaur, Kaustav Paul, Kaushik Mondal, Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond. ICDCIT 2025: 92-107.
29. Ashish Saxena, Kaushik Mondal, Path Connected Dynamic Graphs with a Study of Efficient Dispersion. ICDCN 2025: 171-180.
28. Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal, Black Hole Search in Dynamic Graphs. ICDCN 2025: 221-230.
27. Ashish Saxena, Tanvir Kaur, Kaushik Mondal, Dispersion on Time Varying Graphs. ICDCN 2025: 269-273.
26. Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit, Optimal Dispersion of Silent Robots in a Ring. SSS 2025: 171-191.
25. Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal, Black Hole Search by Scattered Agents on Time-Varying Dynamic Graphs. SSS 2025: 309-324.
24. Ashish Saxena, Kaushik Mondal, Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic Graphs. DISC 2025: 41:1-41:23.
23. Barun Gorain, Tanvir Kaur, Kaushik Mondal, Distance-2-Dispersion with Termination by a Strong Team. CALDAM 2024: 44-58.
22. Ashish Saxena, Kaushik Mondal, A Further Study on Weak Byzantine Gathering of Mobile Agents. ICDCN 2024: 22-31.
21. Ashish Saxena, Barun Gorain, Subhrangsu Mandal, Kaushik Mondal, Brief Announcement: Pebble Guided Rendezvous Despite Fault. SSS 2024: 121-125.
20. Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr., Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. IPDPS 2023: 47-57.
19. Tanvir Kaur, Kaushik Mondal, Distance-2-Dispersion: Dispersion with Further Constraints. NETYS 2023: 157-173.
18. Barun Gorain, Kaushik Mondal, Supantha Pandit, Distributed Dominating Sets in Interval Graphs. COCOON 2022: 508-520.
17. Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit, Collaborative Dispersion by Silent Robots. SSS 2022: 254-269.
16. Barun Gorain, Kaushik Mondal, Supantha Pandit, Distributed Connected Dominating Sets in Unit Square and Disk Graphs. TAMC 2022: 346-358.
15. Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Burning Grids and Intervals. CALDAM 2021: 66-79.
14. Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr., Byzantine Dispersion on Graphs. IPDPS 2021: 942-951.
13. Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit, Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. SIROCCO 2021: 222-239.
12. Barun Gorain, Kaushik Mondal, Supantha Pandit, Distributed Independent Sets in Interval and Segment Intersection Graphs. SOFSEM 2021: 175-188.
11. Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr., Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots. ALGOSENSORS 2020: 154-169.
10. Chen Avin, Kaushik Mondal, Stefan Schmid, Dynamically Optimal Self-adjusting Single-Source Tree Networks. LATIN 2020: 143-154.
9. Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh, Edge Exploration of a Graph by Mobile Agent. COCOA 2019: 142-154.
8. Chen Avin, Kaushik Mondal, Stefan Schmid, Demand-Aware Network Design with Minimal Congestion and Route Lengths. INFOCOM 2019: 1351-1359.
7. Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal, Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. ICDCN 2017: 7.
6. Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid, Convergence of Even Simpler Robots without Position Information. NETYS 2017: 69-85.
5. Chen Avin, Kaushik Mondal, Stefan Schmid, Demand-Aware Network Designs of Bounded Degree. DISC 2017: 5:1-5:16.
4. Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal, Path Planning Algorithm for Mobile Anchor in Connected Sensor Networks. ICDCIT 2015: 193-198.
3. Kaushik Mondal, Arjun Talwar, Partha Sarathi Mandal, Bhabani P. Sinha, Localization Based on Two-Bound Reflected Signals in Wireless Sensor Networks. ICDCIT 2013: 334-346.
2. Kaushik Mondal, Partha Sarathi Mandal, Range-Free Mobile Node Localization Using Static Anchor. WASA 2013: 269-284.
1. Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha, Localization in Presence of Multipath Effect in Wireless Sensor Networks. WWIC 2012: 138-149.
 Projects: Efficient Distributed Computation of Independent and Dominating Sets in Geometric Graphs funded by SERB (CRG); April 2021 – March 2024   
Present PhD Students
Mr. Ashish Saxena (Aug. 2021 -- till date)
Ms. Tanvir Kaur (Sept. 2020 to 23-April 2026)
Thesis Defense Title: Distributed Coverage and Search by Mobile Agents on Graphs
Ms. Nirmala Bhatt (Sept. 2021 -- till date)
Scroll to Top