Bodlaender, Hans L.; Brandstädt, Andreas; Kratsch, Dieter; Rao, Michaël; Spinrad, Jeremy On algorithms for (\(P_5\), gem)-free graphs. (English) Zbl 1086.68050 Theor. Comput. Sci. 349, No. 1, 2-21 (2005). MSC: 68Q25 05C85 05C70 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Theor. Comput. Sci. 349, No. 1, 2--21 (2005; Zbl 1086.68050) Full Text: DOI
Bodlaender, Hans; Kloks, Ton; Kratsch, Dieter Treewidth and pathwidth of permutation graphs. (English) Zbl 1418.68162 Lingas, Andrzej (ed.) et al., Automata, languages and programming. 20th international colloquium, ICALP 93, Lund, Sweden, July 5–9, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 700, 114-125 (1993). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{H. Bodlaender} et al., Lect. Notes Comput. Sci. 700, 114--125 (1993; Zbl 1418.68162) Full Text: DOI Link