1. Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theor Comput Sci 237(1):123–134
2. Auyeung A, Abraham A (2004) The largest compatible subset problem for phylogenetic data, genetic and evolutionary computation 2004 conference (GECCO-2004), bird-of-a-feather workshop on application of hybrid evolutionary algorithms to complex optimization problems. Springer, Berlin, pp 1–11
3. Babar ME, Pervez MT, Nadeem A, Hussain T, Aslam N (2014) Multiple sequence alignment tools: assessing performance of the underlying algorithms. J Appl Environ Biol Sci 4(8S):76–80
4. Chen J, Kanj IA, Xia G (2010) Improved upper bounds for vertex cover. Theor Comput Sci 411:3736–3756
5. Chen J, Lin Y, Li J, Lin G, Ma Z, Tan A (2016) A rough set method for the minimum vertex cover problem of graphs”. Appl Soft Comput 42:360–367