( en | de | ru )

 

Disambiguation of "Pilipczuk, Michal"

Author of the publication

copydeleteadd this publication to your clipboard
On Directed Feedback Vertex Set Parameterized by Treewidth.

, , , , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 65-78. Springer, (2018)

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

Sparse induced subgraphs in P6-free graphs., , , , and . SODA, page 5291-5299. SIAM, (2024)A Polynomial Kernel for Trivially Perfect Editing., and . ESA, volume 9294 of Lecture Notes in Computer Science, page 424-436. Springer, (2015)Computing Treedepth in Polynomial Space and Linear FPT Time., , and . ESA, volume 244 of LIPIcs, page 79:1-79:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)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)Reachability for Bounded Branching VASS., and . CONCUR, volume 140 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)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)