1. Gaspers S., Ordyniak S., Ramanujan, M. S., Saurabh, S., and Szeider, S. Backdoors to q-Horn. To appear., STACS 2013.

2. Misra P., Raman, V., Ramanujan, M. S., and Saurabh, S. Parameterized Algorithms for Even Cycle Transversal. In Proc., WG 2012.

3. Lokshtanov, D., and Ramanujan, M. S. Parameterized Tractability of Multiway Cut with Parity Constraints. In Proc., ICALP 2012.

4. Ghosh, E., Kolay, S., Kumar, M., Misra, P., Panolan, F., Rai, A., and Ramanujan, M. S. Faster Parameterized Algorithms for Deletion to Split Graphs. In Proc., SWAT 2012.

5. Narayanaswamy, N. S., Raman, V., Ramanujan, M. S., Saurabh, S. LP can be a cure for Parameterized Problems. In Proc., STACS 2012.

6. Misra P., Raman, V., Ramanujan, M. S., and Saurabh, S. A polynomial kernel for Feedback Arc Set on bipartite tournaments. In Proc., ISAAC 2011. [pdf]

7. Raman, V., Ramanujan, M. S., and Saurabh, S. Paths, Flowers and Vertex Cover. In Proc., ESA 2011.

8. Ambalath, A. M., Balasundaram, R., H., C. R., Koppula, V., Misra, N., Philip, G., and Ramanujan, M. S. On the kernelization complexity of colorful motifs. In Proc., IPEC 2010.