Neeldhara Misra
Title
Cited by
Cited by
Year
Planar F-deletion: Approximation, kernelization and optimal FPT algorithms
FV Fomin, D Lokshtanov, N Misra, S Saurabh
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 470-479, 2012
1732012
Graph layout problems parameterized by vertex cover
MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh
International Symposium on Algorithms and Computation, 294-305, 2008
1342008
Kernelization–preprocessing with a guarantee
D Lokshtanov, N Misra, S Saurabh
The Multivariate Algorithmic Revolution and Beyond, 129-161, 2012
802012
The complexity ecology of parameters: An illustration using bounded max leaf number
M Fellows, D Lokshtanov, N Misra, M Mnich, F Rosamond, S Saurabh
Theory of Computing Systems 45 (4), 822-848, 2009
632009
FPT algorithms for connected feedback vertex set
N Misra, G Philip, V Raman, S Saurabh, S Sikdar
Journal of Combinatorial Optimization 24 (2), 131-146, 2012
592012
Hitting forbidden minors: Approximation and kernelization
FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh
arXiv preprint arXiv:1010.1365, 2010
462010
Lower bounds on kernelization
N Misra, V Raman, S Saurabh
Discrete Optimization 8 (1), 110-128, 2011
402011
On the kernelization complexity of colorful motifs
AM Ambalath, R Balasundaram, C Rao, V Koppula, N Misra, G Philip, ...
International Symposium on Parameterized and Exact Computation, 14-25, 2010
402010
On parameterized independent feedback vertex set
N Misra, G Philip, V Raman, S Saurabh
Theoretical Computer Science 461, 65-75, 2012
362012
Algorithmic aspects of dominator colorings in graphs
S Arumugam, KR Chandrasekar, N Misra, G Philip, S Saurabh
International Workshop on Combinatorial Algorithms, 19-30, 2011
262011
Kernelization complexity of possible winner and coalitional manipulation problems in voting
P Dey, N Misra, Y Narahari
Theoretical Computer Science 616, 111-125, 2016
252016
Complexity of manipulation with partial information in voting
P Dey, N Misra, Y Narahari
Theoretical Computer Science 726, 78-99, 2018
242018
Backdoors into heterogeneous classes of SAT and CSP
S Gaspers, N Misra, S Ordyniak, S Szeider, S Živný
Journal of Computer and System Sciences 85, 38-56, 2017
242017
On the parameterized complexity of minimax approval voting
N Misra, A Nabeel, H Singh
Proceedings of the 2015 International Conference on Autonomous Agents and …, 2015
222015
Hitting forbidden minors: Approximation and kernelization
FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh
SIAM Journal on Discrete Mathematics 30 (1), 383-410, 2016
212016
On the hardness of eliminating small induced subgraphs by contracting edges
D Lokshtanov, N Misra, S Saurabh
International Symposium on Parameterized and Exact Computation, 243-254, 2013
212013
Frugal bribery in voting
P Dey, N Misra, Y Narahari
Theoretical Computer Science 676, 15-32, 2017
202017
Hardness of r-dominating set on Graphs of Diameter (r + 1)
D Lokshtanov, N Misra, G Philip, MS Ramanujan, S Saurabh
International Symposium on Parameterized and Exact Computation, 255-267, 2013
202013
Solving d-SAT via Backdoors to Small Treewidth
FV Fomin, D Lokshtanov, N Misra, MS Ramanujan, S Saurabh
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
172014
On the exact amount of missing information that makes finding possible winners hard
P Dey, N Misra
arXiv preprint arXiv:1610.08407, 2016
152016
The system can't perform the operation now. Try again later.
Articles 1–20