
Dr. Kaushik Mondal
Assistant Professor
- Department of Mathematics
- Indian Institute of Technology Ropar
- Rupnagar, Punjab - 140001, India
- Office: C-M17, Mezzanine Floor, SAB building
- Email : kaushik.mondal@iitrpr.ac.in
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
1. 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)
2. Chen Avin, Kaushik Mondal, Stefan Schmid, “Demand-Aware Network Design of Bounded Degree”, Distributed Computing (Springer), 33: 311-325 (2020))
3. 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)
4. 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
6. 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
7. 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
8. 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
9. 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.
Â
Dblp link:Â https://dblp.org/pid/62/11365.html
Google scholar link:Â https://scholar.google.co.il/citations?user=B8X0B8YAAAAJ&hl=en
Â
- PhD students: Ms. Tanvir Kaur (Sept. 2020 —Â ), Mr. Ashish Saxena (Aug. 2021 — )
- Project students: Ms. Nirmala Bhatt (Sept. 2021 — )Â
 Projects: Efficient Distributed Computation of Independent and Dominating Sets in Geometric Graphs funded by SERB (CRG); April 2021 – March 2024 Â