1. On the local restriction effect on the complexity of finding the graph independence number;Alekseev,1983
2. On the number of maximal independent sets in graphs from hereditary classes;Alekseev,1991
3. A polynomial algorithm for finding largest independent sets in fork-free graphs;Alekseev;Discrete Anal. Oper. Res.,1999
4. A polynomial algorithm for finding largest independent sets in fork-free graphs;Alekseev;Discrete Anal. Oper. Res.,1999
5. On easy and hard hereditary classes of graphs with respect to the independent set problem;Alekseev;Discrete Appl. Math.,2004