M. S. Ramanujan
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
61
Venues
19
Active years
2011–2026
Best venue rank
A*
Where they publish
Papers
61 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SODA | Augmenting to 4-vertex connectivity is fixed-parameter tractable. | Johannes Carmesin, M. S. Ramanujan |
| 2025 | SODA | Packing Short Cycles. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov |
| 2025 | SAGT | Tractable Graph Structures in EFX Orientation. | Vclav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo |
| 2025 | WADS | Routing Few Robots in a Crowded Network. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan |
| 2024 | ICALP | Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan |
| 2024 | SODA | Meta-theorems for Parameterized Streaming Algorithms‡. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2024 | STACS | Decremental Sensitivity Oracles for Covering and Packing Minors. | Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo |
| 2023 | MFCS | Finding a Highly Connected Steiner Subgraph and its Applications. | Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan |
| 2022 | ICALP | Backdoor Sets on Nowhere Dense SAT. | Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan |
| 2022 | IWOCA | Distance from Triviality 2.0: Hybrid Parameterizations. | Akanksha Agrawal, M. S. Ramanujan |
| 2022 | MFCS | An Exact Algorithm for Knot-Free Vertex Deletion. | M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma |
| 2022 | SODA | Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. | Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2022 | WG | On the Lossy Kernelization for Connected Treedepth Deletion Set. | Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan |
| 2021 | ESA | On Approximate Compressions for Connected Minor-Hitting Sets. | M. S. Ramanujan |
| 2021 | SODA | FPT-approximation for FPT Problems. | Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2021 | STACS | An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. | Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2020 | ESA | On the Complexity of Recovering Incidence Matrices. | Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan |
| 2020 | MFCS | On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. | Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma |
| 2020 | SODA | Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2019 | ESA | An Approximate Kernel for Connected Feedback Vertex Set. | M. S. Ramanujan |
| 2019 | WADS | Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | ESA | On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. | Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2018 | ICALP | Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | ICALP | Reducing CMSO Model Checking to Highly Connected Graphs. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | SODA | Parameterized Algorithms for Survivable Network Design with Uniform Demands. | Jrgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | SODA | When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2017 | AAAI | Going Beyond Primal Treewidth for (M)ILP. | Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | AAAI | Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. | M. S. Ramanujan, Stefan Szeider |
| 2017 | COCOON | Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. | Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | ESA | Path-Contractions, Edge Deletions and Connectivity Preservation. | Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlstrm |
| 2017 | ESA | A Linear-Time Parameterized Algorithm for Node Unique Label Cover. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2017 | ICALP | Saving Critical Nodes with Firefighters is FPT. | Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan |
| 2017 | MFCS | Towards a Polynomial Kernel for Directed Feedback Vertex Set. | Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | MFCS | Lossy Kernels for Hitting Subgraphs. | Eduard Eiben, Danny Hermelin, M. S. Ramanujan |
| 2017 | STOC | Lossy kernelization. | Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | STACS | Combining Treewidth and Backdoors for CSP. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2017 | SAT | Backdoor Treewidth for SAT. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2016 | CP | Backdoors to Tractable Valued CSP. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2016 | LATIN | A Parameterized Algorithm for Mixed-Cut. | Ashutosh Rai, M. S. Ramanujan, Saket Saurabh |
| 2016 | LICS | A New Perspective on FO Model Checking of Dense Graph Classes. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Daniel Lokshtanov, M. S. Ramanujan |
| 2016 | MFCS | On the Complexity Landscape of Connected f-Factor Problems. | Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan |
| 2016 | SODA | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2016 | WG | A Faster Parameterized Algorithm for Group Feedback Edge Set. | M. S. Ramanujan |
| 2015 | FOCS | FO Model Checking on Posets of Bounded Width. | Jakub Gajarsk, Petr Hlinen, Daniel Lokshtanov, Jan Obdrzlek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh |
| 2015 | ICALP | Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2015 | MFCS | Metric Dimension of Bounded Width Graphs. | Rmy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan |
| 2015 | SODA | Solving | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh |
| 2015 | WADS | Reconfiguration on Sparse Graphs. | Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2015 | WADS | On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. | Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2014 | COCOON | On the Kernelization Complexity of String Problems. | Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh |
| 2014 | ICALP | Parameterized Algorithms to Preserve Connectivity. | Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | MFCS | Parameterized Approximations via d-Skew-Symmetric Multicut. | Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | SODA | Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts. | M. S. Ramanujan, Saket Saurabh |
| 2013 | AAIM | Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. | Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan |
| 2013 | ESA | Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. | Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Such |
| 2013 | STACS | Backdoors to q-Horn. | Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider |
| 2012 | ICALP | Parameterized Tractability of Multiway Cut with Parity Constraints. | Daniel Lokshtanov, M. S. Ramanujan |
| 2012 | STACS | LP can be a cure for Parameterized Problems. | N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2012 | WG | Parameterized Algorithms for Even Cycle Transversal. | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | ESA | Paths, Flowers and Vertex Cover. | Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | ISAAC | A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |