default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. S. Ramanujan 0001
Ramanujan Sridharan – Ramanujan Maadapuzhi Sridharan
Person information
- affiliation: University of Warwick, Coventry, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c80]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov:
Packing Short Cycles. SODA 2025: 1425-1463- 2024
- [j29]Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma:
On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components. SIAM J. Discret. Math. 38(4): 3079-3110 (2024) - [c79]Sushmita Gupta, Ramanujan Sridharan, Peter Strulo:
An Exercise in Tournament Design: When Some Matches Must Be Scheduled. AAAI 2024: 9749-9756 - [c78]Patrick O'Hara, Ramanujan Sridharan, Theo Damoulas:
Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem. ATT@ECAI 2024: 108-121 - [c77]Argyrios Deligkas
, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP 2024: 53:1-53:18 - [c76]Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh:
Exponential-Time Approximation Schemes via Compression. ITCS 2024: 64:1-64:22 - [c75]Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. IPEC 2024: 4:1-4:20 - [c74]Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo:
On Controlling Knockout Tournaments Without Perfect Information. IPEC 2024: 7:1-7:15 - [c73]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms‡. SODA 2024: 712-739 - [c72]Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo:
Decremental Sensitivity Oracles for Covering and Packing Minors. STACS 2024: 44:1-44:19 - [i41]Sushmita Gupta, M. S. Ramanujan, Peter Strulo:
An Exercise in Tournament Design: When Some Matches Must Be Scheduled. CoRR abs/2402.06538 (2024) - [i40]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR abs/2404.15950 (2024) - [i39]Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. CoRR abs/2408.13819 (2024) - [i38]Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo:
On Controlling Knockout Tournaments Without Perfect Information. CoRR abs/2408.15068 (2024) - [i37]Patrick O'Hara, M. S. Ramanujan, Theodoros Damoulas:
Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem. CoRR abs/2410.10440 (2024) - [i36]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov:
Packing Short Cycles. CoRR abs/2410.18878 (2024) - 2023
- [j28]Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198(1): 561-593 (2023) - [c71]Umberto Grandi, Lawqueen Kanesh, Grzegorz Lisowski, Ramanujan Sridharan, Paolo Turrini:
Identifying and Eliminating Majority Illusion in Social Networks. AAAI 2023: 5062-5069 - [c70]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: 28:1-28:16 - [c69]Akanksha Agrawal, M. S. Ramanujan:
Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels. FSTTCS 2023: 36:1-36:17 - [c68]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
Finding a Highly Connected Steiner Subgraph and its Applications. MFCS 2023: 45:1-45:15 - [i35]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms. CoRR abs/2308.01598 (2023) - [i34]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 abs/2310.03469 (2023) - [i33]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. CoRR abs/2311.02708 (2023) - 2022
- [j27]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): 911-921 (2022) - [c67]Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini:
Equilibrium Computation For Knockout Tournaments Played By Groups. AAMAS 2022: 807-815 - [c66]Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan:
Backdoor Sets on Nowhere Dense SAT. ICALP 2022: 91:1-91:20 - [c65]Akanksha Agrawal, M. S. Ramanujan:
Distance from Triviality 2.0: Hybrid Parameterizations. IWOCA 2022: 3-20 - [c64]M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma:
An Exact Algorithm for Knot-Free Vertex Deletion. MFCS 2022: 78:1-78:15 - [c63]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: 1976-2004 - [c62]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
On the Lossy Kernelization for Connected Treedepth Deletion Set. WG 2022: 201-214 - [i32]Umberto Grandi, Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini:
On the Complexity of Majority Illusion in Social Networks. CoRR abs/2205.02056 (2022) - [i31]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR abs/2212.00418 (2022) - 2021
- [j26]Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 83(5): 1201-1221 (2021) - [j25]Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica 83(6): 1605-1637 (2021) - [c61]Paul Harrenstein, Grzegorz Lisowski, Ramanujan Sridharan, Paolo Turrini:
A Hotelling-Downs Framework for Party Nominees. AAMAS 2021: 593-601 - [c60]M. S. Ramanujan:
On Approximate Compressions for Connected Minor-Hitting Sets. ESA 2021: 78:1-78:16 - [c59]Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
FPT-approximation for FPT Problems. SODA 2021: 199-218 - [c58]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS 2021: 5:1-5:11 - [i30]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Elimination Distance to Topological-minor-free Graphs is FPT. CoRR abs/2104.09950 (2021) - 2020
- [j24]Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh:
On the Approximate Compressibility of Connected Vertex Cover. Algorithmica 82(10): 2902-2926 (2020) - [j23]Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A characterization of König-Egerváry graphs with extendable vertex covers. Inf. Process. Lett. 161: 105964 (2020) - [j22]Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Graph bipartization. J. Comput. Syst. Sci. 109: 45-55 (2020) - [j21]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. 806: 133-143 (2020) - [j20]Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. 818: 51-59 (2020) - [j19]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): 28:1-28:23 (2020) - [c57]Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan:
On the Complexity of Recovering Incidence Matrices. ESA 2020: 50:1-50:13 - [c56]Akanksha Agrawal, M. S. Ramanujan:
On the Parameterized Complexity of Clique Elimination Distance. IPEC 2020: 1:1-1:13 - [c55]Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma:
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. MFCS 2020: 75:1-75:13 - [c54]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. SODA 2020: 2181-2200 - [i29]Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma:
On the Parameterized Complexity of Deletion to H-free Strong Components. CoRR abs/2005.01359 (2020)
2010 – 2019
- 2019
- [j18]Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler:
Backdoors for Linear Temporal Logic. Algorithmica 81(2): 476-496 (2019) - [j17]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): 2606-2632 (2019) - [j16]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. 101: 1-20 (2019) - [j15]Eduard Eiben, Danny Hermelin, M. S. Ramanujan:
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. J. Comput. Syst. Sci. 105: 158-170 (2019) - [c53]M. S. Ramanujan:
An Approximate Kernel for Connected Feedback Vertex Set. ESA 2019: 77:1-77:14 - [c52]Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi:
On Succinct Encodings for the Tournament Fixing Problem. IJCAI 2019: 322-328 - [c51]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS 2019: 523-537 - [i28]Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh:
On the Approximate Compressibility of Connected Vertex Cover. CoRR abs/1905.03379 (2019) - [i27]Patrick O'Hara, M. S. Ramanujan, Theodoros Damoulas:
On the Constrained Least-cost Tour Problem. CoRR abs/1906.07754 (2019) - 2018
- [j14]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95: 122-131 (2018) - [j13]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ACM Trans. Algorithms 14(1): 7:1-7:37 (2018) - [j12]Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
On the kernelization complexity of string problems. Theor. Comput. Sci. 730: 21-31 (2018) - [c50]Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA 2018: 31:1-31:13 - [c49]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP 2018: 110:1-110:4 - [c48]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Reducing CMSO Model Checking to Highly Connected Graphs. ICALP 2018: 135:1-135:14 - [c47]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: 1916-1933 - [c46]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: 2838-2850 - [i26]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Reducing CMSO Model Checking to Highly Connected Graphs. CoRR abs/1802.01453 (2018) - [i25]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Alternative parameterizations of Metric Dimension. CoRR abs/1804.10670 (2018) - [i24]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. CoRR abs/1805.01823 (2018) - [i23]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f -Factor Problems. CoRR abs/1812.02037 (2018) - 2017
- [j11]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: 195-207 (2017) - [j10]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): 1217-1243 (2017) - [j9]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): 1294-1327 (2017) - [j8]Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Hitting Selected (Odd) Cycles. SIAM J. Discret. Math. 31(3): 1581-1615 (2017) - [j7]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. ACM Trans. Algorithms 13(2): 29:1-29:32 (2017) - [j6]M. S. Ramanujan, Saket Saurabh:
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts. ACM Trans. Algorithms 13(4): 46:1-46:25 (2017) - [c45]Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Going Beyond Primal Treewidth for (M)ILP. AAAI 2017: 815-821 - [c44]M. S. Ramanujan, Stefan Szeider:
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. AAAI 2017: 3929-3935 - [c43]Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON 2017: 420-432 - [c42]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-Contractions, Edge Deletions and Connectivity Preservation. ESA 2017: 47:1-47:13 - [c41]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear-Time Parameterized Algorithm for Node Unique Label Cover. ESA 2017: 57:1-57:15 - [c40]Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan:
On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS 2017: 9:1-9:14 - [c39]Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan:
Saving Critical Nodes with Firefighters is FPT. ICALP 2017: 135:1-135:13 - [c38]Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. ISAAC 2017: 36:1-36:13 - [c37]Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Towards a Polynomial Kernel for Directed Feedback Vertex Set. MFCS 2017: 36:1-36:15 - [c36]Eduard Eiben, Danny Hermelin, M. S. Ramanujan:
Lossy Kernels for Hitting Subgraphs. MFCS 2017: 67:1-67:14 - [c35]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoor Treewidth for SAT. SAT 2017: 20-37 - [c34]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Combining Treewidth and Backdoors for CSP. STACS 2017: 36:1-36:17 - [c33]Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Lossy kernelization. STOC 2017: 224-237 - [i22]Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
On finding highly connected spanning subgraphs. CoRR abs/1701.02853 (2017) - [i21]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
The Half-integral Erdös-Pósa Property for Non-null Cycles. CoRR abs/1703.02866 (2017) - [i20]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. CoRR abs/1704.04249 (2017) - [i19]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-contractions, edge deletions and connectivity preservation. CoRR abs/1704.06622 (2017) - [i18]Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan:
Saving Critical Nodes with Firefighters is FPT. CoRR abs/1705.10923 (2017) - [i17]Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. CoRR abs/1711.02076 (2017) - 2016
- [j5]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. Algorithmica 74(1): 540-557 (2016) - [j4]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): 1401-1423 (2016) - [c32]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoors to Tractable Valued CSP. CP 2016: 233-250 - [c31]Ashutosh Rai, M. S. Ramanujan:
Strong Parameterized Deletion: Bipartite Graphs. FSTTCS 2016: 21:1-21:14 - [c30]Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler:
Backdoors for Linear Temporal Logic. IPEC 2016: 23:1-23:17 - [c29]Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
A Parameterized Algorithm for Mixed-Cut. LATIN 2016: 672-685 - [c28]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: 176-184 - [c27]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f-Factor Problems. MFCS 2016: 41:1-41:14 - [c26]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. SODA 2016: 1670-1681 - [c25]M. S. Ramanujan:
A Faster Parameterized Algorithm for Group Feedback Edge Set. WG 2016: 269-281 - [r1]M. S. Ramanujan:
LP Based Parameterized Algorithms. Encyclopedia of Algorithms 2016: 1175-1177 - [i16]Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Tree-length Graphs. CoRR abs/1602.02610 (2016) - [i15]Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler:
Strong Backdoors for Linear Temporal Logic. CoRR abs/1602.04934 (2016) - [i14]Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Lossy Kernelization. CoRR abs/1604.04111 (2016) - [i13]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear Time Parameterized Algorithm for Node Unique Label Cover. CoRR abs/1604.08764 (2016) - [i12]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 abs/1607.05342 (2016) - [i11]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set. CoRR abs/1609.04347 (2016) - [i10]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Combining Treewidth and Backdoors for CSP. CoRR abs/1610.03298 (2016) - [i9]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoors to Tractable Valued CSP. CoRR abs/1612.05733 (2016) - 2015
- [j3]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71(4): 989-1006 (2015) - [c24]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. FOCS 2015: 963-974 - [c23]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ICALP (1) 2015: 935-946 - [c22]Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Width Graphs. MFCS (2) 2015: 115-126 - [c21]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh:
Solving d-SAT via Backdoors to Small Treewidth. SODA 2015: 630-641 - [c20]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on Sparse Graphs. WADS 2015: 506-517 - [c19]Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. WADS 2015: 566-577 - [i8]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on sparse graphs. CoRR abs/1502.04803 (2015) - [i7]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. CoRR abs/1504.04115 (2015) - [i6]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. CoRR abs/1507.02479 (2015) - [i5]Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
A Parameterized Algorithm for Mixed Cut. CoRR abs/1509.05612 (2015) - 2014
- [j2]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms 11(2): 15:1-15:31 (2014) - [c18]Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
On the Kernelization Complexity of String Problems. COCOON 2014: 141-153 - [c17]Geevarghese Philip, M. S. Ramanujan:
Vertex Exponential Algorithms for Connected f-Factors. FSTTCS 2014: 61-71 - [c16]Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms to Preserve Connectivity. ICALP (1) 2014: 800-811 - [c15]Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Approximations via d-Skew-Symmetric Multicut. MFCS (2) 2014: 457-468 - [c14]M. S. Ramanujan, Saket Saurabh:
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts. SODA 2014: 1739-1748 - 2013
- [j1]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. Theory Comput. Syst. 53(4): 609-620 (2013) - [c13]Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan:
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. FAW-AAIM 2013: 198-209 - [c12]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. ESA 2013: 671-682 - [c11]Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh:
Partially Polynomial Kernels for Set Cover and Test Cover. FSTTCS 2013: 67-78 - [c10]Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Exact Algorithms for Some Terminal Set Problems. IPEC 2013: 150-162 - [c9]Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh:
Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC 2013: 255-267 - [c8]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. STACS 2013: 67-79 - [i4]M. S. Ramanujan, Saket Saurabh:
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts. CoRR abs/1304.7505 (2013) - 2012
- [c7]Daniel Lokshtanov, M. S. Ramanujan:
Parameterized Tractability of Multiway Cut with Parity Constraints. ICALP (1) 2012: 750-761 - [c6]N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
LP can be a cure for Parameterized Problems. STACS 2012: 338-349 - [c5]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT 2012: 107-118 - [c4]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms for Even Cycle Transversal. WG 2012: 172-183 - [i3]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms using Linear Programming. CoRR abs/1203.0833 (2012) - [i2]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. CoRR abs/1210.0260 (2012) - [i1]Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan:
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. CoRR abs/1210.3978 (2012) - 2011
- [c3]Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Paths, Flowers and Vertex Cover. ESA 2011: 382-393 - [c2]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. ISAAC 2011: 333-343 - 2010
- [c1]Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan:
On the Kernelization Complexity of Colorful Motifs. IPEC 2010: 14-25
Coauthor Index
[c80] [j29] [c76] [c73] [i36] [j28] [c70] [i35] [i34] [j27] [c64] [c63] [c59] [c58] [i30] [j24] [j23] [j22] [j20] [c55] [c54] [i29] [c52] [c51] [i28] [j14] [j13] [j12] [c50] [c49] [c48] [c47] [c46] [i26] [j11] [j9] [j8] [j6] [c43] [c41] [c33] [i22] [i21] [i20] [j5] [j4] [c29] [i14] [i13] [i12] [i11] [c24] [c23] [c21] [c20] [c19] [i8] [i7] [i5] [j2] [c18] [c16] [c15] [c14] [j1] [c12] [c11] [c10] [c9] [c8] [i4] [c6] [c4] [i3] [i2] [c3] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-29 22:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
