Golovach, Petr A.; Komusiewicz, Christian; Kratsch, Dieter; Le, Van Bang Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. (English) Zbl 1479.68002 J. Comput. Syst. Sci. 123, 76-102 (2022). Reviewer: Arne Meier (Hannover) MSC: 68Q27 05C70 05C85 68R05 68R10 68W05 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 123, 76--102 (2022; Zbl 1479.68002) Full Text: DOI arXiv
Komusiewicz, Christian; Kratsch, Dieter; Le, Van Bang Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms. (English) Zbl 1442.05224 Discrete Appl. Math. 283, 44-58 (2020). MSC: 05C85 05C70 68Q17 68Q27 PDFBibTeX XMLCite \textit{C. Komusiewicz} et al., Discrete Appl. Math. 283, 44--58 (2020; Zbl 1442.05224) Full Text: DOI Link
Komusiewicz, Christian; Kratsch, Dieter; Van Bang Le Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms. (English) Zbl 1516.68067 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 19, 13 p. (2019). MSC: 68R10 05C70 05C85 68Q17 68Q27 PDFBibTeX XMLCite \textit{C. Komusiewicz} et al., LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 19, 13 p. (2019; Zbl 1516.68067) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Sayadi, Mohamed Yosri Enumeration and maximum number of maximal irredundant sets for chordal graphs. (English) Zbl 1416.05267 Discrete Appl. Math. 265, 69-85 (2019). MSC: 05C85 05C30 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Discrete Appl. Math. 265, 69--85 (2019; Zbl 1416.05267) Full Text: DOI
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony Computing square roots of graphs with low maximum degree. (English) Zbl 1395.05083 Discrete Appl. Math. 248, 93-101 (2018). MSC: 05C31 05C07 05C35 PDFBibTeX XMLCite \textit{M. Cochefert} et al., Discrete Appl. Math. 248, 93--101 (2018; Zbl 1395.05083) Full Text: DOI arXiv Link
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony A linear kernel for finding square roots of almost planar graphs. (English) Zbl 1372.05052 Theor. Comput. Sci. 689, 36-47 (2017). MSC: 05C10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 689, 36--47 (2017; Zbl 1372.05052) Full Text: DOI arXiv Link
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony Finding cactus roots in polynomial time. (English) Zbl 1391.68051 Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44542-7/pbk; 978-3-319-44543-4/ebook). Lecture Notes in Computer Science 9843, 361-372 (2016). MSC: 68Q25 05C76 68R10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 9843, 361--372 (2016; Zbl 1391.68051) Full Text: DOI Link
Kratsch, Dieter; Le, Van Bang Algorithms solving the matching cut problem. (English) Zbl 1331.68109 Theor. Comput. Sci. 609, Part 2, 328-335 (2016). MSC: 68Q25 05C69 05C70 05C85 PDFBibTeX XMLCite \textit{D. Kratsch} and \textit{V. B. Le}, Theor. Comput. Sci. 609, Part 2, 328--335 (2016; Zbl 1331.68109) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël Detecting induced minors in AT-free graphs. (English) Zbl 1296.05183 Theor. Comput. Sci. 482, 20-32 (2013). MSC: 05C83 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 482, 20--32 (2013; Zbl 1296.05183) Full Text: DOI