5 citations · 8 across the 3 of their papers we have counts for
7 papers
Distributed Localization of Wireless Sensor Network Using Communication Wheel
Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary +1
We study the network localization problem, i.e., the problem of determining node positions of a wireless sensor network modeled as a unit disk graph. In an arbitrarily deployed net…
Complexity of Maximum Cut on Interval Graphs
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee +1
We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.
Arbitrary Pattern Formation by Opaque Fat Robots with Lights
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu +1
Arbitrary Pattern Formation is a widely studied problem in autonomous robot systems. The problem asks to design a distributed algorithm that moves a team of autonomous, anonymous a…
Positional Encoding by Robots with Non-Rigid Movements
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu +1
Consider a set of autonomous computational entities, called \emph{robots}, operating inside a polygonal enclosure (possibly with holes), that have to perform some collaborative tas…
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights
Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary +1
The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots are a…
Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu +1
The Arbitrary Pattern Formation problem asks to design a distributed algorithm that allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern gi…