1. M. Garry, D. Johnson, Computers and Intractability: A User Guide to the Theory of NP Completeness (San Francisco, 1979)
2. P.S. Oliveto, X. Yao, J. He, Analysis of Population-based Evolutionary Algorithms for the Vertex Cover Problem (IEEE, 2008), pp. 1563–1570
3. L. Ding, B. Gu, X. Hong, B. Dixon, Articulation node based routing in delay tolerant networks, in IEEE International Conference (2009), pp. 1–6
4. Y. Zeng, D. Wang, W. Liu, A. Xiong, An approximation algorithm for weak vertex cover problem in IP network traffic measurement, IEEE International Conference (2009), pp. 182–186
5. J. Chen, I.A. Kanj, G. Xia, Improved parameterized upper bounds for vertex cover. 31st International Conference on Mathematical Foundations of Computer Science (2006)