Diner, Öznur Yaşar; Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard Contraction and deletion blockers for perfect graphs and \(H\)-free graphs. (English) Zbl 1400.68087 Theor. Comput. Sci. 746, 49-72 (2018). MSC: 68Q25 05C17 05C75 PDFBibTeX XMLCite \textit{Ö. Y. Diner} et al., Theor. Comput. Sci. 746, 49--72 (2018; Zbl 1400.68087) Full Text: DOI arXiv
Diner, Öznur Yaşar; Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard Contraction blockers for graphs with forbidden induced paths. (English) Zbl 1459.68156 Paschos, Vangelis Th. (ed.) et al., Algorithms and complexity. 9th international conference, CIAC 2015, Paris, France, May 20–22, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9079, 194-207 (2015). MSC: 68R10 68Q17 68Q25 PDFBibTeX XMLCite \textit{Ö. Y. Diner} et al., Lect. Notes Comput. Sci. 9079, 194--207 (2015; Zbl 1459.68156) Full Text: DOI Link
Heggernes, Pinar; Van ’t Hof, Pim; Paulusma, Daniël Computing role assignments of proper interval graphs in polynomial time. (English) Zbl 1247.05240 J. Discrete Algorithms 14, 173-188 (2012). MSC: 05C85 68W40 PDFBibTeX XMLCite \textit{P. Heggernes} et al., J. Discrete Algorithms 14, 173--188 (2012; Zbl 1247.05240) Full Text: DOI
Fiala, Jiří; Kamiński, Marcin; Lidický, Bernard; Paulusma, Daniël The \(k\)-in-a-path problem for claw-free graphs. (English) Zbl 1236.68088 Algorithmica 62, No. 1-2, 499-519 (2012). MSC: 68Q17 05C85 PDFBibTeX XMLCite \textit{J. Fiala} et al., Algorithmica 62, No. 1--2, 499--519 (2012; Zbl 1236.68088) Full Text: DOI
van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël Finding induced paths of given parity in claw-free graphs. (English) Zbl 1236.68101 Algorithmica 62, No. 1-2, 537-563 (2012). MSC: 68Q17 05C38 05C85 PDFBibTeX XMLCite \textit{P. van 't Hof} et al., Algorithmica 62, No. 1--2, 537--563 (2012; Zbl 1236.68101) Full Text: DOI Link
Heggernes, Pinar; van ’t Hof, Pim; Paulusma, Daniël Computing role assignments of proper interval graphs in polynomial time. (English) Zbl 1326.68159 Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26–28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 167-180 (2011). MSC: 68Q25 05C62 05C85 PDFBibTeX XMLCite \textit{P. Heggernes} et al., Lect. Notes Comput. Sci. 6460, 167--180 (2011; Zbl 1326.68159) Full Text: DOI Link