10 citations · 37 across the 11 of their papers we have counts for
13 papers
Online Class Cover Problem
Minati De, Anil Maheshwari, Ratnadip Mandal
In this paper, we study the online class cover problem where a (finite or infinite) family of geometric objects and a set of red points in are…
Online Geometric Covering and Piercing
Minati De, Saksham Jain, Sarat Varma Kallepalli +1
We consider the online version of the piercing set problem, where geometric objects arrive one by one, and the online algorithm must maintain a valid piercing set for the already a…
Online Geometric Hitting Set and Set Cover Beyond Unit Balls in
Minati De, Ratnadip Mandal, Satyam Singh
We investigate the geometric hitting set problem in the online setup for the range space , where the set is a collection of points…
Online Dominating Set and Independent Set
Minati De, Sambhav Khurana, Satyam Singh
Finding minimum dominating set and maximum independent set for graphs in the classical online setup are notorious due to their disastrous lower bound of the competitive rati…
Variations of largest rectangle recognition amidst a bichromatic point set
Ankush Acharyya, Minati De, Subhas C. Nandy +1
Classical separability problem involving multi-color point sets is an important area of study in computational geometry. In this paper, we study different separability problems for…
Range Assignment of Base-Stations Maximizing Coverage Area without Interference
Ankush Acharyya, Minati De, Subhas C. Nandy +1
We study the problem of assigning non-overlapping geometric objects centered at a given set of points such that the sum of area covered by them is maximized. If the points are plac…