We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...