1. Kernelization algorithms for the vertex cover problem: theory and experiments;Abu-Khzam,2004
2. NP-hard graph problems and boundary classes of graphs;Alekseev;Theor. Comput. Sci.,2007
3. An optimal parallel solution for the path cover problem on P4-sparse graphs;Asdre;J. Parallel Distrib. Comput.,2007
4. On computing the dissociation number and the induced matching number of bipartite graphs;Boliac;Ars Comb.,2004
5. On the vertex k-path cover;Brešar;Discrete Appl. Math.,2013