M. S. Ramanujan

According to our database, M. S. Ramanujan authored at least 96 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Decremental Sensitivity Oracles for Covering and Packing Minors.

Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Meta-theorems for Parameterized Streaming Algorithms‡.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Exponential-Time Approximation Schemes via Compression.

Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

An Exercise in Tournament Design: When Some Matches Must Be Scheduled.

Sushmita Gupta, Ramanujan Sridharan, Peter Strulo

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

On the optimality of pseudo-polynomial algorithms for integer programming.

Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Math. Program., March, 2023

Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems.

Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan

CoRR, 2023

Enumeration Kernelizations of Polynomial Size for Cuts of Bounded Degree.

Diptapriyo Majumdar, M. S. Ramanujan

CoRR, 2023

Finding a Highly Connected Steiner Subgraph and its Applications.

Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels.

Akanksha Agrawal, M. S. Ramanujan

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less.

Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Identifying and Eliminating Majority Illusion in Social Networks.

Umberto Grandi, Lawqueen Kanesh, Grzegorz Lisowski, Ramanujan Sridharan, Paolo Turrini

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs.

Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

SIAM J. Discret. Math., 2022

An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set.

Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan

CoRR, 2022

On the Complexity of Majority Illusion in Social Networks.

Umberto Grandi, Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini

CoRR, 2022

On the Lossy Kernelization for Connected Treedepth Deletion Set.

Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

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

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

An Exact Algorithm for Knot-Free Vertex Deletion.

M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Distance from Triviality 2.0: Hybrid Parameterizations.

Akanksha Agrawal, M. S. Ramanujan

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Backdoor Sets on Nowhere Dense SAT.

Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Equilibrium Computation For Knockout Tournaments Played By Groups.

Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Elimination Distance to Topological-minor-free Graphs is FPT.

Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

CoRR, 2021

On Structural Parameterizations of the Edge Disjoint Paths Problem.

Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan

Algorithmica, 2021

Towards a Polynomial Kernel for Directed Feedback Vertex Set.

Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan

Algorithmica, 2021

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.

Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

FPT-approximation for FPT Problems.

Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

On Approximate Compressions for Connected Minor-Hitting Sets.

M. S. Ramanujan

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

A Hotelling-Downs Framework for Party Nominees.

Paul Harrenstein, Grzegorz Lisowski, Ramanujan Sridharan, Paolo Turrini

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

A New Perspective on FO Model Checking of Dense Graph Classes.

Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan

ACM Trans. Comput. Log., 2020

Linear representation of transversal matroids and gammoids parameterized by rank.

Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Theor. Comput. Sci., 2020

Alternative parameterizations of Metric Dimension.

Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström

Theor. Comput. Sci., 2020

Faster Graph bipartization.

Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

J. Comput. Syst. Sci., 2020

A characterization of König-Egerváry graphs with extendable vertex covers.

Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Inf. Process. Lett., 2020

On the Approximate Compressibility of Connected Vertex Cover.

Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh

Algorithmica, 2020

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components.

Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

On the Parameterized Complexity of Clique Elimination Distance.

Akanksha Agrawal, M. S. Ramanujan

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

On the Complexity of Recovering Incidence Matrices.

Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Path-contractions, edge deletions and connectivity preservation.

Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström

J. Comput. Syst. Sci., 2019

On approximate preprocessing for domination and hitting subgraphs with connected deletion sets.

Eduard Eiben, Danny Hermelin, M. S. Ramanujan

J. Comput. Syst. Sci., 2019

On the Constrained Least-cost Tour Problem.

Patrick O'Hara, M. S. Ramanujan, Theodoros Damoulas

CoRR, 2019

Backdoors for Linear Temporal Logic.

Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler

Algorithmica, 2019

On the Complexity Landscape of Connected f-Factor Problems.

Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan

Algorithmica, 2019

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On Succinct Encodings for the Tournament Fixing Problem.

Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

An Approximate Kernel for Connected Feedback Vertex Set.

M. S. Ramanujan

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

