Michał Pilipczuk

Jednostki:

Publikacje:

2.
Subexponential-time algorithms for finding large induced sparse subgraphs vol. 148 of Leibniz International Proceedings in Informatics (2019), "14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
1.
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs, (2019), "Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019", Society for Industrial and Applied Mathematics (SIAM)