Chudnovsky, Maria; Pilipczuk, Marcin; Pilipczuk, Michał; Thomassé, Stéphan Quasi-polynomial time approximation schemes for the maximum weight independent set problem in \(H\)-free graphs. (English) Zbl 07810343 SIAM J. Comput. 53, No. 1, 47-86 (2024). MSC: 68R10 05C69 05C85 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., SIAM J. Comput. 53, No. 1, 47--86 (2024; Zbl 07810343) Full Text: DOI
Pilipczuk, Michał; Sokołowski, Marek Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded. (English) Zbl 1509.05078 J. Comb. Theory, Ser. B 161, 382-406 (2023). MSC: 05C15 05C31 05C85 PDFBibTeX XMLCite \textit{M. Pilipczuk} and \textit{M. Sokołowski}, J. Comb. Theory, Ser. B 161, 382--406 (2023; Zbl 1509.05078) Full Text: DOI arXiv
Bożyk, Łukasz; Pilipczuk, Michał On the Erdős-Pósa property for immersions and topological minors in tournaments. (English) Zbl 1515.05142 Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 12, 16 p. (2022). MSC: 05C70 05C20 05C83 PDFBibTeX XMLCite \textit{Ł. Bożyk} and \textit{M. Pilipczuk}, Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 12, 16 p. (2022; Zbl 1515.05142) Full Text: DOI arXiv
Bonamy, Marthe; Bousquet, Nicolas; Pilipczuk, Michał; Rzążewski, Paweł; Thomassé, Stéphan; Walczak, Bartosz Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs. (English) Zbl 1478.05047 J. Comb. Theory, Ser. B 152, 353-378 (2022). MSC: 05C15 05C75 05C35 05C60 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Comb. Theory, Ser. B 152, 353--378 (2022; Zbl 1478.05047) Full Text: DOI arXiv
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
Briański, Marcin; Micek, Piotr; Pilipczuk, Michał; Seweryn, Michał T. Erdös-Hajnal properties for powers of sparse graphs. (English) Zbl 1460.05103 SIAM J. Discrete Math. 35, No. 1, 447-464 (2021). MSC: 05C42 05C15 05C83 PDFBibTeX XMLCite \textit{M. Briański} et al., SIAM J. Discrete Math. 35, No. 1, 447--464 (2021; Zbl 1460.05103) 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
Chudnovsky, Maria; Pilipczuk, Marcin; Pilipczuk, Michał; Thomassé, Stéphan On the maximum weight independent set problem in graphs without induced cycles of length at least five. (English) Zbl 1459.05234 SIAM J. Discrete Math. 34, No. 2, 1472-1483 (2020). MSC: 05C69 05C75 05C85 05C17 05C12 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., SIAM J. Discrete Math. 34, No. 2, 1472--1483 (2020; Zbl 1459.05234) Full Text: DOI arXiv
Kwon, O-joung; Pilipczuk, Michał; Siebertz, Sebastian On low rank-width colorings. (English) Zbl 1428.05110 Eur. J. Comb. 83, Article ID 103002, 17 p. (2020). MSC: 05C15 PDFBibTeX XMLCite \textit{O-j. Kwon} et al., Eur. J. Comb. 83, Article ID 103002, 17 p. (2020; Zbl 1428.05110) Full Text: DOI
Fomin, Fedor V.; Pilipczuk, Michał On width measures and topological problems on semi-complete digraphs. (English) Zbl 1415.05063 J. Comb. Theory, Ser. B 138, 78-165 (2019). MSC: 05C20 05C12 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{M. Pilipczuk}, J. Comb. Theory, Ser. B 138, 78--165 (2019; Zbl 1415.05063) Full Text: DOI Link
Giannopoulou, Archontia C.; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin Cutwidth: obstructions and algorithmic aspects. (English) Zbl 1414.68035 Algorithmica 81, No. 2, 557-588 (2019). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{A. C. Giannopoulou} et al., Algorithmica 81, No. 2, 557--588 (2019; Zbl 1414.68035) Full Text: DOI
Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; van Leeuwen, Erik Jan; Wrochna, Marcin Polynomial kernelization for removing induced claws and diamonds. (English) Zbl 1368.68222 Theory Comput. Syst. 60, No. 4, 615-636 (2017). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{M. Cygan} et al., Theory Comput. Syst. 60, No. 4, 615--636 (2017; Zbl 1368.68222) Full Text: DOI arXiv
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve Largest chordal and interval subgraphs faster than \(2^n\). (English) Zbl 1347.05236 Algorithmica 76, No. 2, 569-594 (2016). MSC: 05C85 05C35 05C60 68Q25 PDFBibTeX XMLCite \textit{I. Bliznets} et al., Algorithmica 76, No. 2, 569--594 (2016; Zbl 1347.05236) Full Text: DOI arXiv
Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; van Leeuwen, Erik Jan; Wrochna, Marcin Polynomial kernelization for removing induced claws and diamonds. (English) Zbl 1362.68104 Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer (ISBN 978-3-662-53173-0/pbk; 978-3-662-53174-7/ebook). Lecture Notes in Computer Science 9224, 440-455 (2016). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{M. Cygan} et al., Lect. Notes Comput. Sci. 9224, 440--455 (2016; Zbl 1362.68104) Full Text: DOI Link
Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał On group feedback vertex set parameterized by the size of the cutset. (English) Zbl 1336.68121 Algorithmica 74, No. 2, 630-642 (2016). MSC: 68Q25 05C35 05C78 05C85 PDFBibTeX XMLCite \textit{M. Cygan} et al., Algorithmica 74, No. 2, 630--642 (2016; Zbl 1336.68121) Full Text: DOI arXiv
Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał Preprocessing subgraph and minor problems: when does a small vertex cover help? (English) Zbl 1277.68095 J. Comput. Syst. Sci. 80, No. 2, 468-495 (2014). MSC: 68Q25 05C85 05C70 05C15 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 80, No. 2, 468--495 (2014; Zbl 1277.68095) Full Text: DOI arXiv
Cygan, Marek; Philip, Geevarghese; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry Dominating set is fixed parameter tractable in claw-free graphs. (English) Zbl 1228.68030 Theor. Comput. Sci. 412, No. 50, 6982-7000 (2011). MSC: 68Q17 05C69 PDFBibTeX XMLCite \textit{M. Cygan} et al., Theor. Comput. Sci. 412, No. 50, 6982--7000 (2011; Zbl 1228.68030) Full Text: DOI arXiv