( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.

, , , , и . ACM Trans. Algorithms, 15 (1): 11:1-11:28 (2019)

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.

Manoj Misra

Sidhant Misra

Pranob Misra

Ashok Misra

Hara Prasanna Misra

 

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

Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems., , , , и . APPROX-RANDOM, том 116 из LIPIcs, стр. 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Fast Exact Algorithms for Survivable Network Design with Uniform Requirements., , , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 25-36. Springer, (2017)Reducing Rank of the Adjacency Matrix by Graph Modification., , и . COCOON, том 9198 из Lecture Notes in Computer Science, стр. 361-373. Springer, (2015)2-Approximating Feedback Vertex Set in Tournaments., , , , , и . SODA, стр. 1010-1018. SIAM, (2020)FPT-approximation for FPT Problems., , , , и . SODA, стр. 199-218. SIAM, (2021)On the Complexity of Recovering Incidence Matrices., , , и . ESA, том 173 из LIPIcs, стр. 50:1-50:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Parameterized Algorithms for Survivable Network Design with Uniform Demands., , , , , , и . SODA, стр. 2838-2850. SIAM, (2018)An Erdős-Pósa Theorem on Neighborhoods and Domination Number., , и . COCOON, том 11653 из Lecture Notes in Computer Science, стр. 437-444. Springer, (2019)Finding Even Subgraphs Even Faster., , , , и . CoRR, (2014)Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number., , , и . FSTTCS, том 122 из LIPIcs, стр. 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)