( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set.

, , , и . IPEC, том 63 из LIPIcs, стр. 2:1-2:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Deepashri Agrawal

Akanksha Nagpal

Mukesh Agrawal

Mudit Agrawal

Hemant Agrawal

 

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

Computing Square Colorings on Bounded-Treewidth and Planar Graphs., , , и . CoRR, (2022)Recognizing well-dominated graphs is coNP-complete., , , , и . CoRR, (2022)Parameterized Complexity of Minimum Membership Dominating Set., , , , и . CoRR, (2021)Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)., , , , и . Dagstuhl Reports, 12 (11): 109-123 (ноября 2022)A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion., , , и . CoRR, (2015)On Finding Short Reconfiguration Sequences Between Independent Sets., , и . ISAAC, том 248 из LIPIcs, стр. 39:1-39:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Kernelization of Cycle Packing with Relaxed Disjointness Constraints., , , , и . SIAM J. Discret. Math., 32 (3): 1619-1643 (2018)Parameterized Complexity of Minimum Membership Dominating Set., , , , и . WALCOM, том 13174 из Lecture Notes in Computer Science, стр. 288-299. Springer, (2022)Interval Vertex Deletion Admits a Polynomial Kernel., , , и . SODA, стр. 1711-1730. SIAM, (2019)On the Parameterized Complexity of Clique Elimination Distance., и . IPEC, том 180 из LIPIcs, стр. 1:1-1:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)