| 2026 | AAAI | The Cost and Complexity of Minimizing Envy in House Allocations (Abstract Reprint). | Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia |
| 2026 | FUN | Ferry Cover with Connectivity Constraints. | Niranjan Balachandran, Ankita Dargad, Urban Larsson, Neeldhara Misra, Umesh Shankar |
| 2026 | FUN | Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity. | Kshitij Gajjar, Neeldhara Misra |
| 2026 | WALCOM | Can One Flip Spoil it All? | Pragya Arora, Palash Dey, Neeldhara Misra |
| 2025 | FCT | m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs. | Tiziana Calamoneri, Federico Cor, Neeldhara Misra, Saraswati Girish Nanoti, Giacomo Paesani |
| 2024 | COCOON | A Little Aggression Goes a Long Way. | Jyothi Krishnan, Neeldhara Misra, Saraswati Girish Nanoti |
| 2024 | ISAAC | On the Parameterized Complexity of Diverse SAT. | Neeldhara Misra, Harshil Mittal, Ashutosh Rai |
| 2023 | ISAAC | On the Complexity of the Eigenvalue Deletion Problem. | Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar |
| 2023 | IWOCA | Finding Perfect Matching Cuts Faster. | Neeldhara Misra, Yash More |
| 2023 | MFCS | Spartan Bipartite Graphs Are Essentially Elementary. | Neeldhara Misra, Saraswati Girish Nanoti |
| 2023 | SAGT | The Price of Equity with Binary Valuations and Few Agent Types. | Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish |
| 2022 | CSR | Eternal Vertex Cover on Bipartite Graphs. | Jasine Babu, Neeldhara Misra, Saraswati Nanoti |
| 2022 | FUN | Chess Is Hard Even for a Single Player. | N. R. Aravind, Neeldhara Misra, Harshil Mittal |
| 2021 | SOFSEM | Fair Division Is Hard Even for Amicable Agents. | Neeldhara Misra, Aditi Sethia |
| 2020 | COCOON | Imbalance Parameterized by Twin Cover Revisited. | Neeldhara Misra, Harshil Mittal |
| 2020 | IJCAI | On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. | Chinmay Sonar, Palash Dey, Neeldhara Misra |
| 2020 | IWOCA | A Parameterized Perspective on Attacking and Defending Elections. | Kishen N. Gowda, Neeldhara Misra, Vraj Patel |
| 2019 | COCOON | Deleting to Structured Trees. | Pratyush Dayal, Neeldhara Misra |
| 2019 | CSR | On the Parameterized Complexity of Edge-Linked Paths. | Neeldhara Misra, Fahad Panolan, Saket Saurabh |
| 2019 | CSR | The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs. | Neeldhara Misra, Piyush Rathi |
| 2019 | IJCAI | A Parameterized Perspective on Protecting Elections. | Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya |
| 2019 | SOFSEM | On the Complexity of Optimal Matching Reconfiguration. | Manoj Gupta, Hitesh Kumar, Neeldhara Misra |
| 2019 | SOFSEM | Robustness Radius for Chamberlin-Courant on Restricted Domains. | Neeldhara Misra, Chinmay Sonar |
| 2018 | FUN | On the Complexity of Two Dots for Narrow Boards and Few Colors. | Davide Bil, Luciano Gual, Stefano Leucci, Neeldhara Misra |
| 2018 | IWOCA | On the Parameterized Complexity of Colorful Components and Related Problems. | Neeldhara Misra |
| 2017 | ICALP | Saving Critical Nodes with Firefighters is FPT. | Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan |
| 2017 | IWOCA | The Parameterized Complexity of Happy Colorings. | Neeldhara Misra, I. Vinod Reddy |
| 2017 | MFCS | On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard. | Palash Dey, Neeldhara Misra |
| 2016 | AAAI | Frugal Bribery in Voting. | Palash Dey, Neeldhara Misra, Y. Narahari |
| 2016 | AAAI | Randomised Procedures for Initialising and Switching Actions in Policy Iteration. | Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan |
| 2016 | FUN | Two Dots is NP-complete. | Neeldhara Misra |
| 2016 | IJCAI | Elicitation for Preferences Single Peaked on Trees. | Palash Dey, Neeldhara Misra |
| 2016 | IJCAI | Preference Elicitation for Single Crossing Domain. | Palash Dey, Neeldhara Misra |
| 2016 | IJCAI | Complexity of Manipulation with Partial Information in Voting. | Palash Dey, Neeldhara Misra, Y. Narahari |
| 2015 | CIAC | Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints. | Vikram Kamat, Neeldhara Misra |
| 2015 | COCOON | Unique Covering Problems with Geometric Sets. | Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh |
| 2015 | FAW | Graph Modification Problems: A Modern Perspective. | Fedor V. Fomin, Saket Saurabh, Neeldhara Misra |
| 2015 | SODA | Solving | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | AAAI | Backdoors into Heterogeneous Classes of SAT and CSP. | Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivn |
| 2014 | COCOON | Vertex Cover Gets Faster and Harder on Low Degree Graphs. | Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra |
| 2014 | FUN | UNO Gets Easier for a Single Player. | Palash Dey, Prachi Goyal, Neeldhara Misra |
| 2013 | COCOON | Hitting and Piercing Rectangles Induced by a Point Set. | Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra |
| 2013 | MFCS | On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. | Prachi Goyal, Vikram Kamat, Neeldhara Misra |
| 2013 | MFCS | Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? | Neeldhara Misra, Fahad Panolan, Saket Saurabh |
| 2013 | SAT | Upper and Lower Bounds for Weak Backdoor Set Detection. | Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider |
| 2013 | WG | Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. | Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh |
| 2012 | FOCS | Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
| 2012 | WG | On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. | Pinar Heggernes, Pim van 't Hof, Dniel Marx, Neeldhara Misra, Yngve Villanger |
| 2011 | COCOON | On Parameterized Independent Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
| 2011 | IWOCA | Algorithmic Aspects of Dominator Colorings in Graphs. | S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2011 | STACS | Hitting forbidden minors: Approximation and Kernelization. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2010 | COCOON | Imbalance Is Fixed Parameter Tractable. | Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
| 2010 | MFCS | Solving minones-2-sat as Fast as vertex cover. | Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar |
| 2010 | WALCOM | FPT Algorithms for Connected Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2009 | CSR | The Budgeted Unique Coverage Problem and Color-Coding. | Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2008 | ISAAC | Graph Layout Problems Parameterized by Vertex Cover. | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh |