( en | de | ru )

 

Disambiguation of "Pilipczuk, Marcin"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.

, , , , , , , , , , and . SODA, page 796-809. SIAM, (2021)

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

Marcin Wlodarski

Marcin Grzegorzek

Marcin Å0yszkiewicz

Marcin Siatkowski

 

Other publications of authors with the same name

Faster exponential-time algorithms in graphs of bounded average degree., and . Inf. Comput., (2015)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)The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs., , , , and . ISAAC, volume 181 of LIPIcs, page 59:1-59:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Sparse induced subgraphs in P6-free graphs., , , , and . SODA, page 5291-5299. SIAM, (2024)Induced subgraphs of bounded treewidth and the container method., , , , and . SODA, page 1948-1964. SIAM, (2021)Solving hard cut problems via flow-augmentation., , , and . SODA, page 149-168. SIAM, (2021)A tight quasi-polynomial bound for Global Label Min-Cut., , , , and . SODA, page 290-303. SIAM, (2023)Approximation and Kernelization for Chordal Vertex Deletion., and . SODA, page 1399-1418. SIAM, (2017)Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs., and . WG, volume 13453 of Lecture Notes in Computer Science, page 287-299. Springer, (2022)Exact Algorithms on Graphs of Bounded Average Degree.. Encyclopedia of Algorithms, (2016)