Chudnovsky, Maria; King, Jason; Pilipczuk, Michał; Rzążewski, Paweł; Spirkl, Sophie Finding large \(H\)-colorable subgraphs in hereditary graph classes. (English) Zbl 1478.05048 SIAM J. Discrete Math. 35, No. 4, 2357-2386 (2021). Reviewer: Vahan Mkrtchyan (L’Aquila) MSC: 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., SIAM J. Discrete Math. 35, No. 4, 2357--2386 (2021; Zbl 1478.05048) Full Text: DOI arXiv
Novotná, Jana; Okrasa, Karolina; Pilipczuk, Michał; Rzążewski, Paweł; van Leeuwen, Erik Jan; Walczak, Bartosz Subexponential-time algorithms for finding large induced sparse subgraphs. (English) Zbl 1469.05159 Algorithmica 83, No. 8, 2634-2650 (2021). MSC: 05C85 05C42 05C60 68Q25 PDFBibTeX XMLCite \textit{J. Novotná} et al., Algorithmica 83, No. 8, 2634--2650 (2021; Zbl 1469.05159) Full Text: DOI arXiv
Grzesik, Andrzej; Klimošová, Tereza; Pilipczuk, Marcin; Pilipczuk, Michał Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs. (English) Zbl 1458.05194 Electron. J. Comb. 28, No. 1, Research Paper P1.29, 14 p. (2021). MSC: 05C69 05C70 05C75 05C85 68R10 PDFBibTeX XMLCite \textit{A. Grzesik} et al., Electron. J. Comb. 28, No. 1, Research Paper P1.29, 14 p. (2021; Zbl 1458.05194) Full Text: DOI arXiv
Chudnovsky, Maria; King, Jason; Pilipczuk, Michał; Rząėwski, Paweł; Spirkl, Sophie Finding large H-colorable subgraphs in hereditary graph classes. (English) Zbl 07651174 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 35, 17 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 35, 17 p. (2020; Zbl 07651174) Full Text: DOI
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
Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry Solving the 2-disjoint connected subgraphs problem faster than \(2^n\). (English) Zbl 1306.05125 Algorithmica 70, No. 2, 195-207 (2014). MSC: 05C40 05C60 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Cygan} et al., Algorithmica 70, No. 2, 195--207 (2014; Zbl 1306.05125) Full Text: DOI