1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Arge, L., Italiano, G.F., Sedgewick, R. (eds.) Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004, pp. 62–69. SIAM (2004)
2. Cameron, K.: Induced matchings. Discret. Appl. Math. 24(1–3), 97–102 (1989)
3. Lecture Notes in Computer Science;B Chor,2004
4. Duckworth, W., Manlove, D.F., Zito, M.: On the approximability of the maximum induced matching problem. J. Discret. Algorithms 3(1), 79–91 (2005)
5. Golumbic, M.C., Laskar, R.C.: Irredundancy in circular arc graphs. Discret. Appl. Math. 44(1–3), 79–89 (1993)