1. Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover;Akiba;Theoretical Computer Science,2016
2. Bäck, T., & Khuri, S. (1994). An Evolutionary Heuristic for the Maximum Independent Set Problem. In Proceedings of the first IEEE conference on evolutionary computation. IEEE World Congress on Computational Intelligence (pp. 531–535). Orlando, FL, USA: IEEE. doi: 10.1109/ICEC.1994.350004.
3. Cai, S. (2015). Balance between complexity and quality: Local search for minimum vertex cover in massive graphs. In Proceedings of the twenty-fourth international joint conference on artificial intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25–31, 2015 (pp. 747–753).
4. Cai, S., Su, K., & Chen, Q. (2010). EWLS: A new local search for minimum vertex cover. In Proceedings of the twenty-fourth AAAI conference on artificial intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010.
5. Cai, S., Lin, J., & Su, K. (2015). Two weighting local search for minimum vertex cover. In Proceedings of the twenty-ninth AAAI conference on artificial intelligence, January 25-30, 2015, Austin, Texas, USA (pp. 1107–1113).