Heterogeneous sensor networks (HSNs) comprise of different types of sensors with varying
range and sensing quality. Coverage is one of the most important performance metrics for …

In the barrier resilience problem (introduced by Kumar et al., Wireless Networks 2007), we
are given a collection of regions of the plane, acting as obstacles, and we would like to …

Various notions of coverage have been introduced as basic quality-of-service measures for
wireless sensor networks. One natural measure of coverage is referred to as resilience …

We study the following separation problem: Given n connected curves and two points s and t
in the plane, compute the minimum number of curves one needs to retain so that any path …

Let G be a graph with zero or more colours assigned to its vertices, and let vs and vt be two
vertices of G. The minimum-colour path problem is to determine the minimum over all vs–vt …

Given a set of obstacles and two points, is there a path between the two points that does not
cross more than $ k $ different obstacles? This is a fundamental problem that has …

The coverage of a wireless sensor network is a measure of the quality of service. One type of
coverage is k-barrier coverage. Given a starting region S and an ending region T, we say …

Deploying wireless sensor networks (WSN) along a barrier line to provide surveillance
against illegal intruders is a fundamental sensor-allocation problem. To maximize the …

We study the complexity of some problems of the following type: Given a set of straight-line
segments in the plane and a set of cells in the induced arrangement, compute the minimum …

The minimum constraint removal problem seeks to find the minimum number of constraints,
ie, obstacles, that need to be removed to connect a start to a goal location with a collision …