1. Constrained hitting set problem with intervals;Acharyya,2021
2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
3. Optimal packing and covering in the plane are NP-complete;Fowler;Inf. Process. Lett.,1981
4. Algorithm Design;Kleinberg,2006
5. Structure preserving reductions among convex optimization problems;Ausiello;J. Comput. Syst. Sci.,1980