Vladimir E. Alekseev On easy and hard hereditary classes of graphs with respect to the independent set problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:17-26 [Journal]
Victor P. Il'ev Hereditary systems and greedy-type algorithms. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:137-148 [Journal]
Vadim E. Levit, Eugen Mandrescu Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:163-174 [Journal]
Raffaele Mosca Some results on maximum stable sets in certain P5-free graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:175-183 [Journal]
G. Oriolo Clique family inequalities for the stable set polytope of quasi-line graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:185-201 [Journal]