( en | de | ru )

 

Disambiguation of "Pilipczuk, Michal"

Author of the publication

copydeleteadd this publication to your clipboard
Simple and tight complexity lower bounds for solving Rabin games.

, , , , and . CoRR, (2023)

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 Pejko

Michal Olszewski

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)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)Dynamic Data Structures for Timed Automata Acceptance., , , , and . IPEC, volume 214 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Progressive Algorithms for Domination and Independence., , , and . STACS, volume 126 of LIPIcs, page 27:1-27:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An O(c^k n) 5-Approximation Algorithm for Treewidth., , , , , and . FOCS, page 499-508. IEEE Computer Society, (2013)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)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)