( en | de | ru )

 

Disambiguation of "Pilipczuk, Marcin"

Author of the publication

copydeleteadd this publication to your clipboard
Combinatorial Correlation Clustering.

, , , , , and . STOC, page 1617-1628. ACM, (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

Marcin Wlodarski

Marcin Grzegorzek

Marcin Siatkowski

Marcin Wlodarczak

 

Other publications of authors with the same name

Planar Directed k-Vertex-Disjoint Paths Problem.. Encyclopedia of Algorithms, (2016)Exact Algorithms on Graphs of Bounded Average Degree.. Encyclopedia of Algorithms, (2016)Planar Digraphs., and . Classes of Directed Graphs, Springer, (2018)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)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)Hardness of Metric Dimension in Graphs of Constant Treewidth., and . Algorithmica, 84 (11): 3110-3155 (2022)Tight bound on treedepth in terms of pathwidth and longest path., , , , , and . CoRR, (2023)Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation., , , , , , and . CoRR, (2022)A tight quasi-polynomial bound for Global Label Min-Cut., , , , and . CoRR, (2022)A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number., and . CoRR, (2023)