Publications

Also see: DBLP Page | Google Scholar

CoRR abs/2005.03176 (2020)

A Parameterized Perspective on Attacking and Defending Elections.

Kishen N. Gowda, Neeldhara Misra, Vraj Patel

CoRR abs/2005.03800 (2020)

Imbalance Parameterized by Twin Cover Revisited.

Neeldhara Misra, Harshil Mittal

CoRR abs/2004.13933 (2020)

On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.

Chinmay Sonar, Palash Dey, Neeldhara Misra

CALDAM 2020, 427-438

On the Parameterized Complexity of Spanning Trees with Small Vertex Covers.

Chamanvir Kaur, Neeldhara Misra

CoRR abs/2005.06046 (2020)

Red-Blue Point Separation for Points on a Circle.

Neeldhara Misra, Harshil Mittal, Aditi Sethia

CoRR abs/1905.11838 (2019)

A Parameterized Perspective on Protecting Elections.

Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya

CoRR abs/1912.12765 (2019)

Deleting to Structured Trees.

Pratyush Dayal, Neeldhara Misra

SOFSEM 2019, 221-233

On the Complexity of Optimal Matching Reconfiguration.

Manoj Gupta, Hitesh Kumar, Neeldhara Misra

CSR 2019, 286-298

On the Parameterized Complexity of Edge-Linked Paths.

Neeldhara Misra, Fahad Panolan, Saket Saurabh

ADT 2019, 112-125

On the Parameterized Complexity of Party Nominations.

Neeldhara Misra

SOFSEM 2019, 341-353

Robustness Radius for Chamberlin-Courant on Restricted Domains.

Neeldhara Misra, Chinmay Sonar

CSR 2019, 299-310

The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.

Neeldhara Misra, Piyush Rathi

FUN 2018, 7:1-7:15

On the Complexity of Two Dots for Narrow Boards and Few Colors.

Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra

IWOCA 2018, 237-249

On the Parameterized Complexity of Colorful Components and Related Problems.

Neeldhara Misra

CoRR abs/1711.10227 (2017)

On Structural Parameterizations of Firefighting.

Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy

CALDAM 2017, 118-129

On Structural Parameterizations of Graph Motif and Chromatic Number.

Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy

ADT 2017, 124-138

On the Complexity of Chamberlin-Courant on Almost Structured Profiles.

Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan

AAMAS 2017, 42-50

Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers.

Palash Dey, Neeldhara Misra, Y. Narahari

CoRR abs/1705.10923 (2017)

Saving Critical Nodes with Firefighters is FPT.

Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan

CoRR abs/1708.03853 (2017)

The Parameterized Complexity of Happy Colorings.

Neeldhara Misra, I. Vinod Reddy

Encyclopedia of Algorithms 2016, 64-67

Alternate Parameterizations.

Neeldhara Misra

CALDAM 2016, 37-48

Color Spanning Objects - Algorithms and Hardness Results.

Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy

CoRR abs/1604.04359 (2016)

Complexity of Manipulation with Partial Information in Voting.

Palash Dey, Neeldhara Misra, Y. Narahari

CoRR abs/1604.04403 (2016)

Elicitation for Preferences Single Peaked on Trees.

Palash Dey, Neeldhara Misra

Encyclopedia of Algorithms 2016, 1033-1036

Kernelization, Planar F-Deletion.

Neeldhara Misra

AAMAS 2016, 358-367

On the Computational Hardness of Manipulating Pairwise Voting Rules.

Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum

CoRR abs/1610.08407 (2016)

On the Exact Amount of Missing Information that makes Finding Possible Winners Hard.

Palash Dey, Neeldhara Misra

CoRR abs/1604.05194 (2016)

Preference Elicitation For Single Crossing Domain.

Palash Dey, Neeldhara Misra

AAAI 2016, 3145-3151

Randomised Procedures for Initialising and Switching Actions in Policy Iteration.

Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan

CoRR abs/1603.04210 (2016)

The Runaway Rectangle Escape Problem.

Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty

FUN 2016, 24:1-24:12

Two Dots is NP-complete.

Neeldhara Misra

SIAM J. Discret. Math. 29(4), 1815-1836 (2015)

Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.

Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi

CoRR abs/1504.08248 (2015)

Frugal Bribery in Voting.

Palash Dey, Neeldhara Misra, Y. Narahari

FAW 2015, 3-6

Graph Modification Problems - A Modern Perspective.

Fedor V. Fomin, Saket Saurabh, Neeldhara Misra

AAMAS 2015, 87-96

Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting.

Palash Dey, Neeldhara Misra, Y. Narahari

CoRR abs/1504.08256 (2015)

Manipulation is Harder with Incomplete Votes.

