( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.

, , , , , , , , , , и . SODA, стр. 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.

Alexander Pilipczuk

Marcin Wlodarski

Marcin Grzegorzek

Marcin Å0yszkiewicz

Marcin Siatkowski

 

Другие публикации лиц с тем же именем

Exact Algorithms on Graphs of Bounded Average Degree.. Encyclopedia of Algorithms, (2016)Planar Directed k-Vertex-Disjoint Paths Problem.. Encyclopedia of Algorithms, (2016)Planar Digraphs., и . Classes of Directed Graphs, Springer, (2018)Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs., , и . ICALP, том 55 из LIPIcs, стр. 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation., и . ACM Journal of Experimental Algorithmics, 24 (1): 2.7:1-2.7:18 (2019)Hardness of Metric Dimension in Graphs of Constant Treewidth., и . Algorithmica, 84 (11): 3110-3155 (2022)A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number., и . CoRR, (2023)Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation., , , , , , и . CoRR, (2022)Tight bound on treedepth in terms of pathwidth and longest path., , , , , и . CoRR, (2023)A tight quasi-polynomial bound for Global Label Min-Cut., , , , и . CoRR, (2022)