All author lists are ordered by the alphabetical ordering on last names, as is standard in theoretical computer science, unless marked with an asterisk.

## Refereed Journal Articles

Hitting forbidden minors: Approximation and Kernelization

Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh

SIAM Journal of Discrete Math (SIDMA), pp. 383-410, 2016

Remark: Also appeared at the Symposium on Theoretical Aspects of Computer Science, STACS, 2011

Kernelization complexity of possible winner and coalitional manipulation problems in voting.

Palash Dey, Neeldhara Misra, Y. Narahari

Theoretical Computer Science, pp. 111-125, 2016

Remark: Also appeared at International Conference on Autonomous Agents and Multiagent System, AAMAS, 2015

On the parameterized complexity of finding separators with non-hereditary properties

Pinar Heggernes, Pim Van't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger

Algorithmica, pp. 687-713, 2015

Remark: Also appeared at the Workshop on Graphs, WG, 2012

Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets

Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi

SIAM Journal of Discrete Mathematics (SIDMA), pp. 1815-1836, 2015

Remark: Also appeared at Foundations of Software Technology and Theoretical Computer Science, FSTTCS, 2013

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

Algorithmica, pp. 504-530, 2014

Remark: Also appeared at Foundations of Software Technology and Theoretical Computer Science, FSTTCS, 2010

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 Computer Science Symposium in Russia, CSR, 2009

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

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.

## Peer Reviewed Conference Publications

TwoDots is NP-complete

Neeldhara Misra

8th International Conference on Fun with Algorithms, 2016

Preference Elicitation For Single Crossing Domain

Palash Dey, Neeldhara Misra

25th International Joint Conference on Artificial Intelligence (IJCAI), 2016

Elicitation for Preferences Single Peaked on Trees

Palash Dey, Neeldhara Misra

25th International Joint Conference on Artificial Intelligence (IJCAI), 2016

Complexity of Manipulation with Partial Information

Palash Dey, Neeldhara Misra, Y. Narahari

25th International Joint Conference on Artificial Intelligence (IJCAI), 2016

Frugal Bribery in Voting

Palash Dey, Neeldhara Misra, Y. Narahari

Thirtieth AAAI Conference On Artificial Intelligence (AAAI), 2016

Randomised Procedures for Initialising and Switching Actions in Policy Iteration*

Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan

Thirtieth AAAI Conference On Artificial Intelligence (AAAI), 2016

On the computational hardness of manipulating pairwise voting rules*

Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum

International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2016

Color Spanning Objects - Algorithms and Hardness Results

Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy

Conference on Algorithms and Discrete Applied Mathematics (CALDAM), pp. 37-48, 2016

On the Parameterized Complexity of Minimax Approval Voting

Neeldhara Misra, Arshed Nabeel, Harman Singh

International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2015

Detecting Possible Manipulators in Elections

Palash Dey, Neeldhara Misra, Y. Narahari

International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2015

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

Vikram Kamat, Neeldhara Misra

9th International Conference on Algorithms and Complexity (CIAC), 2015

Solving d-SAT via Backdoors to Small Treewidth

Fedor Fomin, Daniel Lokshtanov, Neeldhara Misra, M.S. Ramanujan, Saket Saurabh

ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015

On the d-Runaway Rectangle Escape Problem

Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty

26th Canadian Conference on Computational Geometry (CCCG), 2014

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

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

UNO Gets Easier for a Single Player

Palash Dey, Prachi Goyal, Neeldhara Misra

Fun With Algorithms (FUN), pp. 147-157, 2014

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

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

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

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

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

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

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

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

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

Imbalance Is Fixed Parameter Tractable

Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh

Conference on Computing and Combinatorics, COCOON, pp. 199-208, 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

## Theses, Workshops, Surveys and Popular Science

On the Parameterized Complexity of Manipulating Pairwise Voting Rules

Rohit Vaish, Neeldhara Misra

3rd Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE), 2016

Kernelization, Planar F-Deletion

Neeldhara Misra

Encyclopedia of Algorithms, 2nd Edition, 2015

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