1. Abu-Khzam F, Collins R, Fellows M, Langston M, Suters W, Symons C (2004) Kernelization algorithms for the vertex cover problem: theory and experiments. In: Proceedings of the workshop on algorithm engineering and experiments (NLENEX), pp 62–69
2. Cheetham J, Dehne F, Rau-Chaplin A, Stege U, Taillon P (2003) Solving large FPT problems on coarse grained parallel machines. J Comput Syst Sci 67:691–706
3. Chen J, Kanj IA, Jia W (2001) Vertex cover: further observations and further improvements. J Algorithm 41:280–301
4. Chen J, Kanj IA, Xia G (2006) Improved parameterized upper bounds for vertex cover. In: MFCS 2006. Lecture notes in computer science, vol 4162. Springer, Berlin, pp 238–249
5. Fellows M (2001) Parameterized complexity: the main ideas and some research frontiers. In: ISAAC 2001. Lecture notes in computer science, vol 2223. Springer, Berlin, pp 291–307