( en | de | ru )

 

Disambiguation of "Pilipczuk, Michal"

Author of the publication

copydeleteadd this publication to your clipboard
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth.

, , , , and . SODA, page 1419-1432. SIAM, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander Pilipczuk

Michal Olszewski

Michal Pejko

Michal Fic

Michal Novotny

 

Other publications of authors with the same name

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems., , , , and . ACM Trans. Algorithms, 16 (2): 25:1-25:31 (2020)Planar Digraphs., and . Classes of Directed Graphs, Springer, (2018)Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth., , , , and . ACM Trans. Algorithms, 14 (3): 34:1-34:45 (2018)Finding Large H-Colorable Subgraphs in Hereditary Graph Classes., , , , and . SIAM J. Discret. Math., 35 (4): 2357-2386 (2021)Integer Programming and Incidence Treedepth., , , , , and . CoRR, (2020)On the number of types in sparse graphs., , and . LICS, page 799-808. ACM, (2018)Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)., and . STACS, volume 25 of LIPIcs, page 542-553. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths., , and . SOSA, page 204-209. SIAM, (2021)An exponential time parameterized algorithm for planar disjoint paths., , , , and . STOC, page 1307-1316. ACM, (2020)A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)., , , and . SIAM J. Comput., 41 (4): 815-828 (2012)