( en | de | ru )

 

Disambiguation of "Kanesh, Lawqueen"

Author of the publication

copydeleteadd this publication to your clipboard
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.

, , , , and . SIAM J. Discret. Math., 37 (4): 2626-2669 (December 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. You can also use the button next to the name to display some publications already assigned to the person.

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

Other publications of authors with the same name

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