This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

We consider the set multicover problem in geometric settings. Given a set of points P and a
collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F …

Multi-core processors are increasingly becoming popular even in safety-critical applications,
and the compliance of such systems with functional safety standards is thus mandatory. The …

We show that there is no $(1+\eps) $-approximation algorithm for the problem of covering
points in the plane by minimum number of fat triangles of similar size (with the minimum …

The problem of optimal camera placement (OCP) is the objective today, to identify the
configurations of camera networks that optimize the area of interest under a set of …

We consider variants of the art gallery problem where guard visibility is limited to a certain
angular aperture α. We show that the problem is NP-hard even when guards can be located …

Art gallery problem has been extensively studied by computational geometry, where major
issue was to find the minimum number of guards and their locations to watch inside an art …

We consider a novel class of art gallery problems inspired by wireless localization. Given a
simple polygon P, place and orient guards each of which broadcasts a unique key within a …

Abstract Art gallery problems have been extensively studied over the last decade and have
found different type of applications. Normally the number of sides of a polygon or the general …

Given a set S of regions with piece-wise linear boundary and a positive angle α< 90, we
consider the problem of computing the locations and orientations of the minimum number of …