( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.

, , , , и . SIAM J. Discret. Math., 37 (4): 2626-2669 (декабря 2023)

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.

No persons found for author name Kanesh, Lawqueen
add a person with the name Kanesh, Lawqueen
 

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

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut., , , и . GECCO (Companion), стр. 326-327. ACM, (2018)Parameterized complexity of fair feedback vertex set problem., , , и . Theor. Comput. Sci., (2021)Identifying and Eliminating Majority Illusion in Social Networks., , , , и . AAAI, стр. 5062-5069. AAAI Press, (2023)Parameterized Complexity of Feedback Vertex Sets on Hypergraphs., , , , и . FSTTCS, том 182 из LIPIcs, стр. 18:1-18:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less., , , , и . FSTTCS, том 284 из LIPIcs, стр. 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Complexity of Singly Connected Vertex Deletion., , , , , и . IWOCA, том 12126 из Lecture Notes in Computer Science, стр. 237-250. Springer, (2020)Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems., , , , и . SIAM J. Discret. Math., 37 (4): 2626-2669 (декабря 2023)On the complexity of singly connected vertex deletion., , , , , и . Theor. Comput. Sci., (2022)A Polynomial Kernel for Bipartite Permutation Vertex Deletion., , , , , и . Algorithmica, 84 (11): 3246-3275 (2022)Elimination Distance to Topological-minor-free Graphs is FPT., , , , , и . CoRR, (2021)