Palash Dey, Neeldhara Misra, Y. Narahari

CoRR abs/1511.04190 (2015)

On Choosing Committees Based on Approval Votes in the Presence of Outliers.

Palash Dey, Neeldhara Misra, Y. Narahari

AAMAS 2015, 97-105

On the Parameterized Complexity of Minimax Approval Voting.

Neeldhara Misra, Arshed Nabeel, Harman Singh

CIAC 2015, 249-260

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

Vikram Kamat, Neeldhara Misra

SODA 2015, 630-641

Solving d-SAT via Backdoors to Small Treewidth.

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

COCOON 2015, 548-558

Unique Covering Problems with Geometric Sets.

Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh

AAAI 2014, 2652-2658

Backdoors into Heterogeneous Classes of SAT and CSP.

Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny

CoRR abs/1405.3865 (2014)

Complexity of Kernelization in the Possible Winner Problem.

Palash Dey, Neeldhara Misra, Y. Narahari

CoRR abs/1404.2367 (2014)

Detecting Possible Manipulators in Elections.

Palash Dey, Neeldhara Misra, Y. Narahari

CCCG 2014

On the d-Runaway Rectangle Escape Problem.

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

Algorithmica 68(2), 504-530 (2014)

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

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

FUN 2014, 147-157

UNO Gets Easier for a Single Player.

Palash Dey, Prachi Goyal, Neeldhara Misra

CoRR abs/1404.5566 (2014)

Vertex Cover Gets Faster and Harder on Low Degree Graphs.

Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra

CoRR abs/1303.4061 (2013)

An Erdős--Ko--Rado theorem for matchings in the complete graph.

Vikram Kamat, Neeldhara Misra

FSTTCS 2013, 237-248

Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.

Prachi Goyal, Neeldhara Misra, Fahad Panolan

IPEC 2013, 255-267

Hardness of r-dominating set on Graphs of Diameter (r + 1).

Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh

COCOON 2013, 221-232

Hitting and Piercing Rectangles Induced by a Point Set.

Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra

IPEC 2013, 243-254

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.

Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh

MFCS 2013, 492-503

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.

Prachi Goyal, Vikram Kamat, Neeldhara Misra

CoRR abs/1306.2931 (2013)

On the Parameterized Complexity of the Maximum Edge Coloring Problem.

Prachi Goyal, Vikram Kamat, Neeldhara Misra

WG 2013, 370-381

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.

Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh

Journal of Graph Theory 74(4), 417-424 (2013)

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

Theor. Comput. Sci. 506, 115-121 (2013)

Solving min ones 2-sat as fast as vertex cover.

Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar

MFCS 2013, 679-690

Subexponential Algorithm for d-Cluster Edge Deletion - Exception or Rule?

Neeldhara Misra, Fahad Panolan, Saket Saurabh

Algorithmica 65(3), 517-544 (2013)

The Parameterized Complexity of Unique Coverage and Its Variants.

Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

CoRR abs/1304.5518 (2013)

Upper and Lower Bounds for Weak Backdoor Set Detection.

Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider

The Multivariate Algorithmic Revolution and Beyond 2012, 129-161

Kernelization - Preprocessing with a Guarantee.

Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh

WG 2012, 332-343

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.

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

CoRR abs/1204.4230 (2012)

Planar F-Deletion - Approximation and Optimal FPT Algorithms.

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

FOCS 2012, 470-479

Planar F-Deletion - Approximation, Kernelization and Optimal FPT Algorithms.

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

IWOCA 2011, 19-30

Algorithmic Aspects of Dominator Colorings in Graphs.

S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh

Discret. Optim. 8(1), 110-128 (2011)

Lower bounds on kernelization.

Neeldhara Misra, Venkatesh Raman, Saket Saurabh

COCOON 2011, 98-109

On Parameterized Independent Feedback Vertex Set.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

CoRR abs/1010.1365 (2010)

Hitting forbidden minors - Approximation and Kernelization.

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

COCOON 2010, 199-208

Imbalance Is Fixed Parameter Tractable.

Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh

IPEC 2010, 14-25

On the Kernelization Complexity of Colorful Motifs.

Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan

MFCS 2010, 549-555

Solving minones-2-sat as Fast as vertex cover.

Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar

FSTTCS 2010, 96-107

The effect of girth on the kernelization complexity of Connected Dominating Set.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

CoRR abs/0909.3180 (2009)

FPT Algorithms for Connected Feedback Vertex Set.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

CSR 2009, 310-321

The Budgeted Unique Coverage Problem and Color-Coding.

Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Theory Comput. Syst. 45(4), 822-848 (2009)

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

ISAAC 2008, 294-305

Graph Layout Problems Parameterized by Vertex Cover.

Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh

Icon