Also see: DBLP Page | Google Scholar
A Parameterized Perspective on Attacking and Defending Elections.
Kishen N. Gowda, Neeldhara Misra, Vraj Patel
Imbalance Parameterized by Twin Cover Revisited.
Neeldhara Misra, Harshil Mittal
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.
Chinmay Sonar, Palash Dey, Neeldhara Misra
On the Parameterized Complexity of Spanning Trees with Small Vertex Covers.
Chamanvir Kaur, Neeldhara Misra
Red-Blue Point Separation for Points on a Circle.
Neeldhara Misra, Harshil Mittal, Aditi Sethia
A Parameterized Perspective on Protecting Elections.
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
Deleting to Structured Trees.
Pratyush Dayal, Neeldhara Misra
On the Complexity of Optimal Matching Reconfiguration.
Manoj Gupta, Hitesh Kumar, Neeldhara Misra
On the Parameterized Complexity of Edge-Linked Paths.
Neeldhara Misra, Fahad Panolan, Saket Saurabh
On the Parameterized Complexity of Party Nominations.
Neeldhara Misra
Robustness Radius for Chamberlin-Courant on Restricted Domains.
Neeldhara Misra, Chinmay Sonar
The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.
Neeldhara Misra, Piyush Rathi
On the Complexity of Two Dots for Narrow Boards and Few Colors.
Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra
On the Parameterized Complexity of Colorful Components and Related Problems.
Neeldhara Misra
On Structural Parameterizations of Firefighting.
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Graph Motif and Chromatic Number.
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On the Complexity of Chamberlin-Courant on Almost Structured Profiles.
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan
Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers.
Palash Dey, Neeldhara Misra, Y. Narahari
Saving Critical Nodes with Firefighters is FPT.
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
The Parameterized Complexity of Happy Colorings.
Neeldhara Misra, I. Vinod Reddy
Alternate Parameterizations.
Neeldhara Misra
Color Spanning Objects - Algorithms and Hardness Results.
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
Complexity of Manipulation with Partial Information in Voting.
Palash Dey, Neeldhara Misra, Y. Narahari
Elicitation for Preferences Single Peaked on Trees.
Palash Dey, Neeldhara Misra
Kernelization, Planar F-Deletion.
Neeldhara Misra
On the Computational Hardness of Manipulating Pairwise Voting Rules.
Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard.
Palash Dey, Neeldhara Misra
Preference Elicitation For Single Crossing Domain.
Palash Dey, Neeldhara Misra
Randomised Procedures for Initialising and Switching Actions in Policy Iteration.
Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan
The Runaway Rectangle Escape Problem.
Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty
Two Dots is NP-complete.
Neeldhara Misra
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.
Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi
Frugal Bribery in Voting.
Palash Dey, Neeldhara Misra, Y. Narahari
Graph Modification Problems - A Modern Perspective.
Fedor V. Fomin, Saket Saurabh, Neeldhara Misra
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting.
Palash Dey, Neeldhara Misra, Y. Narahari
Manipulation is Harder with Incomplete Votes.
Palash Dey, Neeldhara Misra, Y. Narahari
On Choosing Committees Based on Approval Votes in the Presence of Outliers.
Palash Dey, Neeldhara Misra, Y. Narahari
On the Parameterized Complexity of Minimax Approval Voting.
Neeldhara Misra, Arshed Nabeel, Harman Singh
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints.
Vikram Kamat, Neeldhara Misra
Solving d-SAT via Backdoors to Small Treewidth.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh
Unique Covering Problems with Geometric Sets.
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
Backdoors into Heterogeneous Classes of SAT and CSP.
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny
Complexity of Kernelization in the Possible Winner Problem.
Palash Dey, Neeldhara Misra, Y. Narahari
Detecting Possible Manipulators in Elections.
Palash Dey, Neeldhara Misra, Y. Narahari
On the d-Runaway Rectangle Escape Problem.
Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
UNO Gets Easier for a Single Player.
Palash Dey, Prachi Goyal, Neeldhara Misra
Vertex Cover Gets Faster and Harder on Low Degree Graphs.
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra
An Erdős--Ko--Rado theorem for matchings in the complete graph.
Vikram Kamat, Neeldhara Misra
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.
Prachi Goyal, Neeldhara Misra, Fahad Panolan
Hardness of r-dominating set on Graphs of Diameter (r + 1).
Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh
Hitting and Piercing Rectangles Induced by a Point Set.
Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.
Prachi Goyal, Vikram Kamat, Neeldhara Misra
On the Parameterized Complexity of the Maximum Edge Coloring Problem.
Prachi Goyal, Vikram Kamat, Neeldhara Misra
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
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
Solving min ones 2-sat as fast as vertex cover.
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
Subexponential Algorithm for d-Cluster Edge Deletion - Exception or Rule?
Neeldhara Misra, Fahad Panolan, Saket Saurabh
The Parameterized Complexity of Unique Coverage and Its Variants.
Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
Upper and Lower Bounds for Weak Backdoor Set Detection.
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
Kernelization - Preprocessing with a Guarantee.
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
Planar F-Deletion - Approximation and Optimal FPT Algorithms.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
Planar F-Deletion - Approximation, Kernelization and Optimal FPT Algorithms.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
Algorithmic Aspects of Dominator Colorings in Graphs.
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Lower bounds on kernelization.
Neeldhara Misra, Venkatesh Raman, Saket Saurabh
On Parameterized Independent Feedback Vertex Set.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
Hitting forbidden minors - Approximation and Kernelization.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Imbalance Is Fixed Parameter Tractable.
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
On the Kernelization Complexity of Colorful Motifs.
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan
Solving minones-2-sat as Fast as vertex cover.
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
The effect of girth on the kernelization complexity of Connected Dominating Set.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
FPT Algorithms for Connected Feedback Vertex Set.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
The Budgeted Unique Coverage Problem and Color-Coding.
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
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
Graph Layout Problems Parameterized by Vertex Cover.
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh