Graph Layout Problems Parameterized by Vertex Cover. - Michael R. Fellows; Daniel Lokshtanov; Neeldhara Misra; Frances A. Rosamond; Saket Saurabh 001 (ISAAC, 2008)

The Budgeted Unique Coverage Problem and Color-Coding. - Neeldhara Misra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (CSR, 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 001 (Theory Comput. Syst., 2009)

The effect of girth on the kernelization complexity of Connected Dominating Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 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 001 (IPEC, 2010)

Solving minones-2-sat as Fast as vertex cover. - Neeldhara Misra; N. S. Narayanaswamy; Venkatesh Raman 001; Bal Sri Shankar (MFCS, 2010)

Algorithmic Aspects of Dominator Colorings in Graphs. - S. Arumugam 001; K. Raja Chandrasekar; Neeldhara Misra; Geevarghese Philip; Saket Saurabh 001 (IWOCA, 2011)

Lower bounds on kernelization. - Neeldhara Misra; Venkatesh Raman 001; Saket Saurabh 001 (Discret. Optim., 2011)

Kernelization - Preprocessing with a Guarantee. - Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (The Multivariate Algorithmic Revolution and Beyond, 2012)

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (FOCS, 2012)

Planar F-Deletion: Approximation and Optimal FPT Algorithms - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (CoRR, 2012)

FPT algorithms for Connected Feedback Vertex Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (J. Comb. Optim., 2012)

On Parameterized Independent Feedback Vertex Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2012)

Hitting and Piercing Rectangles Induced by a Point Set. - Ninad Rajgopal; Pradeesha Ashok; Sathish Govindarajan; Abhijit Khopkar; Neeldhara Misra (COCOON, 2013)

Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. - Prachi Goyal; Neeldhara Misra; Fahad Panolan (FSTTCS, 2013)

Hardness of r-dominating set on Graphs of Diameter (r + 1). - Daniel Lokshtanov; Neeldhara Misra; Geevarghese Philip; M. S. Ramanujan 001; Saket Saurabh 001 (IPEC, 2013)

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. - Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (IPEC, 2013)

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. - Prachi Goyal; Vikram Kamat; Neeldhara Misra (MFCS, 2013)

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? - Neeldhara Misra; Fahad Panolan; Saket Saurabh 001 (MFCS, 2013)

Upper and Lower Bounds for Weak Backdoor Set Detection. - Neeldhara Misra; Sebastian Ordyniak; Venkatesh Raman 001; Stefan Szeider (SAT, 2013)

The Parameterized Complexity of Unique Coverage and Its Variants. - Neeldhara Misra; Hannes Moser; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (Algorithmica, 2013)

On the Parameterized Complexity of the Maximum Edge Coloring Problem. - Prachi Goyal; Vikram Kamat; Neeldhara Misra (CoRR, 2013)

An Erdős–Ko–Rado theorem for matchings in the complete graph - Vikram Kamat; Neeldhara Misra (CoRR, 2013)

Imbalance is fixed parameter tractable. - Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (Inf. Process. Lett., 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 001 (J. Graph Theory, 2013)

Solving min ones 2-sat as fast as vertex cover. - Neeldhara Misra; N. S. Narayanaswamy; Venkatesh Raman 001; Bal Sri Shankar (Theor. Comput. Sci., 2013)

On the d-Runaway Rectangle Escape Problem. - Aniket Basu Roy; Sathish Govindarajan; Neeldhara Misra; Shreyas Shetty (CCCG, 2014)

Vertex Cover Gets Faster and Harder on Low Degree Graphs. - Akanksha Agrawal 001; Sathish Govindarajan; Neeldhara Misra (COCOON, 2014)

UNO Gets Easier for a Single Player. - Palash Dey; Prachi Goyal; Neeldhara Misra (FUN, 2014)

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2014)

Complexity of Kernelization in the Possible Winner Problem. - Palash Dey; Neeldhara Misra; Y. Narahari (CoRR, 2014)

Detecting Possible Manipulators in Elections. - Palash Dey; Neeldhara Misra; Y. Narahari (AAMAS, 2015)

On the Parameterized Complexity of Minimax Approval Voting. - Neeldhara Misra; Arshed Nabeel; Harman Singh (AAMAS, 2015)

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints. - Vikram Kamat; Neeldhara Misra (CIAC, 2015)

Unique Covering Problems with Geometric Sets. - Pradeesha Ashok; Sudeshna Kolay; Neeldhara Misra; Saket Saurabh 001 (COCOON, 2015)

Graph Modification Problems: A Modern Perspective. - Fedor V. Fomin; Saket Saurabh 001; Neeldhara Misra (FAW, 2015)

Solving d-SAT via Backdoors to Small Treewidth. - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; M. S. Ramanujan 001; Saket Saurabh 001 (SODA, 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, 2015)

