Refereed Journal Articles
Quadratic Upper Bounds on the Erdős–Pósa property for a generalization of Packing and Covering cycles
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Journal of Graph Theory, 2012
Remark: Accepted subject to minor revisions.
On Parameterized Independent Feedback Vertex Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
Theoretical Computer Science, 2012
Remark: Also appeared at Computing and Combinatorics, COCOON, 2011.
FPT algorithms for Connected Feedback Vertex Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
J. Comb. Optim., pp. 131-146, 2012
Remark: Also appeared at WALCOM: Algorithms and Computation, 2010.
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh
Theory of Computing Systems, pp. 822-848, 2009
Peer Reviewed Conference Publications
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
Foundations of Computer Science, FOCS, 2012
On the parameterized complexity of finding separators with non-hereditary properties
Pinar Heggernes, Pim Van't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
Workshop on Graphs, WG, 2012
Algorithmic Aspects of Dominator Colorings in Graphs
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
International Workshop on Combinatorial Algorithms, IWOCA, pp. 19-30, 2011
Hitting forbidden minors: Approximation and Kernelization
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
STACS, pp. 189-200, 2011
Imbalance Is Fixed Parameter Tractable
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
Conference on Computing and Combinatorics, COCOON, pp. 199-208, 2010
The effect of girth on the kernelization complexity of Connected Dominating Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp. 96-107, 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
International Symposium in Parameterized and Exact Computation (IPEC), pp. 14-25, 2010
Solving minones-2-sat as Fast as Vertex Cover
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
Mathematical Foundations of Computer Science, MFCS, pp. 549-555, 2010
The Budgeted Unique Coverage Problem and Color-Coding
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
Computer Science Symposium in Russia, CSR, pp. 310-321, 2009
Remark: To appear in Algorithmica.
Graph Layout Problems Parameterized by Vertex Cover
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
Algorithms and Computation, 19th International Symposium, ISAAC, pp. 294-305, 2008
Remark: Accepted for publication at Algorithmica subject to suggested revisions.
Theses, Surveys and Popular Science
Kernelization - Preprocessing with a Guarantee
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
The Multivariate Algorithmic Revolution and Beyond, pp. 129-161, 2012
Lower bounds on kernelization
Neeldhara Misra, Venkatesh Raman, Saket Saurabh
Discrete Optimization, pp. 110-128, 2011
The Missing Boarding Pass
Neeldhara Misra
Resonance, pp. 662-679, 2008