1. F.N. Abu-Khzam, R.L. Collins, M.R. Fellows, M.A. Langston, W.H. Sutters, C.T. Symons, Kernelization algorithms for the vertex cover problem: theory and experiments, in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, January 2004, pp. 62–69.
2. F.N. Abu-Khzam, M.A. Langston, W.H. Sutters, Fast, effective vertex cover kernelization: a tale of two algorithms, in: Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications, Cairo, Egypt, January 2005.
3. Regularizable graphs, Advances in graph theory;Berge;Ann. Discrete Math.,1978
4. On approximation properties of the indepenedent set problem for low degree graphs;Berman;Theory Comput. Systems,1999
5. On the number of vertices belonging to all maximum stable sets of a graph;Boros;Discrete Appl. Math.,2002