Neeldhara Misra

Orcid: 0000-0003-1727-5388

Affiliations:
  • Indian Institute of Technology, Gandhinagar, India
  • Institute of Mathematical Sciences, Chennai, India (PhD 2012)


According to our database1, Neeldhara Misra authored at least 97 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parameterized Aspects of Distinct Kemeny Rank Aggregation.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023
On the exact amount of missing information that makes finding possible winners hard.
J. Comput. Syst. Sci., August, 2023

The Price of Equity with Binary Valuations and Few Agent Types.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Spartan Bipartite Graphs Are Essentially Elementary.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Finding Perfect Matching Cuts Faster.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

On the Complexity of the Eigenvalue Deletion Problem.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

The Complexity of Minimizing Envy in House Allocation.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).
Dagstuhl Reports, November, 2022

Exact Multi-Covering Problems with Geometric Sets.
Theory Comput. Syst., 2022

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs.
CoRR, 2022

Chess Is Hard Even for a Single Player.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Romeo and Juliet Meeting in Forest like Regions.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Eternal Vertex Cover on Bipartite Graphs.
Proceedings of the Computer Science - Theory and Applications, 2022

Diverse Non Crossing Matchings.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

On Fair Division with Binary Valuations Respecting Social Networks.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
Imbalance parameterized by twin cover revisited.
Theor. Comput. Sci., 2021

A parameterized perspective on protecting elections.
Theor. Comput. Sci., 2021

Equitable Division of a Path.
CoRR, 2021

2020
Parameterized complexity of happy coloring problems.
Theor. Comput. Sci., 2020

Subexponential algorithm for <i>d</i>-cluster edge deletion: Exception or rule?
J. Comput. Syst. Sci., 2020

Color spanning objects: Algorithms and hardness results.
Discret. Appl. Math., 2020

Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors.
Algorithms, 2020

A Parameterized Perspective on Attacking and Defending Elections.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Fair Division is Hard even for Amicable Agents.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Red-Blue Point Separation for Points on a Circle.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

On the Parameterized Complexity of Spanning Trees with Small Vertex Covers.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers.
Theor. Comput. Sci., 2019

On structural parameterizations of firefighting.
Theor. Comput. Sci., 2019

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

Robustness Radius for Chamberlin-Courant on Restricted Domains.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

On the Complexity of Optimal Matching Reconfiguration.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.
Proceedings of the Computer Science - Theory and Applications, 2019

On the Parameterized Complexity of Edge-Linked Paths.
Proceedings of the Computer Science - Theory and Applications, 2019

Deleting to Structured Trees.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

On the Parameterized Complexity of Party Nominations.
Proceedings of the Algorithmic Decision Theory - 6th International Conference, 2019

2018
Complexity of manipulation with partial information in voting.
Theor. Comput. Sci., 2018

On the Parameterized Complexity of Colorful Components and Related Problems.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

On the Complexity of Two Dots for Narrow Boards and Few Colors.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

On Structural Parameterizations of Firefighting.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
Frugal bribery in voting.
Theor. Comput. Sci., 2017

Backdoors into heterogeneous classes of SAT and CSP.
J. Comput. Syst. Sci., 2017

The Parameterized Complexity of Happy Colorings.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Saving Critical Nodes with Firefighters is FPT.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

On Structural Parameterizations of Graph Motif and Chromatic Number.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

On the Complexity of Chamberlin-Courant on Almost Structured Profiles.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016
Kernelization, Planar F-Deletion.
Encyclopedia of Algorithms, 2016

Alternate Parameterizations.
Encyclopedia of Algorithms, 2016

Kernelization complexity of possible winner and coalitional manipulation problems in voting.
Theor. Comput. Sci., 2016

Hitting Forbidden Minors: Approximation and Kernelization.
SIAM J. Discret. Math., 2016

The Runaway Rectangle Escape Problem.
CoRR, 2016

Preference Elicitation for Single Crossing Domain.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Elicitation for Preferences Single Peaked on Trees.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Two Dots is NP-complete.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

On the Computational Hardness of Manipulating Pairwise Voting Rules.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Randomised Procedures for Initialising and Switching Actions in Policy Iteration.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.
SIAM J. Discret. Math., 2015

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

Manipulation is Harder with Incomplete Votes.
CoRR, 2015

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

Solving <i>d-</i>SAT via Backdoors to Small Treewidth.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Graph Modification Problems: A Modern Perspective.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

Unique Covering Problems with Geometric Sets.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

On the Parameterized Complexity of Minimax Approval Voting.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Detecting Possible Manipulators in Elections.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Complexity of Kernelization in the Possible Winner Problem.
CoRR, 2014

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

UNO Gets Easier for a Single Player.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Vertex Cover Gets Faster and Harder on Low Degree Graphs.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

On the d-Runaway Rectangle Escape Problem.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Solving min ones 2-sat as fast as vertex cover.
Theor. Comput. Sci., 2013

Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.
J. Graph Theory, 2013

Imbalance is fixed parameter tractable.
Inf. Process. Lett., 2013

An Erdős--Ko--Rado theorem for matchings in the complete graph
CoRR, 2013

On the Parameterized Complexity of the Maximum Edge Coloring Problem.
CoRR, 2013

The Parameterized Complexity of Unique Coverage and Its Variants.
Algorithmica, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Hardness of r-dominating set on Graphs of Diameter (r + 1).
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Hitting and Piercing Rectangles Induced by a Point Set.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
On Parameterized Independent Feedback Vertex Set.
Theor. Comput. Sci., 2012

FPT algorithms for Connected Feedback Vertex Set.
J. Comb. Optim., 2012

Planar F-Deletion: Approximation and Optimal FPT Algorithms
CoRR, 2012

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Kernelization - Preprocessing with a Guarantee.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011
Lower bounds on kernelization.
Discret. Optim., 2011

Algorithmic Aspects of Dominator Colorings in Graphs.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010
Solving minones-2-sat as Fast as vertex cover.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

On the Kernelization Complexity of Colorful Motifs.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

The effect of girth on the kernelization complexity of Connected Dominating Set.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
Theory Comput. Syst., 2009

The Budgeted Unique Coverage Problem and Color-Coding.
Proceedings of the Computer Science, 2009

2008
Graph Layout Problems Parameterized by Vertex Cover.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008


  Loading...