Raman, Venkatesh; Saurabh, Saket Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles. (English) Zbl 1170.68019 Algorithmica 52, No. 2, 203-225 (2008). MSC: 68Q15 05C38 05C69 05C85 68Q17 68W25 × Cite Format Result Cite Review PDF Full Text: DOI
Lozin, Vadim Boundary classes of planar graphs. (English) Zbl 1166.05016 Comb. Probab. Comput. 17, No. 2, 287-295 (2008). MSC: 05C85 05C69 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Mosca, Raffaele Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs. (English) Zbl 1127.05098 Discrete Math. 308, No. 1, 20-33 (2008). MSC: 05C85 05C70 05C69 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Mosca, Raffaele Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs. (English) Zbl 1141.05068 Eur. J. Oper. Res. 184, No. 3, 849-859 (2008). MSC: 05C69 05C85 × Cite Format Result Cite Review PDF Full Text: DOI