3 citations · 4 across the 6 of their papers we have counts for
6 papers
Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
Tanvir Kaur, Barun Gorain, Kaushik Mondal
Distance-2-Dispersion (D-2-D) problem aims to disperse mobile agents starting from an arbitrary initial configuration on an anonymous port-labeled graph with nodes such…
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
Over the years, much research involving mobile computational entities has been performed. From modeling actual microscopic (and smaller) robots, to modeling software processes on a…
Distance-2-Dispersion: Dispersion with Further Constraints
Tanvir Kaur, Kaushik Mondal
The aim of the dispersion problem is to place a set of mobile robots in the nodes of an unknown graph consisting of nodes such that in the final configuration each…
Convergence of Even Simpler Robots without Location Information
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal +1
The design of distributed gathering and convergence algorithms for tiny robots has recently received much attention. In particular, it has been shown that convergence problems can…
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection
Debasish Pattanayak, Kaushik Mondal, H. Ramesh +1
There has been a wide interest in designing distributed algorithms for tiny robots. In particular, it has been shown that the robots can complete certain tasks even in the presence…
Designing Path Planning Algorithms for Mobile Anchor towards Range-Free Localization
Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal
Localization is one of the most important factor in wireless sensor networks as many applications demand position information of sensors. Recently there is an increasing interest o…