Given a set of n non-intersecting line segments L and a set Q of m points in R 2; we present
algorithms of the discrete two-center problem for (i) covering,(ii) stabbing and (iii) hitting the …

We study the problem of partitioning a given simple polygon P into a minimum number of
connected polygonal pieces, each of bounded size. We describe a general technique for …

In this paper, we consider a coverage problem for uncertain points in a tree. Let T be a tree
containing a set PP of n (weighted) demand points, and the location of each demand point …

This paper discusses the problem of covering and hitting a set of line segments L in R 2 by a
pair of axis-parallel congruent squares of minimum size. We also discuss the restricted …

We study three covering problems in the plane. Our original motivation for these problems
come from trajectory analysis. The first is to decide whether a given set of line segments can …

In this dissertation, we study several facility location problems on uncertain data. We mainly
consider the k-center problem and many of its variations. These are classical problems in …

We study three covering problems in the plane. Our original motivation for these problems
comes from trajectory analysis. The first is to decide whether a given set of line segments …

Cormen et al.[21] describe a polygon as a piecewise-linear closed curves in the plane. That
is, it is a curve that ends on itself which consists of a sequence of straight line segments …

We first consider the weighted p-center problem, in which the centers are constrained to lie
on two axis-parallel lines. Given a set of n points in the plane, which are sorted according to …