M. S. Ramanujan

160 papers A* 23A 18B 23C 1Misc 2Journal 79Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality. CoRR Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2026	A*	`conf`	Augmenting to 4-vertex connectivity is fixed-parameter tractable. SODA Johannes Carmesin, M. S. Ramanujan
2026	J	`jnl`	Highly Connected Steiner Subgraph: Parameterized Algorithms and Applications to Hitting Set Problems. SIAM J. Discret. Math. Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2026	J	`jnl`	Packing Short Cycles. ACM Trans. Algorithms Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2026	J	`jnl`	Routing few robots in a crowded network. J. Comput. Syst. Sci. Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2026	J	`jnl`	When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices. J. Comb. Theory B Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2025	J	`jnl`	A Complexity-Theoretic Analysis of Majority Illusion in Social Networks. J. Artif. Intell. Res. Umberto Grandi, Lawqueen Kanesh, Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini
2025	A*	`conf`	A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots. SoCG Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2025	B	`conf`	Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth. IPEC Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo
2025	J	`jnl`	On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. Algorithmica Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo
2025	A*	`conf`	Packing Short Cycles. SODA Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2025	A	`conf`	Parameterized Algorithms for Multiagent Pathfinding on Trees. AAMAS Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2025	B	`conf`	Routing Few Robots in a Crowded Network. WADS Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2025	B	`conf`	Tractable Graph Structures in EFX Orientation. SAGT Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2025	J	`jnl`	Tractable Graph Structures in EFX Orientation. CoRR Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2025	A*	`conf`	When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. SoCG Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2025	J	`jnl`	When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2024	J	`jnl`	An Exercise in Tournament Design: When Some Matches Must Be Scheduled. CoRR Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2024	A	`conf`	Decremental Sensitivity Oracles for Covering and Packing Minors. STACS Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo
2024	A	`conf`	Exponential-Time Approximation Schemes via Compression. ITCS Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh
2024	A*	`conf`	Meta-theorems for Parameterized Streaming Algorithms‡. SODA Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2024	B	`conf`	On Controlling Knockout Tournaments Without Perfect Information. IPEC Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2024	J	`jnl`	On Controlling Knockout Tournaments Without Perfect Information. CoRR Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2024	J	`jnl`	On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components. SIAM J. Discret. Math. Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
2024	B	`conf`	On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. IPEC Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo
2024	J	`jnl`	On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. CoRR Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo
2024	J	`jnl`	Packing Short Cycles. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2024	A*	`conf`	Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024	J	`jnl`	Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024	J	`jnl`	Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem. CoRR Patrick O'Hara, M. S. Ramanujan, Theodoros Damoulas
2023	—	`conf`	Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels. FSTTCS Akanksha Agrawal, M. S. Ramanujan
2023	—	`conf`	FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
2023	J	`jnl`	FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. CoRR Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
2023	B	`conf`	Finding a Highly Connected Steiner Subgraph and its Applications. MFCS Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2023	J	`jnl`	Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. CoRR Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2023	J	`jnl`	Meta-theorems for Parameterized Streaming Algorithms. CoRR Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2022	J	`jnl`	A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2022	B	`conf`	An Exact Algorithm for Knot-Free Vertex Deletion. MFCS M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma
2022	J	`jnl`	An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2022	A*	`conf`	Backdoor Sets on Nowhere Dense SAT. ICALP Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan
2022	A*	`conf`	Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2022	C	`conf`	Distance from Triviality 2.0: Hybrid Parameterizations. IWOCA Akanksha Agrawal, M. S. Ramanujan
2022	A	`conf`	Equilibrium Computation For Knockout Tournaments Played By Groups. AAMAS Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini
2022	J	`jnl`	On the Complexity of Majority Illusion in Social Networks. CoRR Umberto Grandi, Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini
2022	B	`conf`	On the Lossy Kernelization for Connected Treedepth Deletion Set. WG Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2021	A	`conf`	An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2021	J	`jnl`	Elimination Distance to Topological-minor-free Graphs is FPT. CoRR Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2021	A*	`conf`	FPT-approximation for FPT Problems. SODA Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2021	A	`conf`	On Approximate Compressions for Connected Minor-Hitting Sets. ESA M. S. Ramanujan
2021	J	`jnl`	On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2021	J	`jnl`	Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2020	J	`jnl`	A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2020	J	`jnl`	A characterization of König-Egerváry graphs with extendable vertex covers. Inf. Process. Lett. Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2020	J	`jnl`	Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2020	J	`jnl`	Faster Graph bipartization. J. Comput. Syst. Sci. Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2020	J	`jnl`	Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2020	J	`jnl`	On the Approximate Compressibility of Connected Vertex Cover. Algorithmica Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
2020	A	`conf`	On the Complexity of Recovering Incidence Matrices. ESA Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan
2020	B	`conf`	On the Parameterized Complexity of Clique Elimination Distance. IPEC Akanksha Agrawal, M. S. Ramanujan
2020	J	`jnl`	On the Parameterized Complexity of Deletion to H-free Strong Components. CoRR Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
2020	B	`conf`	On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. MFCS Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
2020	A*	`conf`	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. SODA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2019	A	`conf`	An Approximate Kernel for Connected Feedback Vertex Set. ESA M. S. Ramanujan
2019	J	`jnl`	Backdoors for Linear Temporal Logic. Algorithmica Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
2019	J	`jnl`	On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. J. Comput. Syst. Sci. Eduard Eiben, Danny Hermelin, M. S. Ramanujan
2019	J	`jnl`	On the Approximate Compressibility of Connected Vertex Cover. CoRR Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
2019	J	`jnl`	On the Complexity Landscape of Connected f-Factor Problems. Algorithmica Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2019	J	`jnl`	On the Constrained Least-cost Tour Problem. CoRR Patrick O'Hara, M. S. Ramanujan, Theodoros Damoulas
2019	J	`jnl`	Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2019	B	`conf`	Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	A New Perspective on FO Model Checking of Dense Graph Classes. CoRR Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan
2018	J	`jnl`	Alternative parameterizations of Metric Dimension. CoRR Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2018	A*	`conf`	Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ACM Trans. Algorithms Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2018	J	`jnl`	On the Complexity Landscape of Connected f -Factor Problems. CoRR Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2018	A	`conf`	On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2018	J	`jnl`	On the kernelization complexity of string problems. Theor. Comput. Sci. Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2018	A*	`conf`	Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Reconfiguration on sparse graphs. J. Comput. Syst. Sci. Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2018	A*	`conf`	Reducing CMSO Model Checking to Highly Connected Graphs. ICALP Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Reducing CMSO Model Checking to Highly Connected Graphs. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	A*	`conf`	When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. SODA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2017	A	`conf`	A Linear-Time Parameterized Algorithm for Node Unique Label Cover. ESA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2017	A	`conf`	Backdoor Treewidth for SAT. SAT Robert Ganian, M. S. Ramanujan, Stefan Szeider
2017	A	`conf`	Combining Treewidth and Backdoors for CSP. STACS Robert Ganian, M. S. Ramanujan, Stefan Szeider
2017	J	`jnl`	Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. ACM Trans. Algorithms Robert Ganian, M. S. Ramanujan, Stefan Szeider
2017	J	`jnl`	Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	A*	`conf`	Going Beyond Primal Treewidth for (M)ILP. AAAI Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2017	J	`jnl`	Hitting Selected (Odd) Cycles. SIAM J. Discret. Math. Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	Misc	`conf`	Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts. ACM Trans. Algorithms M. S. Ramanujan, Saket Saurabh
2017	B	`conf`	Lossy Kernels for Hitting Subgraphs. MFCS Eduard Eiben, Danny Hermelin, M. S. Ramanujan
2017	A*	`conf`	Lossy kernelization. STOC Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	Metric Dimension of Bounded Tree-length Graphs. SIAM J. Discret. Math. Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
2017	J	`jnl`	On Structural Parameterizations of the Edge Disjoint Paths Problem. CoRR Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2017	J	`jnl`	On finding highly connected spanning subgraphs. CoRR Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	—	`conf`	On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan
2017	J	`jnl`	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math. Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2017	A	`conf`	Path-Contractions, Edge Deletions and Connectivity Preservation. ESA Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2017	J	`jnl`	Path-contractions, edge deletions and connectivity preservation. CoRR Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2017	A*	`conf`	Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. AAAI M. S. Ramanujan, Stefan Szeider
2017	A*	`conf`	Saving Critical Nodes with Firefighters is FPT. ICALP Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
2017	J	`jnl`	Saving Critical Nodes with Firefighters is FPT. CoRR Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
2017	J	`jnl`	The Half-integral Erdös-Pósa Property for Non-null Cycles. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2017	B	`conf`	Towards a Polynomial Kernel for Directed Feedback Vertex Set. MFCS Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2016	B	`conf`	A Faster Parameterized Algorithm for Group Feedback Edge Set. WG M. S. Ramanujan
2016	J	`jnl`	A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2016	J	`jnl`	A Linear Time Parameterized Algorithm for Node Unique Label Cover. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2016	A*	`conf`	A New Perspective on FO Model Checking of Dense Graph Classes. LICS Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2016	B	`conf`	A Parameterized Algorithm for Mixed-Cut. LATIN Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2016	A	`conf`	Backdoors to Tractable Valued CSP. CP Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016	J	`jnl`	Backdoors to Tractable Valued CSP. CoRR Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016	J	`jnl`	Backdoors to q-Horn. Algorithmica Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2016	J	`jnl`	Combining Treewidth and Backdoors for CSP. CoRR Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016	A*	`conf`	Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. SODA Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016	J	`jnl`	Fine-grained complexity of integer programming: The case of bounded branch-width and rank. CoRR Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2016	—	`ch.`	LP Based Parameterized Algorithms. Encyclopedia of Algorithms M. S. Ramanujan
2016	J	`jnl`	Lossy Kernelization. CoRR Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2016	J	`jnl`	Metric Dimension of Bounded Tree-length Graphs. CoRR Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
2016	B	`conf`	On the Complexity Landscape of Connected f-Factor Problems. MFCS Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2016	J	`jnl`	Partially Polynomial Kernels for Set Cover and Test Cover. SIAM J. Discret. Math. Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
2016	J	`jnl`	Strong Backdoors for Linear Temporal Logic. CoRR Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
2016	—	`conf`	Strong Parameterized Deletion: Bipartite Graphs. FSTTCS Ashutosh Rai, M. S. Ramanujan
2015	J	`jnl`	A Parameterized Algorithm for Mixed Cut. CoRR Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. CoRR Robert Ganian, M. S. Ramanujan, Stefan Szeider
2015	A*	`conf`	FO Model Checking on Posets of Bounded Width. FOCS Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	FO Model Checking on Posets of Bounded Width. CoRR Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
2015	—	`conf`	Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ICALP (1) Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2015	—	`conf`	Metric Dimension of Bounded Width Graphs. MFCS (2) Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
2015	B	`conf`	On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. WADS Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	B	`conf`	Reconfiguration on Sparse Graphs. WADS Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Reconfiguration on sparse graphs. CoRR Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	A*	`conf`	Solving SODA Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh
2014	J	`jnl`	Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2014	A*	`conf`	Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts. SODA M. S. Ramanujan, Saket Saurabh
2014	Misc	`conf`	On the Kernelization Complexity of String Problems. COCOON Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2014	—	`conf`	Parameterized Algorithms to Preserve Connectivity. ICALP (1) Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2014	—	`conf`	Parameterized Approximations via d-Skew-Symmetric Multicut. MFCS (2) Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2014	—	`conf`	Vertex Exponential Algorithms for Connected f-Factors. FSTTCS Geevarghese Philip, M. S. Ramanujan
2013	J	`jnl`	A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. Theory Comput. Syst. Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2013	A	`conf`	Backdoors to q-Horn. STACS Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2013	B	`conf`	Faster Exact Algorithms for Some Terminal Set Problems. IPEC Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2013	—	`conf`	Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. FAW-AAIM Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan
2013	B	`conf`	Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh
2013	J	`jnl`	Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts CoRR M. S. Ramanujan, Saket Saurabh
2013	A	`conf`	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. ESA Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2013	—	`conf`	Partially Polynomial Kernels for Set Cover and Test Cover. FSTTCS Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
2012	—	`conf`	Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
2012	J	`jnl`	Faster Parameterized Algorithms using Linear Programming CoRR Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	J	`jnl`	Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints CoRR Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan
2012	A	`conf`	LP can be a cure for Parameterized Problems. STACS N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	B	`conf`	Parameterized Algorithms for Even Cycle Transversal. WG Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	J	`jnl`	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs CoRR Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2012	—	`conf`	Parameterized Tractability of Multiway Cut with Parity Constraints. ICALP (1) Daniel Lokshtanov, M. S. Ramanujan
2011	B	`conf`	A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. ISAAC Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2011	A	`conf`	Paths, Flowers and Vertex Cover. ESA Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2010	B	`conf`	On the Kernelization Complexity of Colorful Motifs. IPEC Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan