( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximating Pathwidth for Graphs of Small Treewidth.

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

Wojciech Derwich

Wojciech Osinski

Wojciech Kowalczyk

Wojciech Wojtyna

Wojciech Naworyta

 

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

Jones' Conjecture in subcubic graphs., , , , , и . CoRR, (2019)Approximating Pathwidth for Graphs of Small Treewidth., , , и . SODA, стр. 1965-1976. SIAM, (2021)Fully dynamic approximation schemes on planar and apex-minor-free graphs., , , и . CoRR, (2023)Efficient fully dynamic elimination forests with applications to detecting long paths and cycles., , , , , , , , , и 1 other автор(ы). SODA, стр. 796-809. SIAM, (2021)Computing Treedepth in Polynomial Space and Linear FPT Time., , и . ESA, том 244 из LIPIcs, стр. 79:1-79:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Many Visits TSP Revisited., , , , и . ESA, том 173 из LIPIcs, стр. 66:1-66:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Improved Bounds for the Excluded-Minor Approximation of Treedepth., , и . SIAM J. Discret. Math., 35 (2): 934-947 (2021)Determining 4-Edge-Connected Components in Linear Time., , , и . ESA, том 204 из LIPIcs, стр. 71:1-71:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Experimental evaluation of kernelization algorithms to Dominating Set.. CoRR, (2018)Exact Shortest Paths with Rational Weights on the Word RAM., , и . SODA, стр. 2597-2608. SIAM, (2024)