1. Kernelization algorithms for the vertex cover problem: Theory and experiments;Abu-Khzam,2004
2. Branch-and-reduce exponential/fpt algorithms in practice: A case study of vertex cover;Akiba;Theoret. Comput. Sci.,2016
3. Finding maximum independent sets in sparse and general graphs, vol. 99;Beigel,1999
4. Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess;Cai;J. Artificial Intelligence Res.,2017
5. Cai, S., Lin, J., Su, K., 2015. Two weighting local search for minimum vertex cover. In: Twenty-Ninth Aaai Conference on Artificial Intelligence, pp. 1107–1113.