Neeldhara Misra

According to our database1, Neeldhara Misra
  • authored at least 80 papers between 2008 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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.
CoRR, 2017

Saving Critical Nodes with Firefighters is FPT.
CoRR, 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

Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 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. Discrete Math., 2016

The Runaway Rectangle Escape Problem.
CoRR, 2016

Complexity of Manipulation with Partial Information in Voting.
CoRR, 2016

On the Exact Amount of Missing Information that makes Finding Possible Winners Hard.
CoRR, 2016

Preference Elicitation For Single Crossing Domain.
CoRR, 2016

Elicitation for Preferences Single Peaked on Trees.
CoRR, 2016

Complexity of Manipulation with Partial Information in Voting.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 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

Color Spanning Objects: Algorithms and Hardness Results.
Proceedings of the Algorithms and Discrete Applied Mathematics, 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

Frugal Bribery in Voting.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

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

Backdoors into Heterogeneous Classes of SAT and CSP.
CoRR, 2015

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

Manipulation is Harder with Incomplete Votes.
CoRR, 2015

Frugal Bribery in Voting.
CoRR, 2015

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

Solving d-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

Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

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

Detecting Possible Manipulators in Elections.
CoRR, 2014

Vertex Cover Gets Faster and Harder on Low Degree Graphs.
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

Backdoors into Heterogeneous Classes of SAT and CSP.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 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.
Journal of Graph Theory, 2013

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

Upper and Lower Bounds for Weak Backdoor Set Detection
CoRR, 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

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 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.
Discrete Optimization, 2011

Hitting forbidden minors: Approximation and Kernelization.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

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

On Parameterized Independent Feedback Vertex Set.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
Hitting forbidden minors: Approximation and Kernelization
CoRR, 2010

FPT Algorithms for Connected Feedback Vertex Set.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 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

Imbalance Is Fixed Parameter Tractable.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

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

FPT Algorithms for Connected Feedback Vertex Set
CoRR, 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...