( en | de | ru )

 

Disambiguation of "Pilipczuk, Marcin"

Author of the publication

copydeleteadd this publication to your clipboard
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs.

, , and . SIAM J. Discret. Math., 35 (4): 2387-2429 (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 Å0yszkiewicz

Marcin Grzegorzek

Marcin Wlodarczak

 

Other publications of authors with the same name

Excluding Hooks and their Complements., , , , and . Electron. J. Comb., 25 (3): 3 (2018)Two lower bounds for $p$-centered colorings., , , , and . Discret. Math. Theor. Comput. Sci., (2020)A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs., , and . SIAM J. Discret. Math., 35 (4): 2387-2429 (2021)On Weighted Graph Separation Problems and Flow Augmentation., , , , and . SIAM J. Discret. Math., 38 (1): 170-189 (March 2024)Hardness of Metric Dimension in Graphs of Constant Treewidth., and . Algorithmica, 84 (11): 3110-3155 (2022)Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n., , , and . Algorithmica, 70 (2): 195-207 (2014)Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation., and . ACM Journal of Experimental Algorithmics, 24 (1): 2.7:1-2.7:18 (2019)Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs., , and . ICALP, volume 55 of LIPIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Approximation and Kernelization for Chordal Vertex Deletion., and . SIAM J. Discret. Math., 32 (3): 2258-2301 (2018)Known algorithms for EDGE CLIQUE COVER are probably optimal, , and . CoRR, (2012)