The motivation for writing this book came from our previous research works on sensor
coverage. They received a large number of citations and this number grows rapidly each …

Let P be a set of n weighted points. We study approximation algorithms for the following two
continuous facility-location problems. In the first problem we want to place m unit disks, for a …

We study approximation algorithms for the following geometric version of the maximum
coverage problem: Let P be a set of n weighted points in the plane. Let D represent a planar …

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 …

Let $ P $ be a set of points in the plane and let $ m $ be an integer. The goal of Max Cover
by Unit Disks problem is to place $ m $ unit disks whose union covers the maximum number …

We investigate three kinds of optimization problems regarding n points in the 2-dimensional
plane that need to be enclosed by squares.(1) Find a given number of squares that enclose …

Let P be a set of n points in the plane in general position such that its elements are colored
red or blue. We study the problem of finding two disjoint disks Dr and Db such that Dr covers …

This paper concerns a new optimization problem arising in the management of a multi-
object spectrometer with a configurable slit unit. The field of view of the spectrograph is …

Given a set P of red points and a set Q of blue points in the plane of total size n, we
investigate the problem of finding two disjoint isothetic rectangles containing all the points of …

Let P be the point set in two dimensional plane. In this paper, we consider the problem of
locating two isothetic unit squares such that together they cover maximum number of points …