Manipulation is Harder with Incomplete Votes. - Palash Dey; Neeldhara Misra; Y. Narahari (CoRR, 2015)

On Choosing Committees Based on Approval Votes in the Presence of Outliers. - Palash Dey; Neeldhara Misra; Y. Narahari (CoRR, 2015)

Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. - Prachi Goyal; Neeldhara Misra; Fahad Panolan; Meirav Zehavi (SIAM J. Discret. Math., 2015)

Randomised Procedures for Initialising and Switching Actions in Policy Iteration. - Shivaram Kalyanakrishnan; Neeldhara Misra; Aditya Gopalan (AAAI, 2016)

On the Computational Hardness of Manipulating Pairwise Voting Rules. - Rohit Vaish; Neeldhara Misra; Shivani Agarwal 001; Avrim Blum (AAMAS, 2016)

Two Dots is NP-complete. - Neeldhara Misra (FUN, 2016)

Elicitation for Preferences Single Peaked on Trees. - Palash Dey; Neeldhara Misra (IJCAI, 2016)

Preference Elicitation for Single Crossing Domain. - Palash Dey; Neeldhara Misra (IJCAI, 2016)

The Runaway Rectangle Escape Problem. - Aniket Basu Roy; Anil Maheshwari; Sathish Govindarajan; Neeldhara Misra; Subhas C. Nandy; Shreyas Shetty (CoRR, 2016)

Hitting Forbidden Minors: Approximation and Kernelization. - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; Geevarghese Philip; Saket Saurabh 001 (SIAM J. Discret. Math., 2016)

Kernelization complexity of possible winner and coalitional manipulation problems in voting. - Palash Dey; Neeldhara Misra; Y. Narahari (Theor. Comput. Sci., 2016)

Alternate Parameterizations. - Neeldhara Misra (Encyclopedia of Algorithms, 2016)

Kernelization, Planar F-Deletion. - Neeldhara Misra (Encyclopedia of Algorithms, 2016)

On the Complexity of Chamberlin-Courant on Almost Structured Profiles. - Neeldhara Misra; Chinmay Sonar; P. R. Vaidyanathan (ADT, 2017)

On Structural Parameterizations of Graph Motif and Chromatic Number. - Bireswar Das; Murali Krishna Enduri; Neeldhara Misra; I. Vinod Reddy (CALDAM, 2017)

Saving Critical Nodes with Firefighters is FPT. - Jayesh Choudhari; Anirban Dasgupta 001; Neeldhara Misra; M. S. Ramanujan 001 (ICALP, 2017)

The Parameterized Complexity of Happy Colorings. - Neeldhara Misra; I. Vinod Reddy (IWOCA, 2017)

Backdoors into heterogeneous classes of SAT and CSP. - Serge Gaspers; Neeldhara Misra; Sebastian Ordyniak; Stefan Szeider; Stanislav Zivný (J. Comput. Syst. Sci., 2017)

Frugal bribery in voting. - Palash Dey; Neeldhara Misra; Y. Narahari (Theor. Comput. Sci., 2017)

On Structural Parameterizations of Firefighting. - Bireswar Das; Murali Krishna Enduri; Neeldhara Misra; I. Vinod Reddy (CALDAM, 2018)

On the Complexity of Two Dots for Narrow Boards and Few Colors. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Neeldhara Misra (FUN, 2018)

On the Parameterized Complexity of Colorful Components and Related Problems. - Neeldhara Misra (IWOCA, 2018)

Complexity of manipulation with partial information in voting. - Palash Dey; Neeldhara Misra; Y. Narahari (Theor. Comput. Sci., 2018)

On the Parameterized Complexity of Party Nominations. - Neeldhara Misra (ADT, 2019)

Deleting to Structured Trees. - Pratyush Dayal; Neeldhara Misra (COCOON, 2019)

On the Parameterized Complexity of Edge-Linked Paths. - Neeldhara Misra; Fahad Panolan; Saket Saurabh 001 (CSR, 2019)

The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs. - Neeldhara Misra; Piyush Rathi (CSR, 2019)

On the Complexity of Optimal Matching Reconfiguration. - Manoj Gupta 002; Hitesh Kumar; Neeldhara Misra (SOFSEM, 2019)

Robustness Radius for Chamberlin-Courant on Restricted Domains. - Neeldhara Misra; Chinmay Sonar (SOFSEM, 2019)

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. - Neeldhara Misra; Fahad Panolan; Ashutosh Rai 001; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2019)

On structural parameterizations of firefighting. - Bireswar Das; Murali Krishna Enduri; Masashi Kiyomi; Neeldhara Misra; Yota Otachi; I. Vinod Reddy; Shunya Yoshimura (Theor. Comput. Sci., 2019)

Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. - Palash Dey; Neeldhara Misra; Y. Narahari (Theor. Comput. Sci., 2019)

