( en | de | ru )

 

Disambiguation of "Pilipczuk, Michal"

Author of the publication

copydeleteadd this publication to your clipboard
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.

, , , , and . SOSA, page 279-285. SIAM, (2024)

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 Novotny

Michal Fic

 

Other publications of authors with the same name

Planar Digraphs., and . Classes of Directed Graphs, Springer, (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)On the number of types in sparse graphs., , and . LICS, page 799-808. ACM, (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)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)