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.

 

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

A 2ℓk Kernel for ℓ-Component Order Connectivity., и . CoRR, (2016)Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time., и . WG, том 3787 из Lecture Notes in Computer Science, стр. 187-198. Springer, (2005)Even Faster Algorithm for Set Splitting!, и . IWPEC, том 5917 из Lecture Notes in Computer Science, стр. 288-299. Springer, (2009)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , и . Algorithmica, 81 (2): 421-438 (2019)Algorithmic Lower Bounds for Problems on Decomposable Graphs.. MFCS, том 6281 из Lecture Notes in Computer Science, стр. 37. Springer, (2010)On the Complexity of Computing Treelength.. MFCS, том 4708 из Lecture Notes in Computer Science, стр. 276-287. Springer, (2007)Picking Random Vertices (Invited Talk).. MFCS, том 138 из LIPIcs, стр. 3:1-3:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)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)Kernelization, Bidimensionality and Kernels.. Encyclopedia of Algorithms, (2016)