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
Fabiański, Grzegorz; Pilipczuk, Michal; Siebertz, Sebastian; Toruńczyk, Szymon Progressive algorithms for domination and independence. (English) Zbl 07559136 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 27, 16 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{G. Fabiański} et al., LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 27, 16 p. (2019; Zbl 07559136) Full Text: DOI arXiv
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin Tight lower bounds for the complexity of multicoloring. (English) Zbl 1434.68186 Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 18, 14 p. (2017). MSC: 68Q17 05C15 05C60 PDFBibTeX XMLCite \textit{M. Bonamy} et al., LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 18, 14 p. (2017; Zbl 1434.68186) Full Text: DOI arXiv
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz Linear kernels for outbranching problems in sparse digraphs. (English) Zbl 1378.68063 Algorithmica 79, No. 1, 159-188 (2017). MSC: 68Q25 05C20 05C85 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Algorithmica 79, No. 1, 159--188 (2017; Zbl 1378.68063) 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
Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus S.; Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał A \(c^k n\) 5-approximation algorithm for treewidth. (English) Zbl 1333.05282 SIAM J. Comput. 45, No. 2, 317-378 (2016). MSC: 05C85 05C05 68R10 68W25 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., SIAM J. Comput. 45, No. 2, 317--378 (2016; Zbl 1333.05282) Full Text: DOI arXiv
Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve Exploring the subexponential complexity of completion problems. (English) Zbl 1347.68180 ACM Trans. Comput. Theory 7, No. 4, Article No. 14, 38 p. (2015). MSC: 68Q25 05C85 68Q17 PDFBibTeX XMLCite \textit{P. G. Drange} et al., ACM Trans. Comput. Theory 7, No. 4, Article No. 14, 38 p. (2015; Zbl 1347.68180) Full Text: DOI
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał A subexponential parameterized algorithm for proper interval completion. (English) Zbl 1330.68102 SIAM J. Discrete Math. 29, No. 4, 1961-1987 (2015). MSC: 68Q25 05C62 05C85 PDFBibTeX XMLCite \textit{I. Bliznets} et al., SIAM J. Discrete Math. 29, No. 4, 1961--1987 (2015; Zbl 1330.68102) Full Text: DOI
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