| 2013 | ||
|---|---|---|
| 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 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 | ||
| 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 | |
Data released under the ODC-BY 1.0 license — See also our legal information page