Neeldhara Misra

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 86

Top Venues

Publications

N. R. Aravind, Neeldhara Misra, Harshil Mittal
Chess is hard even for a single player. Theor. Comput. Sci. 1015 (2024)
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
The Cost and Complexity of Minimizing Envy in House Allocation. CoRR (2024)
Jayakrishnan Madathil, Neeldhara Misra, Yash More
Opinion Diffusion on Society Graphs Based on Approval Ballots. AAMAS (2024)
Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CALDAM (2024)
Jyothi Krishnan, Neeldhara Misra, Saraswati Girish Nanoti
A Little Aggression Goes a Long Way. CoRR (2024)
Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar
On the Complexity of the Eigenvalue Deletion Problem. CoRR (2023)
Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish
The Price of Equity with Binary Valuations and Few Agent Types. CoRR (2023)
Neeldhara Misra, Saraswati Girish Nanoti
Spartan Bipartite Graphs are Essentially Elementary. CoRR (2023)
Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CoRR (2023)
Palash Dey, Neeldhara Misra
On the exact amount of missing information that makes finding possible winners hard. J. Comput. Syst. Sci. 135 (2023)
Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish
The Price of Equity with Binary Valuations and Few Agent Types. SAGT (2023)
Neeldhara Misra, Saraswati Girish Nanoti
Spartan Bipartite Graphs Are Essentially Elementary. MFCS (2023)
Neeldhara Misra, Yash More
Finding Perfect Matching Cuts Faster. IWOCA (2023)
Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar
On the Complexity of the Eigenvalue Deletion Problem. ISAAC (2023)
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
The Complexity of Minimizing Envy in House Allocation. AAMAS (2023)
Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports 12 (11) (2022)
N. R. Aravind, Neeldhara Misra, Harshil Mittal
Chess is hard even for a single player. CoRR (2022)
Neeldhara Misra, Harshil Mittal, Saraswati Nanoti
Diverse Non Crossing Matchings. CCCG (2022)
Neeldhara Misra, Debanuj Nayak
On Fair Division with Binary Valuations Respecting Social Networks. CALDAM (2022)
Jasine Babu, Neeldhara Misra, Saraswati Nanoti
Eternal Vertex Cover on Bipartite Graphs. CSR (2022)
N. R. Aravind, Neeldhara Misra, Harshil Mittal
Chess Is Hard Even for a Single Player. FUN (2022)
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. 66 (1) (2022)
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
Romeo and Juliet Meeting in Forest Like Regions. CoRR (2022)
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
Romeo and Juliet Meeting in Forest like Regions. FSTTCS (2022)
Neeldhara Misra, Saraswati Nanoti
Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs. CoRR (2022)
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
A parameterized perspective on protecting elections. Theor. Comput. Sci. 874 (2021)
Neeldhara Misra, Harshil Mittal
Imbalance parameterized by twin cover revisited. Theor. Comput. Sci. 895 (2021)
Neeldhara Misra, Aditi Sethia
Fair Division Is Hard Even for Amicable Agents. SOFSEM (2021)
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish
Equitable Division of a Path. CoRR (2021)
Neeldhara Misra, Debanuj Nayak
On Fair Division with Binary Valuations Respecting Social Networks. CoRR (2021)
Neeldhara Misra, Aditi Sethia
Fair Division is Hard even for Amicable Agents. ICTCS (2020)
Neeldhara Misra, Harshil Mittal
Imbalance Parameterized by Twin Cover Revisited. COCOON (2020)
Chamanvir Kaur, Neeldhara Misra
On the Parameterized Complexity of Spanning Trees with Small Vertex Covers. CALDAM (2020)
Chinmay Sonar, Palash Dey, Neeldhara Misra
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. IJCAI (2020)
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
Color spanning objects: Algorithms and hardness results. Discret. Appl. Math. 280 (2020)
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835 (2020)
Chinmay Sonar, Palash Dey, Neeldhara Misra
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. CoRR (2020)
Neeldhara Misra, Harshil Mittal, Aditi Sethia
Red-Blue Point Separation for Points on a Circle. CCCG (2020)
Neeldhara Misra, Harshil Mittal
Imbalance Parameterized by Twin Cover Revisited. CoRR (2020)
Kishen N. Gowda, Neeldhara Misra, Vraj Patel
A Parameterized Perspective on Attacking and Defending Elections. CoRR (2020)
Kishen N. Gowda, Neeldhara Misra, Vraj Patel
A Parameterized Perspective on Attacking and Defending Elections. IWOCA (2020)
Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors. Algorithms 13 (9) (2020)
Neeldhara Misra, Fahad Panolan, Saket Saurabh
-cluster edge deletion: Exception or rule? J. Comput. Syst. Sci. 113 (2020)
Neeldhara Misra, Harshil Mittal, Aditi Sethia
Red-Blue Point Separation for Points on a Circle. CoRR (2020)
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
A Parameterized Perspective on Protecting Elections. IJCAI (2019)
Neeldhara Misra, Fahad Panolan, Saket Saurabh
On the Parameterized Complexity of Edge-Linked Paths. CSR (2019)
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
A Parameterized Perspective on Protecting Elections. CoRR (2019)
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81 (1) (2019)
Pratyush Dayal, Neeldhara Misra
Deleting to Structured Trees. COCOON (2019)
Pratyush Dayal, Neeldhara Misra
Deleting to Structured Trees. CoRR (2019)
Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura
On structural parameterizations of firefighting. Theor. Comput. Sci. 782 (2019)
Neeldhara Misra
On the Parameterized Complexity of Party Nominations. ADT (2019)
Palash Dey, Neeldhara Misra, Y. Narahari
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. Theor. Comput. Sci. 783 (2019)
Neeldhara Misra, Chinmay Sonar
Robustness Radius for Chamberlin-Courant on Restricted Domains. SOFSEM (2019)
Neeldhara Misra, Piyush Rathi
The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs. CSR (2019)
Manoj Gupta, Hitesh Kumar, Neeldhara Misra
On the Complexity of Optimal Matching Reconfiguration. SOFSEM (2019)
Palash Dey, Neeldhara Misra, Y. Narahari
Complexity of manipulation with partial information in voting. Theor. Comput. Sci. 726 (2018)
Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra
On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN (2018)
Neeldhara Misra
On the Parameterized Complexity of Colorful Components and Related Problems. IWOCA (2018)
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Firefighting. CALDAM (2018)
Palash Dey, Neeldhara Misra, Y. Narahari
Frugal bribery in voting. Theor. Comput. Sci. 676 (2017)
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Firefighting. CoRR (2017)
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
Saving Critical Nodes with Firefighters is FPT. CoRR (2017)
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85 (2017)
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
Saving Critical Nodes with Firefighters is FPT. ICALP (2017)
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan
On the Complexity of Chamberlin-Courant on Almost Structured Profiles. ADT (2017)
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Graph Motif and Chromatic Number. CALDAM (2017)
Neeldhara Misra, I. Vinod Reddy
The Parameterized Complexity of Happy Colorings. IWOCA (2017)
Neeldhara Misra, I. Vinod Reddy
The Parameterized Complexity of Happy Colorings. CoRR (2017)
Palash Dey, Neeldhara Misra
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard. MFCS (2017)
Palash Dey, Neeldhara Misra, Y. Narahari
Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers. AAMAS (2017)
Palash Dey, Neeldhara Misra
Preference Elicitation For Single Crossing Domain. CoRR (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Complexity of Manipulation with Partial Information in Voting. CoRR (2016)
Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan
Randomised Procedures for Initialising and Switching Actions in Policy Iteration. AAAI (2016)
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
Color Spanning Objects: Algorithms and Hardness Results. CALDAM (2016)
Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty
The Runaway Rectangle Escape Problem. CoRR (2016)
Palash Dey, Neeldhara Misra
Preference Elicitation for Single Crossing Domain. IJCAI (2016)
Neeldhara Misra
Two Dots is NP-complete. FUN (2016)
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. 30 (1) (2016)
Palash Dey, Neeldhara Misra
Elicitation for Preferences Single Peaked on Trees. IJCAI (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Frugal Bribery in Voting. AAAI (2016)
Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum
On the Computational Hardness of Manipulating Pairwise Voting Rules. AAMAS (2016)
Palash Dey, Neeldhara Misra
Elicitation for Preferences Single Peaked on Trees. CoRR (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Kernelization complexity of possible winner and coalitional manipulation problems in voting. Theor. Comput. Sci. 616 (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Complexity of Manipulation with Partial Information in Voting. IJCAI (2016)
Palash Dey, Neeldhara Misra
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard. CoRR (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Frugal Bribery in Voting. CoRR (2015)
Neeldhara Misra, Arshed Nabeel, Harman Singh
On the Parameterized Complexity of Minimax Approval Voting. AAMAS (2015)
Palash Dey, Neeldhara Misra, Y. Narahari
Detecting Possible Manipulators in Elections. AAMAS (2015)
Palash Dey, Neeldhara Misra, Y. Narahari
Manipulation is Harder with Incomplete Votes. CoRR (2015)
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh
SAT via Backdoors to Small Treewidth. SODA (2015)
Vikram Kamat, Neeldhara Misra
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints. CIAC (2015)
Palash Dey, Neeldhara Misra, Y. Narahari
On Choosing Committees Based on Approval Votes in the Presence of Outliers. CoRR (2015)
Fedor V. Fomin, Saket Saurabh, Neeldhara Misra
Graph Modification Problems: A Modern Perspective. FAW (2015)
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
Unique Covering Problems with Geometric Sets. COCOON (2015)
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica 72 (3) (2015)
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
Backdoors into Heterogeneous Classes of SAT and CSP. CoRR (2015)
Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. SIAM J. Discret. Math. 29 (4) (2015)
Palash Dey, Neeldhara Misra, Y. Narahari
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting. AAMAS (2015)
Palash Dey, Neeldhara Misra, Y. Narahari
Detecting Possible Manipulators in Elections. CoRR (2014)

Neeldhara Misra.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Neeldhara Misra