( en | de | ru )

 

Disambiguation of "Ramanujan, M. S."

Author of the publication

copydeleteadd this publication to your clipboard
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set.

, , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 935-946. Springer, (2015)

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.

M S Perzanowski

M S Khan

M S Jenny

Rahul M S

Osman M s rl

 

Other publications of authors with the same name

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent., , , , , , and . SODA, page 1976-2004. SIAM, (2022)On the Complexity of Majority Illusion in Social Networks., , , and . CoRR, (2022)On the Approximate Compressibility of Connected Vertex Cover., , and . Algorithmica, 82 (10): 2902-2926 (2020)On Structural Parameterizations of the Edge Disjoint Paths Problem., , and . Algorithmica, 83 (6): 1605-1637 (2021)Backdoor Sets on Nowhere Dense SAT., , and . ICALP, volume 229 of LIPIcs, page 91:1-91:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs., , , , and . SIAM J. Discret. Math., 36 (2): 911-921 (2022)Exponential-Time Approximation Schemes via Compression., , , , and . ITCS, volume 287 of LIPIcs, page 64:1-64:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Faster Exact Algorithms for Some Terminal Set Problems., , , , , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 150-162. Springer, (2013)Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS., , , , and . ICALP, volume 107 of LIPIcs, page 110:1-110:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS., , , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 523-537. Springer, (2019)