1. Proof verification and intractability of approximation problems;Arora;J. Assoc. Comput. Mach.,1998
2. Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties;Ausiello,1999
3. R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proc. Symposium on Discrete Algorithms, SODA’99, 1999, pp. 856–857.
4. Graphs and Hypergraphs;Berge,1973
5. On the approximation properties of independent set problem in degree 3 graphs;Berman,1995