1. V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, in: Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University, 1983, pp. 3–13 (in Russian).
2. Complete description of forbidden subgraphs in the structural domination problem;Bacsó;Discrete Math.,2009
3. Dominating cliques in P5-free graphs;Bacsó;Priod. Math. Hungar.,1990
4. H. Bodlaender, L. Cai, J. Chen, M. Fellow, J. Telle, D. Marx, Open Problems in parameterized and exact computation — IWPEC 2006, Technical Report UU-CS-2006-052, Department of Information and Computing Sciences, Utrecht University, The Netherlands, 2006.
5. F. Fomin, F. Grandoni, D. Kratsch, Measure and conquer: A simple O(20.288n) independent set algorithm, in: Proc. 17th ACM–SIAM Symp. on Discrete Algorithms, SODA’2006, 2006, pp. 18–25.