On arrangements of Jordan arcs with three intersections per pair

On the Complexity of the Union of Geometric Objects

JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry

Improved approximation algorithms for geometric set cover

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry

Small-size ε-nets for axis-parallel rectangles and boxes

Proceedings of the forty-first annual ACM symposium on Theory of computing

Near-linear approximation algorithms for geometric hitting sets

Proceedings of the twenty-fifth annual symposium on Computational geometry

Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes

SIAM Journal on Computing