We consider several classes of intersection graphs of line segments in the plane and prove
new equality and separation results between those classes. In particular, we show that …

Given a set of nn axis-parallel rectangles in the plane, finding a maximum independent set
(MIS MIS), a maximum weighted independent set (WMIS WMIS), and a minimum hitting set …

We study subclasses of grid intersection graphs from the perspective of order dimension. We
show that partial orders of height two whose comparability graph is a grid intersection graph …

Given a set of n axis-parallel rectangles in the plane, finding a maximum independent set
(MIS), amaximumweighted independent set (WMIS), and aminimum hitting set (MHS), are …

A Stick graph is an intersection graph of axis-aligned segments such that the left end-points
of the horizontal segments and the bottom end-points of the vertical segments lie on a …

In this note, we present a simple combinatorial factor 6 algorithm for approximating the
minimum hitting set of a family R={R 1,…, R n} of axis-parallel rectangles in the plane such …

The problem of economically improving a network to meet given survivability requirements
occurs in a number of areas. A straightforward problem of this type is concerned with …

Let S be a point set in the plane such that each of its elements is colored either red or blue. A
matching of S with rectangles is any set of pairwise-disjoint axis-aligned closed rectangles …

In this thesis, we consider several aspects of representations of graphs in the plane. We
consider mainly intersection and visibility representations of graphs. In both kind of …

We study the minimum Manhattan network problem, which is defined as follows. Given a set
of points called terminals in R^d, find a minimum-length network such that each pair of …