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.

 

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

Elimination Distance to Topological-minor-free Graphs is FPT., , , , , и . CoRR, (2021)Fréchet Distance Between a Line and Avatar Point Set., , , и . Algorithmica, 80 (9): 2616-2636 (2018)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , и . Algorithmica, 83 (2): 753-774 (2021)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , и . Algorithmica, 84 (9): 2622-2641 (2022)A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments., , , , , и . CoRR, (2018)Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms., , , и . J. ACM, 63 (4): 29:1-29:60 (2016)Representative Families of Product Families., , , и . ACM Trans. Algorithms, 13 (3): 36:1-36:29 (2017)Lossy Kernelization., , , и . CoRR, (2016)On the Parameterized Complexity of Edge-Linked Paths., , и . CSR, том 11532 из Lecture Notes in Computer Science, стр. 286-298. Springer, (2019)Lossy Kernels for Connected Dominating Set on Sparse Graphs., , , , и . SIAM J. Discret. Math., 33 (3): 1743-1771 (2019)