research
∙
02/11/2022
Collaborative Dispersion by Silent Robots
In the dispersion problem, a set of k co-located mobile robots must relo...
share
research
∙
03/10/2021
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
We study the problem of treasure hunt in a graph by a mobile agent. The ...
research
∙
09/09/2019
Balanced Connected Subgraph Problem in Geometric Intersection Graphs
We study the Balanced Connected Subgraph(shortly, BCS) problem on geomet...
research
∙
05/17/2019
Variations of largest rectangle recognition amidst a bichromatic point set
Classical separability problem involving multi-color point sets is an im...
research
∙
09/24/2018
The Balanced Connected Subgraph Problem
The problem of computing induced subgraphs that satisfy some specified r...
research
∙
09/19/2018
