M. S. Ramanujan

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 101

Top Venues

Publications

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP (2024)
Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo
Decremental Sensitivity Oracles for Covering and Packing Minors. STACS (2024)
Sushmita Gupta, M. S. Ramanujan, Peter Strulo
An Exercise in Tournament Design: When Some Matches Must Be Scheduled. CoRR (2024)
Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh
Exponential-Time Approximation Schemes via Compression. ITCS (2024)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR (2024)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms‡. SODA (2024)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. CoRR (2023)
Akanksha Agrawal, M. S. Ramanujan
Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels. FSTTCS (2023)
Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198 (1) (2023)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
Finding a Highly Connected Steiner Subgraph and its Applications. MFCS (2023)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms. CoRR (2023)
Lawqueen Kanesh, Diptapriyo Majumdar, M. S. Ramanujan
Polynomial-delay Enumeration Kernelizations for Cuts of Bounded Degree. CoRR (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. CoRR (2023)
Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan
Backdoor Sets on Nowhere Dense SAT. ICALP (2022)
M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma
An Exact Algorithm for Knot-Free Vertex Deletion. MFCS (2022)
Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini
Equilibrium Computation For Knockout Tournaments Played By Groups. AAMAS (2022)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR (2022)
Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. 36 (2) (2022)
Akanksha Agrawal, M. S. Ramanujan
Distance from Triviality 2.0: Hybrid Parameterizations. IWOCA (2022)
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA (2022)
Umberto Grandi, Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini
On the Complexity of Majority Illusion in Social Networks. CoRR (2022)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
On the Lossy Kernelization for Connected Treedepth Deletion Set. WG (2022)
M. S. Ramanujan
On Approximate Compressions for Connected Minor-Hitting Sets. ESA (2021)
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Elimination Distance to Topological-minor-free Graphs is FPT. CoRR (2021)
Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
FPT-approximation for FPT Problems. SODA (2021)
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica 83 (6) (2021)
Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS (2021)
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 83 (5) (2021)
Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. MFCS (2020)
Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Faster Graph bipartization. J. Comput. Syst. Sci. 109 (2020)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. SODA (2020)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. 806 (2020)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. 21 (4) (2020)
Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan
On the Complexity of Recovering Incidence Matrices. ESA (2020)
Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
On the Approximate Compressibility of Connected Vertex Cover. Algorithmica 82 (10) (2020)
Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
On the Parameterized Complexity of Deletion to H-free Strong Components. CoRR (2020)
Akanksha Agrawal, M. S. Ramanujan
On the Parameterized Complexity of Clique Elimination Distance. IPEC (2020)
Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
A characterization of König-Egerváry graphs with extendable vertex covers. Inf. Process. Lett. 161 (2020)
Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. 818 (2020)
Patrick O'Hara, M. S. Ramanujan, Theodoros Damoulas
On the Constrained Least-cost Tour Problem. CoRR (2019)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. 101 (2019)
Eduard Eiben, Danny Hermelin, M. S. Ramanujan
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. J. Comput. Syst. Sci. 105 (2019)
M. S. Ramanujan
An Approximate Kernel for Connected Feedback Vertex Set. ESA (2019)
Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
On the Approximate Compressibility of Connected Vertex Cover. CoRR (2019)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS (2019)
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
On the Complexity Landscape of Connected f-Factor Problems. Algorithmica 81 (6) (2019)
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
Backdoors for Linear Temporal Logic. Algorithmica 81 (2) (2019)
Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA (2018)
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95 (2018)
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes. CoRR (2018)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Reducing CMSO Model Checking to Highly Connected Graphs. ICALP (2018)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Reducing CMSO Model Checking to Highly Connected Graphs. CoRR (2018)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Alternative parameterizations of Metric Dimension. CoRR (2018)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ACM Trans. Algorithms 14 (1) (2018)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. SODA (2018)
Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
On the kernelization complexity of string problems. Theor. Comput. Sci. 730 (2018)
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
On the Complexity Landscape of Connected f -Factor Problems. CoRR (2018)
Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA (2018)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP (2018)
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Backdoor Treewidth for SAT. SAT (2017)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
A Linear-Time Parameterized Algorithm for Node Unique Label Cover. ESA (2017)
Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON (2017)
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
Saving Critical Nodes with Firefighters is FPT. CoRR (2017)
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
Saving Critical Nodes with Firefighters is FPT. ICALP (2017)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. CoRR (2017)
Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Lossy kernelization. STOC (2017)
Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
On finding highly connected spanning subgraphs. CoRR (2017)
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
On Structural Parameterizations of the Edge Disjoint Paths Problem. CoRR (2017)
M. S. Ramanujan, Stefan Szeider
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. AAAI (2017)
Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
Metric Dimension of Bounded Tree-length Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Path-Contractions, Edge Deletions and Connectivity Preservation. ESA (2017)
Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. 88 (2017)
Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan
On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS (2017)
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Going Beyond Primal Treewidth for (M)ILP. AAAI (2017)
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Combining Treewidth and Backdoors for CSP. STACS (2017)
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. ACM Trans. Algorithms 13 (2) (2017)
Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Hitting Selected (Odd) Cycles. SIAM J. Discret. Math. 31 (3) (2017)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
The Half-integral Erdös-Pósa Property for Non-null Cycles. CoRR (2017)
Eduard Eiben, Danny Hermelin, M. S. Ramanujan
Lossy Kernels for Hitting Subgraphs. MFCS (2017)
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Towards a Polynomial Kernel for Directed Feedback Vertex Set. MFCS (2017)
M. S. Ramanujan, Saket Saurabh
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts. ACM Trans. Algorithms 13 (4) (2017)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Path-contractions, edge deletions and connectivity preservation. CoRR (2017)
Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Lossy Kernelization. CoRR (2016)
Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
A Parameterized Algorithm for Mixed-Cut. LATIN (2016)
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Combining Treewidth and Backdoors for CSP. CoRR (2016)
Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
Metric Dimension of Bounded Tree-length Graphs. CoRR (2016)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
A Linear Time Parameterized Algorithm for Node Unique Label Cover. CoRR (2016)
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
On the Complexity Landscape of Connected f-Factor Problems. MFCS (2016)
Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Fine-grained complexity of integer programming: The case of bounded branch-width and rank. CoRR (2016)
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Backdoors to Tractable Valued CSP. CP (2016)
M. S. Ramanujan
A Faster Parameterized Algorithm for Group Feedback Edge Set. WG (2016)
Ashutosh Rai, M. S. Ramanujan
Strong Parameterized Deletion: Bipartite Graphs. FSTTCS (2016)
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. SODA (2016)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes. LICS (2016)
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Backdoors to Tractable Valued CSP. CoRR (2016)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set. CoRR (2016)
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
Backdoors to q-Horn. Algorithmica 74 (1) (2016)
Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
Partially Polynomial Kernels for Set Cover and Test Cover. SIAM J. Discret. Math. 30 (3) (2016)

M. S. Ramanujan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

M. S. Ramanujan