From post

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.

 

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

Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems., , , , и . APPROX-RANDOM, том 116 из LIPIcs, стр. 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Parameterized Algorithm for Mixed-Cut., , и . LATIN, том 9644 из Lecture Notes in Computer Science, стр. 672-685. Springer, (2016)Lower Bounds for Approximation Schemes for Closest String., , , , и . SWAT, том 53 из LIPIcs, стр. 12:1-12:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Balanced Judicious Bipartition is Fixed-Parameter Tractable., , , и . FSTTCS, том 93 из LIPIcs, стр. 40:40-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Group Activity Selection on Graphs: Parameterized Analysis., , , и . SAGT, том 10504 из Lecture Notes in Computer Science, стр. 106-118. Springer, (2017)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 25-36. Springer, (2017)Kernelizing Buttons and Scissors., , , и . CCCG, стр. 279-286. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set., , и . ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 241-248. Springer, (2002)Balanced Substructures in Bicolored Graphs., , , и . CoRR, (2024)On the Hardness of Losing Width., , , , и . Theory Comput. Syst., 54 (1): 73-82 (2014)