Funder
National Foundation for Science and Technology Development
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Alekseev, V.E.: On the local restrictions effect on the complexity of finding the graph independence number. In: Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University, pp. 3–13. Russian (1983)
2. Alekseev, V.E.: On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Appl. Math. 132(1–3), 17–26 (2004)
3. Brandstädt, A., Hammer, P.L.: A note on α-redundant vertices in graphs. Discrete Appl. Math. 108(3), 301–308 (2001)
4. Brandstädt, A., Hoàng, C. T.: On clique separators, nearly chordal graphs, and the maximum weight stable set problem. Theor. Comput. Sci. 389(1–2), 295–306 (2007)
5. Brandstädt, A., Giakoumakis, V.: Addendum to: Maximum weight independent sets in hole- and co-chair-free graphs. Inform. Process. Lett. 115(2), 345–350 (2015)