research
∙
04/09/2021
On the minimum spanning tree problem in imprecise set-up
In this article, we study the Euclidean minimum spanning tree problem in...
share
research
∙
09/22/2020
Discriminating Codes in Geometric Setups
We study two geometric variations of the discriminating code problem. In...
research
∙
09/14/2020
Sparsity of weighted networks: measures and applications
A majority of real life networks are weighted and sparse. The present ar...
research
∙
06/27/2020
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs
In this article, we study a generalized version of the maximum independe...
research
∙
09/20/2019
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63--74
In the paper "Linear time algorithm to cover and hit a set of line segme...
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
∙
05/13/2019
Color spanning Localized query
Let P be a set of n points and each of the points is colored with one of...
research
∙
09/14/2017
A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
This paper discusses the problem of covering and hitting a set of line s...
research
∙
05/25/2017
