24 citations · 40 across the 17 of their papers we have counts for
17 papers · 1 filter
Cops and Lethal Robber on Rings: A Distributed Perspective
Amanpreet Singh Saini, Ashish Saxena, Kaushik Mondal
The Cops and Robber game is extensively studied in the sequential setting where the main goal is to capture the robber. Capturing the robber means at least one cop, and the robber…
Semi-Synchronous Exploration in Dynamic Graphs
Ashish Saxena, Anisur Rahaman Molla, Kaushik Mondal +1
We study the fundamental problem of graph exploration in dynamic graphs using mobile agents. We consider -interval connected dynamic graphs, where the topology may change arbitr…
Black Hole Search: Dynamics, Distribution, and Emergence
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal +1
A black hole is a malicious node in a graph that destroys resources entering into it without leaving any trace. The problem of Black Hole Search (BHS) using mobile agents requires…
Exploration on Highly Dynamic Graphs
Ashish Saxena, Kaushik Mondal
We study the exploration problem by mobile agents in two prominent models of dynamic graphs: -Interval Connectivity and Connectivity Time. The -Interval Connectivity model wa…
Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
Ashish Saxena, Kaushik Mondal
In dynamic graphs, edges may be added or deleted in each synchronous round. Various connectivity models exist based on constraints on these changes. One well-known model is the …
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…
Balanced Dispersion on Time-Varying Dynamic Graphs
Ashish Saxena, Tanvir Kaur, Kaushik Mondal
We aim to connect two problems, namely, dispersion and load balancing. Both problems have already been studied over static as well as dynamic graphs. Though dispersion and load bal…
Optimal Dispersion of Silent Robots in a Ring
Bibhuti Das, Barun Gorain, Kaushik Mondal +2
Given a set of co-located mobile robots in an unknown anonymous graph, the robots must relocate themselves in distinct graph nodes to solve the dispersion problem. In this paper, w…
Black Hole Search in Dynamic Graphs
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal +1
A black hole is considered to be a dangerous node present in a graph that disposes of any resources that enter that node. Therefore, it is essential to find such a node in the grap…
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…
Byzantine Dispersion on Graphs
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
This paper considers the problem of Byzantine dispersion and extends previous work along several parameters. The problem of Byzantine dispersion asks: given robots, up to o…
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
The problem of dispersion of mobile robots on a graph asks that robots initially placed arbitrarily on the nodes of an -node anonymous graph, autonomously move to reach a fi…
Demand-Aware Network Designs of Bounded Degree
Chen Avin, Kaushik Mondal, Stefan Schmid
Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far f…
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…