On the Parameterized Complexity of Spanning Trees with Small Vertex Covers. - Chamanvir Kaur; Neeldhara Misra (CALDAM, 2020)

Red-Blue Point Separation for Points on a Circle. - Neeldhara Misra; Harshil Mittal; Aditi Sethia (CCCG, 2020)

Fair Division is Hard even for Amicable Agents. - Neeldhara Misra; Aditi Sethia (ICTCS, 2020)

On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. - Chinmay Sonar; Palash Dey; Neeldhara Misra (IJCAI, 2020)

A Parameterized Perspective on Attacking and Defending Elections. - Kishen N. Gowda; Neeldhara Misra; Vraj Patel 001 (IWOCA, 2020)

Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors. - Neeldhara Misra; Frances A. Rosamond; Meirav Zehavi (Algorithms, 2020)

Color spanning objects: Algorithms and hardness results. - Sandip Banerjee; Neeldhara Misra; Subhas C. Nandy (Discret. Appl. Math., 2020)

Subexponential algorithm for d-cluster edge deletion: Exception or rule? - Neeldhara Misra; Fahad Panolan; Saket Saurabh 001 (J. Comput. Syst. Sci., 2020)

Parameterized complexity of happy coloring problems. - Akanksha Agrawal 001; N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri; Neeldhara Misra; I. Vinod Reddy (Theor. Comput. Sci., 2020)

Equitable Division of a Path. - Neeldhara Misra; Chinmay Sonar; P. R. Vaidyanathan; Rohit Vaish (CoRR, 2021)

A parameterized perspective on protecting elections. - Palash Dey; Neeldhara Misra; Swaprava Nath; Garima Shakya (Theor. Comput. Sci., 2021)

Imbalance parameterized by twin cover revisited. - Neeldhara Misra; Harshil Mittal (Theor. Comput. Sci., 2021)

On Fair Division with Binary Valuations Respecting Social Networks. - Neeldhara Misra; Debanuj Nayak (CALDAM, 2022)

Diverse Non Crossing Matchings. - Neeldhara Misra; Harshil Mittal; Saraswati Nanoti (CCCG, 2022)

Eternal Vertex Cover on Bipartite Graphs. - Jasine Babu; Neeldhara Misra; Saraswati Nanoti (CSR, 2022)

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs. - Neeldhara Misra; Saraswati Nanoti (CoRR, 2022)

Exact Multi-Covering Problems with Geometric Sets. - Pradeesha Ashok; Sudeshna Kolay; Neeldhara Misra; Saket Saurabh 001 (Theory Comput. Syst., 2022)

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). - Maria Chudnovsky; Neeldhara Misra; Daniël Paulusma; Oliver Schaudt; Akanksha Agrawal 001 (Dagstuhl Reports, 2022)

The Complexity of Minimizing Envy in House Allocation. - Jayakrishnan Madathil; Neeldhara Misra; Aditi Sethia (AAMAS, 2023)

On the Complexity of the Eigenvalue Deletion Problem. - Neeldhara Misra; Harshil Mittal; Saket Saurabh 001; Dhara Thakkar (ISAAC, 2023)

Finding Perfect Matching Cuts Faster. - Neeldhara Misra; Yash More (IWOCA, 2023)

Spartan Bipartite Graphs Are Essentially Elementary. - Neeldhara Misra; Saraswati Girish Nanoti (MFCS, 2023)

The Price of Equity with Binary Valuations and Few Agent Types. - Umang Bhaskar; Neeldhara Misra; Aditi Sethia; Rohit Vaish (SAGT, 2023)

On the exact amount of missing information that makes finding possible winners hard. - Palash Dey; Neeldhara Misra (J. Comput. Syst. Sci., 2023)

Envy-Free and Efficient Allocations for Graphical Valuations. - Neeldhara Misra; Aditi Sethia (ADT, 2024)

Opinion Diffusion on Society Graphs Based on Approval Ballots. - Jayakrishnan Madathil; Neeldhara Misra; Yash More (AAMAS, 2024)

Parameterized Aspects of Distinct Kemeny Rank Aggregation. - Koustav De; Harshil Mittal; Palash Dey; Neeldhara Misra (CALDAM, 2024)

A Little Aggression Goes a Long Way. - Jyothi Krishnan; Neeldhara Misra; Saraswati Girish Nanoti (CoRR, 2024)

The Cost and Complexity of Minimizing Envy in House Allocation. - Jayakrishnan Madathil; Neeldhara Misra; Aditi Sethia (CoRR, 2024)

Chess is hard even for a single player. - N. R. Aravind; Neeldhara Misra; Harshil Mittal (Theor. Comput. Sci., 2024)

Romeo and Juliet Meeting in Forest Like Regions. - Neeldhara Misra; Manas Mulpuri; Prafullkumar Tale; Gaurav Viramgami (Algorithmica, 2024)