A note on maximum independent set and related problems on box graphs

Abstract

A box graph is the intersection graph of orthogonal rectangles in the plane. We show that maximum independent set and minimum vertex cover on box graphs can be solved in subexponential time, more precisely, in time 2 O ( n log n ) , by applying Miller's simple cycle planar separator theorem [J. Comput. System Sci. 32 (1986) 265–279] (in spite of the fact that the input box graph might be strongly non-planar).