( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the complexity of singly connected vertex deletion.

, , , , , и . Theor. Comput. Sci., (2022)

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.

Sineej Madathil

John Oommen Madathil

 

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

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)The Complexity of Minimizing Envy in House Allocation., , и . AAMAS, стр. 2673-2675. ACM, (2023)Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree., , и . Theory Comput. Syst., 64 (1): 62-100 (2020)Connecting the Dots (with Minimum Crossings)., , , , и . SoCG, том 129 из LIPIcs, стр. 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Opinion Diffusion on Society Graphs Based on Approval Ballots., , и . AAMAS, стр. 2372-2374. ACM, (2024)Mixed Dominating Set: A Parameterized Perspective., , , и . WG, том 10520 из Lecture Notes in Computer Science, стр. 330-343. Springer, (2017)Max-Cut Above Spanning Tree is Fixed-Parameter Tractable., , и . CSR, том 10846 из Lecture Notes in Computer Science, стр. 244-256. Springer, (2018)