1. Algorithmic Graph Theory and Perfect Graphs;Golumbic,1980
2. Approximation algorithms for hitting objects with straight lines;Hassin;Discrete Applied Mathematics,1991
3. S. Kovaleva, F.C.R. Spieksma, A generic primal–dual approximation algorithm for an interval packing and stabbing problem, in: Gonzalez [27] (Chapter 37).
4. A new multilayered pcp and the hardness of hypergraph vertex cover;Dinur;SIAM Journal on Computing,2005
5. Parameterized complexity of stabbing rectangles and squares in the plane;Dom,2009