Neeldhara Misra

162 papers A* 12A 9B 21C 6Misc 16Journal 76Unranked 19
YearRankTypeTitle / Venue / Authors
2026 — ed.
Algorithms and Discrete Applied Mathematics - 12th International Conference, CALDAM 2026, Dharwad, India, February 12-14, 2026, Proceedings
CALDAM
Neeldhara Misra, Arti Pandey
2026 B conf
Can One Flip Spoil it All?
WALCOM
Pragya Arora, Palash Dey, Neeldhara Misra
2026 J jnl
On the parameterized complexity of diverse SAT.
Theor. Comput. Sci.
Neeldhara Misra, Harshil Mittal, Ashutosh Rai
2026 J jnl
Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity.
CoRR
Kshitij Gajjar, Neeldhara Misra
2026 A* conf
The Cost and Complexity of Minimizing Envy in House Allocations (Abstract Reprint).
AAAI
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
2025 — conf
A Characterization of Spartan Graphs and New Lower Bounds for Eternal Vertex Cover.
FSTTCS
Neeldhara Misra, Saraswati Girish Nanoti
2025 J jnl
On a Characterization of Spartan Graphs.
CoRR
Neeldhara Misra, Saraswati Girish Nanoti
2025 J jnl
The Cost and Complexity of Minimizing Envy in House Allocation.
Auton. Agents Multi Agent Syst.
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
2025 B conf
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs.
FCT
Tiziana Calamoneri, Federico Corò, Neeldhara Misra, Saraswati Girish Nanoti, Giacomo Paesani
2025 J jnl
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs.
CoRR
Tiziana Calamoneri, Federico Corò, Neeldhara Misra, Saraswati Girish Nanoti, Giacomo Paesani
2024 — conf
A Little Aggression Goes a Long Way.
COCOON (1)
Jyothi Krishnan, Neeldhara Misra, Saraswati Girish Nanoti
2024 J jnl
A Little Aggression Goes a Long Way.
CoRR
Jyothi Krishnan, Neeldhara Misra, Saraswati Girish Nanoti
2024 J jnl
Chess is hard even for a single player.
Theor. Comput. Sci.
N. R. Aravind, Neeldhara Misra, Harshil Mittal
2024 — conf
Envy-Free and Efficient Allocations for Graphical Valuations.
ADT
Neeldhara Misra, Aditi Sethia
2024 J jnl
Envy-Free and Efficient Allocations for Graphical Valuations.
CoRR
Neeldhara Misra, Aditi Sethia
2024 B conf
On the Parameterized Complexity of Diverse SAT.
ISAAC
Neeldhara Misra, Harshil Mittal, Ashutosh Rai
2024 J jnl
On the Parameterized Complexity of Diverse SAT.
CoRR
Neeldhara Misra, Harshil Mittal, Ashutosh Rai
2024 A conf
Opinion Diffusion on Society Graphs Based on Approval Ballots.
AAMAS
Jayakrishnan Madathil, Neeldhara Misra, Yash More
2024 — conf
Parameterized Aspects of Distinct Kemeny Rank Aggregation.
CALDAM
Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra
2024 J jnl
Parameterized aspects of distinct Kemeny rank aggregation.
Acta Informatica
Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra
2024 J jnl
Romeo and Juliet Meeting in Forest Like Regions.
Algorithmica
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
2024 J jnl
The Cost and Complexity of Minimizing Envy in House Allocation.
CoRR
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
2023 B ed.
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, The Netherlands, September 6-8, 2023
IPEC
Neeldhara Misra, Magnus Wahlström
2023 C conf
Finding Perfect Matching Cuts Faster.
IWOCA
Neeldhara Misra, Yash More
2023 B conf
On the Complexity of the Eigenvalue Deletion Problem.
ISAAC
Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar
2023 J jnl
On the Complexity of the Eigenvalue Deletion Problem.
CoRR
Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar
2023 J jnl
On the exact amount of missing information that makes finding possible winners hard.
J. Comput. Syst. Sci.
Palash Dey, Neeldhara Misra
2023 J jnl
Parameterized Aspects of Distinct Kemeny Rank Aggregation.
CoRR
Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra
2023 B conf
Spartan Bipartite Graphs Are Essentially Elementary.
MFCS
Neeldhara Misra, Saraswati Girish Nanoti
2023 J jnl
Spartan Bipartite Graphs are Essentially Elementary.
CoRR
Neeldhara Misra, Saraswati Girish Nanoti
2023 A conf
The Complexity of Minimizing Envy in House Allocation.
AAMAS
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
2023 B conf
The Price of Equity with Binary Valuations and Few Agent Types.
SAGT
Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish
2023 J jnl
The Price of Equity with Binary Valuations and Few Agent Types.
CoRR
Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish
2022 Misc conf
Chess Is Hard Even for a Single Player.
FUN
N. R. Aravind, Neeldhara Misra, Harshil Mittal
2022 J jnl
Chess is hard even for a single player.
CoRR
N. R. Aravind, Neeldhara Misra, Harshil Mittal
2022 — conf
Diverse Non Crossing Matchings.
CCCG
Neeldhara Misra, Harshil Mittal, Saraswati Nanoti
2022 Misc conf
Eternal Vertex Cover on Bipartite Graphs.
CSR
Jasine Babu, Neeldhara Misra, Saraswati Nanoti
2022 J jnl
Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs.
CoRR
Neeldhara Misra, Saraswati Nanoti
2022 J jnl
Exact Multi-Covering Problems with Geometric Sets.
Theory Comput. Syst.
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2022 — conf
On Fair Division with Binary Valuations Respecting Social Networks.
CALDAM
Neeldhara Misra, Debanuj Nayak
2022 J jnl
Romeo and Juliet Meeting in Forest Like Regions.
CoRR
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
2022 — conf
Romeo and Juliet Meeting in Forest like Regions.
FSTTCS
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
2022 J jnl
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).
Dagstuhl Reports
Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal
2021 J jnl
A parameterized perspective on protecting elections.
Theor. Comput. Sci.
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
2021 J jnl
Equitable Division of a Path.
CoRR
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish
2021 B conf
Fair Division Is Hard Even for Amicable Agents.
SOFSEM
Neeldhara Misra, Aditi Sethia
2021 J jnl
Imbalance parameterized by twin cover revisited.
Theor. Comput. Sci.
Neeldhara Misra, Harshil Mittal
2021 J jnl
On Fair Division with Binary Valuations Respecting Social Networks.
CoRR
Neeldhara Misra, Debanuj Nayak
2020 C conf
A Parameterized Perspective on Attacking and Defending Elections.
IWOCA
Kishen N. Gowda, Neeldhara Misra, Vraj Patel
2020 J jnl
A Parameterized Perspective on Attacking and Defending Elections.
CoRR
Kishen N. Gowda, Neeldhara Misra, Vraj Patel
2020 J jnl
Color spanning objects: Algorithms and hardness results.
Discret. Appl. Math.
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
2020 — conf
Fair Division is Hard even for Amicable Agents.
ICTCS
Neeldhara Misra, Aditi Sethia
2020 Misc conf
Imbalance Parameterized by Twin Cover Revisited.
COCOON
Neeldhara Misra, Harshil Mittal
2020 J jnl
Imbalance Parameterized by Twin Cover Revisited.
CoRR
Neeldhara Misra, Harshil Mittal
2020 A* conf
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.
IJCAI
Chinmay Sonar, Palash Dey, Neeldhara Misra
2020 — conf
On the Parameterized Complexity of Spanning Trees with Small Vertex Covers.
CALDAM
Chamanvir Kaur, Neeldhara Misra
2020 J jnl
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.
CoRR
Chinmay Sonar, Palash Dey, Neeldhara Misra
2020 J jnl
Parameterized complexity of happy coloring problems.
Theor. Comput. Sci.
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy
2020 — conf
Red-Blue Point Separation for Points on a Circle.
CCCG
Neeldhara Misra, Harshil Mittal, Aditi Sethia
2020 J jnl
Red-Blue Point Separation for Points on a Circle.
CoRR
Neeldhara Misra, Harshil Mittal, Aditi Sethia
2020 J jnl
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors.
Algorithms
Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi
2020 J jnl
Subexponential algorithm for
J. Comput. Syst. Sci.
Neeldhara Misra, Fahad Panolan, Saket Saurabh
2019 A* conf
A Parameterized Perspective on Protecting Elections.
IJCAI
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
2019 J jnl
A Parameterized Perspective on Protecting Elections.
CoRR
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
2019 Misc conf
Deleting to Structured Trees.
COCOON
Pratyush Dayal, Neeldhara Misra
2019 J jnl
Deleting to Structured Trees.
CoRR
Pratyush Dayal, Neeldhara Misra
2019 J jnl
On structural parameterizations of firefighting.
Theor. Comput. Sci.
Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura
2019 B conf
On the Complexity of Optimal Matching Reconfiguration.
SOFSEM
Manoj Gupta, Hitesh Kumar, Neeldhara Misra
2019 Misc conf
On the Parameterized Complexity of Edge-Linked Paths.
CSR
Neeldhara Misra, Fahad Panolan, Saket Saurabh
2019 — conf
On the Parameterized Complexity of Party Nominations.
ADT
Neeldhara Misra
2019 J jnl
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
Algorithmica
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
2019 J jnl
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers.
Theor. Comput. Sci.
Palash Dey, Neeldhara Misra, Y. Narahari
2019 B conf
Robustness Radius for Chamberlin-Courant on Restricted Domains.
SOFSEM
Neeldhara Misra, Chinmay Sonar
2019 Misc conf
The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.
CSR
Neeldhara Misra, Piyush Rathi
2018 J jnl
Complexity of manipulation with partial information in voting.
Theor. Comput. Sci.
Palash Dey, Neeldhara Misra, Y. Narahari
2018 — conf
On Structural Parameterizations of Firefighting.
CALDAM
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
2018 Misc conf
On the Complexity of Two Dots for Narrow Boards and Few Colors.
FUN
Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra
2018 C conf
On the Parameterized Complexity of Colorful Components and Related Problems.
IWOCA
Neeldhara Misra
2017 J jnl
Backdoors into heterogeneous classes of SAT and CSP.
J. Comput. Syst. Sci.
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2017 J jnl
Frugal bribery in voting.
Theor. Comput. Sci.
Palash Dey, Neeldhara Misra, Y. Narahari
2017 J jnl
On Structural Parameterizations of Firefighting.
CoRR
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
2017 — conf
On Structural Parameterizations of Graph Motif and Chromatic Number.
CALDAM
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
2017 — conf
On the Complexity of Chamberlin-Courant on Almost Structured Profiles.
ADT
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan
2017 B conf
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard.
MFCS
Palash Dey, Neeldhara Misra
2017 A conf
Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers.
AAMAS
Palash Dey, Neeldhara Misra, Y. Narahari
2017 A* conf
Saving Critical Nodes with Firefighters is FPT.
ICALP
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
2017 J jnl
Saving Critical Nodes with Firefighters is FPT.
CoRR
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
2017 C conf
The Parameterized Complexity of Happy Colorings.
IWOCA
Neeldhara Misra, I. Vinod Reddy
2017 J jnl
The Parameterized Complexity of Happy Colorings.
CoRR
Neeldhara Misra, I. Vinod Reddy
2016 — ch.
Alternate Parameterizations.
Encyclopedia of Algorithms
Neeldhara Misra
2016 — conf
Color Spanning Objects: Algorithms and Hardness Results.
CALDAM
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
2016 A* conf
Complexity of Manipulation with Partial Information in Voting.
IJCAI
Palash Dey, Neeldhara Misra, Y. Narahari
2016 J jnl
Complexity of Manipulation with Partial Information in Voting.
CoRR
Palash Dey, Neeldhara Misra, Y. Narahari
2016 A* conf
Elicitation for Preferences Single Peaked on Trees.
IJCAI
Palash Dey, Neeldhara Misra
2016 J jnl
Elicitation for Preferences Single Peaked on Trees.
CoRR
Palash Dey, Neeldhara Misra
2016 A* conf
Frugal Bribery in Voting.
AAAI
Palash Dey, Neeldhara Misra, Y. Narahari
2016 J jnl
Hitting Forbidden Minors: Approximation and Kernelization.
SIAM J. Discret. Math.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2016 J jnl
Kernelization complexity of possible winner and coalitional manipulation problems in voting.
Theor. Comput. Sci.
Palash Dey, Neeldhara Misra, Y. Narahari
2016 — ch.
Kernelization, Planar F-Deletion.
Encyclopedia of Algorithms
Neeldhara Misra
2016 A conf
On the Computational Hardness of Manipulating Pairwise Voting Rules.
AAMAS
Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum
2016 J jnl
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard.
CoRR
Palash Dey, Neeldhara Misra
2016 J jnl
Preference Elicitation For Single Crossing Domain.
CoRR
Palash Dey, Neeldhara Misra
2016 A* conf
Preference Elicitation for Single Crossing Domain.
IJCAI
Palash Dey, Neeldhara Misra
2016 A* conf
Randomised Procedures for Initialising and Switching Actions in Policy Iteration.
AAAI
Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan
2016 J jnl
The Runaway Rectangle Escape Problem.
CoRR
Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty
2016 Misc conf
Two Dots is NP-complete.
FUN
Neeldhara Misra
2015 J jnl
Backdoors into Heterogeneous Classes of SAT and CSP.
CoRR
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2015 A conf
Detecting Possible Manipulators in Elections.
AAMAS
Palash Dey, Neeldhara Misra, Y. Narahari
2015 J jnl
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.
SIAM J. Discret. Math.
Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi
2015 J jnl
Frugal Bribery in Voting.
CoRR
Palash Dey, Neeldhara Misra, Y. Narahari
2015 Misc conf
Graph Modification Problems: A Modern Perspective.
FAW
Fedor V. Fomin, Saket Saurabh, Neeldhara Misra
2015 A conf
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting.
AAMAS
Palash Dey, Neeldhara Misra, Y. Narahari
2015 J jnl
Manipulation is Harder with Incomplete Votes.
CoRR
Palash Dey, Neeldhara Misra, Y. Narahari
2015 J jnl
On Choosing Committees Based on Approval Votes in the Presence of Outliers.
CoRR
Palash Dey, Neeldhara Misra, Y. Narahari
2015 J jnl
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.
Algorithmica
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
2015 A conf
On the Parameterized Complexity of Minimax Approval Voting.
AAMAS
Neeldhara Misra, Arshed Nabeel, Harman Singh
2015 C conf
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints.
CIAC
Vikram Kamat, Neeldhara Misra
2015 A* conf
Solving
SODA
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh
2015 Misc conf
Unique Covering Problems with Geometric Sets.
COCOON
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2014 A* conf
Backdoors into Heterogeneous Classes of SAT and CSP.
AAAI
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2014 J jnl
Complexity of Kernelization in the Possible Winner Problem.
CoRR
Palash Dey, Neeldhara Misra, Y. Narahari
2014 J jnl
Detecting Possible Manipulators in Elections.
CoRR
Palash Dey, Neeldhara Misra, Y. Narahari
2014 — conf
On the d-Runaway Rectangle Escape Problem.
CCCG
Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty
2014 J jnl
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.
Algorithmica
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2014 Misc conf
UNO Gets Easier for a Single Player.
FUN
Palash Dey, Prachi Goyal, Neeldhara Misra
2014 Misc conf
Vertex Cover Gets Faster and Harder on Low Degree Graphs.
COCOON
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra
2014 J jnl
Vertex Cover Gets Faster and Harder on Low Degree Graphs.
CoRR
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra
2013 J jnl
An Erdős--Ko--Rado theorem for matchings in the complete graph
CoRR
Vikram Kamat, Neeldhara Misra
2013 — conf
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.
FSTTCS
Prachi Goyal, Neeldhara Misra, Fahad Panolan
2013 B conf
Hardness of r-dominating set on Graphs of Diameter (r + 1).
IPEC
Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh
2013 Misc conf
Hitting and Piercing Rectangles Induced by a Point Set.
COCOON
Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra
2013 J jnl
Imbalance is fixed parameter tractable.
Inf. Process. Lett.
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2013 B conf
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.
IPEC
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2013 B conf
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.
MFCS
Prachi Goyal, Vikram Kamat, Neeldhara Misra
2013 J jnl
On the Parameterized Complexity of the Maximum Edge Coloring Problem.
CoRR
Prachi Goyal, Vikram Kamat, Neeldhara Misra
2013 B conf
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
WG
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
2013 J jnl
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.
J. Graph Theory
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2013 J jnl
Solving min ones 2-sat as fast as vertex cover.
Theor. Comput. Sci.
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
2013 B conf
Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
MFCS
Neeldhara Misra, Fahad Panolan, Saket Saurabh
2013 J jnl
The Parameterized Complexity of Unique Coverage and Its Variants.
Algorithmica
Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2013 J jnl
Upper and Lower Bounds for Weak Backdoor Set Detection
CoRR
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
2013 A conf
Upper and Lower Bounds for Weak Backdoor Set Detection.
SAT
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
2012 J jnl
FPT algorithms for Connected Feedback Vertex Set.
J. Comb. Optim.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2012 — conf
Kernelization - Preprocessing with a Guarantee.
The Multivariate Algorithmic Revolution and Beyond
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012 J jnl
On Parameterized Independent Feedback Vertex Set.
Theor. Comput. Sci.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2012 B conf
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.
WG
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
2012 J jnl
Planar F-Deletion: Approximation and Optimal FPT Algorithms
CoRR
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012 A* conf
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.
FOCS
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2011 C conf
Algorithmic Aspects of Dominator Colorings in Graphs.
IWOCA
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2011 A conf
Hitting forbidden minors: Approximation and Kernelization.
STACS
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2011 J jnl
Lower bounds on kernelization.
Discret. Optim.
Neeldhara Misra, Venkatesh Raman, Saket Saurabh
2011 Misc conf
On Parameterized Independent Feedback Vertex Set.
COCOON
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2010 B conf
FPT Algorithms for Connected Feedback Vertex Set.
WALCOM
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2010 J jnl
Hitting forbidden minors: Approximation and Kernelization
CoRR
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2010 Misc conf
Imbalance Is Fixed Parameter Tractable.
COCOON
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2010 B conf
On the Kernelization Complexity of Colorful Motifs.
IPEC
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan
2010 B conf
Solving minones-2-sat as Fast as vertex cover.
MFCS
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
2010 — conf
The effect of girth on the kernelization complexity of Connected Dominating Set.
FSTTCS
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2009 J jnl
FPT Algorithms for Connected Feedback Vertex Set
CoRR
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009 Misc conf
The Budgeted Unique Coverage Problem and Color-Coding.
CSR
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009 J jnl
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
Theory Comput. Syst.
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh
2008 B conf
Graph Layout Problems Parameterized by Vertex Cover.
ISAAC
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh