menu +

Refereed Journal Articles

The Parameterized Complexity of Unique Coverage and Its Variants
Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
Algorithmica, pp. 517-544, 2013
Remark:  Also appeared at CSR: Computer Science Symposium in Russia, 2009)

Neeldhara Misra | Personal Home Page

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.

Neeldhara Misra | Personal Home Page

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.

Neeldhara Misra | Personal Home Page

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.

Neeldhara Misra | Personal Home Page

Peer Reviewed Conference Publications

On the d-Runaway Rectangle Escape Problem
Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty
26th Canadian Conference on Computational Geometry (CCCG), 2014

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

Backdoors into Heterogeneous Classes of SAT and CSP
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI), pp. 2652-2658, 2014

Neeldhara Misra | Personal Home Page

Vertex Cover Gets Faster and Harder on Low Degree Graphs
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra
Computing and Combinatorics - 20th International Conference (COCOON), pp. 179-190, 2014

Neeldhara Misra | Personal Home Page

UNO Gets Easier for a Single Player
Palash Dey, Prachi Goyal, Neeldhara Misra
Fun With Algorithms (FUN), pp. 147-157, 2014

Neeldhara Misra | Personal Home Page

Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets
Prachi Goyal, Neeldhara Misra, Fahad Panolan
Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS), pp. 237-248, 2013

Neeldhara Misra | Personal Home Page

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Eges
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
Parameterized and Exact Computation - 8th International Symposium (IPEC), pp. 243-254, 2013

Neeldhara Misra | Personal Home Page

Hardness of r-dominating set on Graphs of Diameter (r + 1)
Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh
Parameterized and Exact Computation - 8th International Symposium (IPEC), pp. 255-267, 2013

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

On the Parameterized Complexity of the Maximum Edge Coloring Problem
Prachi Goyal, Vikram Kamat, Neeldhara Misra
International Symposium on Mathematical Foundations of Computer Science (MFCS), 2013

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

Subexponential Algorithm for d-Cluster Edge Deletion - Exception or Rule?
Neeldhara Misra, Fahad Panolan, Saket Saurabh
International Symposium on Mathematical Foundations of Computer Science (MFCS), 2013

Neeldhara Misra | Personal Home Page

An Erdos--Ko--Rado theorem for matchings in the complete graph
Vikram Kamat, Neeldhara Misra
European Conference on Combinatorics, Graph Theory and Applications (Eurocomb), 2013

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

Parameterized Algorithms for Max q-Colorable Induced Subgraph Problem on Perfect Graphs
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
Workshop on Graphs (WG), 2013

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

Upper and Lower Bounds for Weak Backdoor Set Detection
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
International Conference on Theory and Applications of Satisfiability Testing (SAT), 2013

Hitting and Piercing Rectangles Induced by a Point Set
Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra
Annual International Computing and Combinatorics Conference (COCOON), pp. 221-232, 2013

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
Foundations of Computer Science, FOCS, pp. 470-479, 2012

Neeldhara Misra | Personal Home Page

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, pp. 332-343, 2012

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

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

Neeldhara Misra | Personal Home Page

Hitting forbidden minors: Approximation and Kernelization
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
STACS, pp. 189-200, 2011

Neeldhara Misra | Personal Home Page

Imbalance Is Fixed Parameter Tractable
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
Conference on Computing and Combinatorics, COCOON, pp. 199-208, 2010

Neeldhara Misra | Personal Home Page

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

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

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

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

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

Neeldhara Misra | Personal Home Page

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.

Neeldhara Misra | Personal Home Page

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

Neeldhara Misra | Personal Home Page

Kernels for the F-Deletion Problem
Neeldhara Misra
PhD Thesis, 2012

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

Lower bounds on kernelization
Neeldhara Misra, Venkatesh Raman, Saket Saurabh
Discrete Optimization, pp. 110-128, 2011

Neeldhara Misra | Personal Home Page

On The Infeasibility of Polynomial Kernelization
Neeldhara Misra
Masters Thesis, 2009

Neeldhara Misra | Personal Home Page
Neeldhara Misra | Personal Home Page

The Missing Boarding Pass
Neeldhara Misra
Resonance, pp. 662-679, 2008

Neeldhara Misra | Personal Home Page