Dabrowski, Konrad K.; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Rzążewski, Paweł Clique-width: harnessing the power of atoms. (English) Zbl 1526.05119 J. Graph Theory 104, No. 4, 769-810 (2023). MSC: 05C75 05C69 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., J. Graph Theory 104, No. 4, 769--810 (2023; Zbl 1526.05119) Full Text: DOI OA License
Lucke, Felicia; Paulusma, Daniël; Ries, Bernard Finding matching cuts in \(H\)-free graphs. (English) Zbl 07746799 Algorithmica 85, No. 10, 3290-3322 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{F. Lucke} et al., Algorithmica 85, No. 10, 3290--3322 (2023; Zbl 07746799) Full Text: DOI arXiv OA License
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Partitioning \(H\)-free graphs of bounded diameter. (English) Zbl 07575095 Theor. Comput. Sci. 930, 37-52 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. Brause} et al., Theor. Comput. Sci. 930, 37--52 (2022; Zbl 07575095) Full Text: DOI arXiv
Kern, Walter; Paulusma, Daniël Contracting to a longest path in \(H\)-free graphs. (English) Zbl 07765380 Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 22, 18 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{W. Kern} and \textit{D. Paulusma}, LIPIcs -- Leibniz Int. Proc. Inform. 181, Article 22, 18 p. (2020; Zbl 07765380) Full Text: DOI arXiv
Martin, Barnaby; Paulusma, Daniël; van Leeuwen, Erik Jan Disconnected cuts in claw-free graphs. (English) Zbl 1450.05073 J. Comput. Syst. Sci. 113, 60-75 (2020). MSC: 05C76 05C70 PDFBibTeX XMLCite \textit{B. Martin} et al., J. Comput. Syst. Sci. 113, 60--75 (2020; Zbl 1450.05073) Full Text: DOI Link
Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël Clique-width and well-quasi-ordering of triangle-free graph classes. (English) Zbl 1442.05184 J. Comput. Syst. Sci. 108, 64-91 (2020). MSC: 05C75 05C70 05C78 05C85 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., J. Comput. Syst. Sci. 108, 64--91 (2020; Zbl 1442.05184) Full Text: DOI
Martin, Barnaby; Paulusma, Daniël; van Leeuwen, Erik Jan Disconnected cuts in claw-free graphs. (English) Zbl 1524.05256 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 61, 14 p. (2018). MSC: 05C76 05C40 05C70 68Q25 PDFBibTeX XMLCite \textit{B. Martin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 61, 14 p. (2018; Zbl 1524.05256) Full Text: DOI arXiv
Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Manne, Fredrik; Paulusma, Daniël; Pilipczuk, Michał Modifying a graph using vertex elimination. (English) Zbl 1314.68232 Algorithmica 72, No. 1, 99-125 (2015). MSC: 68R10 05C76 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Algorithmica 72, No. 1, 99--125 (2015; Zbl 1314.68232) Full Text: DOI Link
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in claw-free graphs. (English) Zbl 1311.05090 SIAM J. Discrete Math. 29, No. 1, 348-375 (2015). MSC: 05C38 05C85 68R10 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., SIAM J. Discrete Math. 29, No. 1, 348--375 (2015; Zbl 1311.05090) Full Text: DOI arXiv Link
Belmonte, Rémy; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël Parameterized complexity of three edge contraction problems with degree constraints. (English) Zbl 1360.68489 Acta Inf. 51, No. 7, 473-497 (2014). MSC: 68Q25 05C76 68R10 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Acta Inf. 51, No. 7, 473--497 (2014; Zbl 1360.68489) Full Text: DOI Link
Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Increasing the minimum degree of a graph by contractions. (English) Zbl 1296.05185 Theor. Comput. Sci. 481, 74-84 (2013). MSC: 05C85 05C07 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 481, 74--84 (2013; Zbl 1296.05185) Full Text: DOI Link
Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Increasing the minimum degree of a graph by contractions. (English) Zbl 1352.68106 Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 67-79 (2012). MSC: 68Q25 05C12 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 7112, 67--79 (2012; Zbl 1352.68106) Full Text: DOI Link