| Demand-aware network designs of bounded degree C Avin, K Mondal, S Schmid Distributed Computing 33 (3), 311-325, 2020 | 67 | 2020 |
| Demand-aware network design with minimal congestion and route lengths C Avin, K Mondal, S Schmid IEEE INFOCOM 2019-IEEE Conference on Computer Communications, 1351-1359, 2019 | 46 | 2019 |
| Byzantine Dispersion on Graphs AR Molla, K Mondal, WK Moses Jr arXiv preprint arXiv:2102.07528, 2021 | 23 | 2021 |
| Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots AR Molla, K Mondal, WK Moses International Symposium on Algorithms and Experiments for Sensor Systems …, 2020 | 22 | 2020 |
| Burning Grids and Intervals AT Gupta, SA Lokhande, K Mondal Conference on Algorithms and Discrete Applied Mathematics, 66-79, 2021 | 21* | 2021 |
| Gathering of mobile robots with weak multiplicity detection in presence of crash-faults D Pattanayak, K Mondal, H Ramesh, PS Mandal Journal of Parallel and Distributed Computing 123, 145-155, 2019 | 19 | 2019 |
| Path planning algorithms for mobile anchors towards range-free localization K Mondal, A Karmakar, PS Mandal Journal of Parallel and Distributed Computing 97, 35-46, 2016 | 14* | 2016 |
| Distance-2-Dispersion: Dispersion with Further Constraints T Kaur, K Mondal arXiv preprint arXiv:2301.04938, 2023 | 11 | 2023 |
| Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots AR Molla, K Mondal, WK Moses Jr Theoretical Computer Science, 2021 | 11 | 2021 |
| Dynamically optimal self-adjusting single-source tree networks C Avin, K Mondal, S Schmid Latin American Symposium on Theoretical Informatics, 143-154, 2021 | 10* | 2021 |
| Collaborative Dispersion by Silent Robots B Gorain, PS Mandal, K Mondal, S Pandit arXiv preprint arXiv:2202.05710, 2022 | 9 | 2022 |
| Fault-tolerant gathering of mobile robots with weak multiplicity detection D Pattanayak, K Mondal, H Ramesh, PS Mandal proceedings of the 18th international conference on distributed computing …, 2017 | 9 | 2017 |
| Push-Down Trees: Optimal Self-Adjusting Complete Trees C Avin, K Mondal, S Schmid IEEE/ACM Transactions on Networking, 2022 | 7 | 2022 |
| Pebble guided optimal treasure hunt in anonymous graphs B Gorain, K Mondal, H Nayak, S Pandit Theoretical Computer Science, 2022 | 6 | 2022 |
| Path Planning Algorithm for Mobile Anchor in Connected Sensor Networks K Mondal, A Karmakar, PS Mandal International Conference on Distributed Computing and Internet Technology …, 2015 | 5 | 2015 |
| Localization in presence of multipath effect in wireless sensor networks K Mondal, PS Mandal, BP Sinha International Conference on Wired/Wireless Internet Communications, 138-149, 2012 | 5 | 2012 |
| Distance-2-Dispersion with Termination by a Strong Team B Gorain, T Kaur, K Mondal Conference on Algorithms and Discrete Applied Mathematics, 44-58, 2024 | 3 | 2024 |
| Burning and w-burning of geometric graphs B Gorain, AT Gupta, SA Lokhande, K Mondal, S Pandit Discrete Applied Mathematics 336, 83-98, 2023 | 3 | 2023 |
| Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots AR Molla, K Mondal, WK Moses Jr arXiv preprint arXiv:2305.01753, 2023 | 3 | 2023 |
| Range-Free Mobile Sensor Localization and a Novel Obstacle Detection Technique K Mondal, PS Mandal Wireless Personal Communications 92 (2), 351-380, 2017 | 3 | 2017 |
Partha Sarathi MandalProfessor of Computer Science, Indian Institute of Technology Guwahati, India.iitg.ac.in의 이메일 확인됨