On the kernelization complexity of string problems.

Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh

Theor. Comput. Sci., 2018

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh

ACM Trans. Algorithms, 2018

Reconfiguration on sparse graphs.

Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

J. Comput. Syst. Sci., 2018

When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.

Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Reducing CMSO Model Checking to Highly Connected Graphs.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts.

M. S. Ramanujan, Saket Saurabh

ACM Trans. Algorithms, 2017

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.

Robert Ganian, M. S. Ramanujan, Stefan Szeider

ACM Trans. Algorithms, 2017

Hitting Selected (Odd) Cycles.

Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

SIAM J. Discret. Math., 2017

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.

Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý

SIAM J. Discret. Math., 2017

Metric Dimension of Bounded Tree-length Graphs.

Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan

SIAM J. Discret. Math., 2017

Faster exact algorithms for some terminal set problems.

Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

J. Comput. Syst. Sci., 2017

The Half-integral Erdös-Pósa Property for Non-null Cycles.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh

CoRR, 2017

On finding highly connected spanning subgraphs.

Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

CoRR, 2017

Lossy kernelization.

Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Combining Treewidth and Backdoors for CSP.

Robert Ganian, M. S. Ramanujan, Stefan Szeider

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Backdoor Treewidth for SAT.

Robert Ganian, M. S. Ramanujan, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Lossy Kernels for Hitting Subgraphs.

Eduard Eiben, Danny Hermelin, M. S. Ramanujan

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Saving Critical Nodes with Firefighters is FPT.

Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

On the Parameterized Complexity of Simultaneous Deletion Problems.

Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

A Linear-Time Parameterized Algorithm for Node Unique Label Cover.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable.

M. S. Ramanujan, Stefan Szeider

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Going Beyond Primal Treewidth for (M)ILP.

Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

LP Based Parameterized Algorithms.

M. S. Ramanujan

Encyclopedia of Algorithms, 2016

Partially Polynomial Kernels for Set Cover and Test Cover.

Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh

SIAM J. Discret. Math., 2016

Strong Backdoors for Linear Temporal Logic.

Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler

CoRR, 2016

A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh

CoRR, 2016

Fine-grained complexity of integer programming: The case of bounded branch-width and rank.

Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

CoRR, 2016

Backdoors to q-Horn.

Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider

Algorithmica, 2016

A Faster Parameterized Algorithm for Group Feedback Edge Set.

M. S. Ramanujan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

A Parameterized Algorithm for Mixed-Cut.

Ashutosh Rai, M. S. Ramanujan, Saket Saurabh

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Strong Parameterized Deletion: Bipartite Graphs.

Ashutosh Rai, M. S. Ramanujan

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Backdoors to Tractable Valued CSP.

Robert Ganian, M. S. Ramanujan, Stefan Szeider

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

Faster Parameterized Algorithms for Deletion to Split Graphs.

Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan

Algorithmica, 2015

On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids.

Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Solving <i>d-</i>SAT via Backdoors to Small Treewidth.

Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Metric Dimension of Bounded Width Graphs.

Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

FO Model Checking on Posets of Bounded Width.

Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Faster Parameterized Algorithms Using Linear Programming.

Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

ACM Trans. Algorithms, 2014

Parameterized Approximations via d-Skew-Symmetric Multicut.

Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Parameterized Algorithms to Preserve Connectivity.

Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Vertex Exponential Algorithms for Connected f-Factors.

Geevarghese Philip, M. S. Ramanujan

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.

Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Theory Comput. Syst., 2013

Hardness of r-dominating set on Graphs of Diameter (r + 1).

Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.

Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Parameterized Algorithms for Even Cycle Transversal.

Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

LP can be a cure for Parameterized Problems.

N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Parameterized Tractability of Multiway Cut with Parity Constraints.

Daniel Lokshtanov, M. S. Ramanujan

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Paths, Flowers and Vertex Cover.

Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Proceedings of the Algorithms - ESA 2011, 2011

2010

On the Kernelization Complexity of Colorful Motifs.

Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010