Computational geometry: an introduction
Computational geometry: an introduction
Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Geometric Separator Theorems and Applications
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Convex polygon intersection graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Hi-index | 0.89 |
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^l^o^g^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). lanar).