( en | de | ru )

 

Disambiguation of "Pilipczuk, Michal"

Author of the publication

copydeleteadd this publication to your clipboard
Designing FPT Algorithms for Cut Problems Using Randomized Contractions.

, , , , and . FOCS, page 460-469. IEEE Computer Society, (2012)

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

Known algorithms for EDGE CLIQUE COVER are probably optimal, , and . CoRR, (2012)Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. CoRR, (2012)Subset feedback vertex set is fixed parameter tractable, , , and . CoRR, (2010)On Wideness and Stability., , and . CoRR, (2017)A Polynomial Kernel for Trivially Perfect Editing., and . CoRR, (2014)Model-Checking on Ordered Structures., , , , , , , , and . ACM Trans. Comput. Log., 21 (2): 11:1-11:28 (2020)Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth., , , , and . ACM Trans. Algorithms, 14 (3): 34:1-34:45 (2018)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)Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs., , and . Algorithmica, 82 (6): 1703-1739 (2020)