Publisher
Springer Nature Switzerland
Reference20 articles.
1. Alekseev, V.E.: The effect of local constraints on the complexity of determination of the graph independence number. In: Combinatorial-Algebraic Methods in Applied Mathematics, pp. 3–13 (1982). (in Russian)
2. Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks 19(2), 247–253 (1989)
3. Bergougnoux, B., Papadopoulos, C., Telle, J.A.: Node Multiway Cut and Subset Feedback Vertex Set on graphs of bounded mim-width. Algorithmica 84(5), 1385–1417 (2022)
4. Brandstädt, A., Mosca, R.: Maximum Weight Independent Set for $$\ell $$claw-free graphs in polynomial time. Discrete Appl. Math. 237, 57–64 (2018)
5. Brettell, N., Johnson, M., Paesani, G., Paulusma, D.: Computing subset transversals in $${H}$$-free graphs. Theor. Comput. Sci. 902, 76–92 (2022)