Follow
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
2062012
Graph layout problems parameterized by vertex cover
MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh
Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold …, 2008
1542008
Kernelization-Preprocessing with a Guarantee.
D Lokshtanov, N Misra, S Saurabh
The Multivariate Algorithmic Revolution and Beyond 7370, 129-161, 2012
882012
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, 822-848, 2009
722009
FPT algorithms for connected feedback vertex set
N Misra, G Philip, V Raman, S Saurabh, S Sikdar
Journal of Combinatorial Optimization 24, 131-146, 2012
632012
Hitting forbidden minors: Approximation and kernelization
FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh
arXiv preprint arXiv:1010.1365, 2010
452010
Lower bounds on kernelization
N Misra, V Raman, S Saurabh
Discrete Optimization 8 (1), 110-128, 2011
442011
On the kernelization complexity of colorful motifs
AM Ambalath, R Balasundaram, C Rao H, V Koppula, N Misra, G Philip, ...
Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010
422010
On parameterized independent feedback vertex set
N Misra, G Philip, V Raman, S Saurabh
Theoretical Computer Science 461, 65-75, 2012
412012
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
332017
Algorithmic aspects of dominator colorings in graphs
S Arumugam, KR Chandrasekar, N Misra, G Philip, S Saurabh
Combinatorial Algorithms: 22nd International Workshop, IWOCA 2011, Victoria …, 2011
332011
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
312016
Kernelization complexity of possible winner and coalitional manipulation problems in voting
P Dey, N Misra, Y Narahari
Theoretical Computer Science 616, 111-125, 2016
272016
Complexity of manipulation with partial information in voting
P Dey, N Misra, Y Narahari
Theoretical Computer Science 726, 78-99, 2018
262018
On the hardness of eliminating small induced subgraphs by contracting edges
D Lokshtanov, N Misra, S Saurabh
Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013
252013
Frugal bribery in voting
P Dey, N Misra, Y Narahari
Theoretical Computer Science 676, 15-32, 2017
242017
Hardness of r-dominating set on Graphs of Diameter (r + 1)
D Lokshtanov, N Misra, G Philip, MS Ramanujan, S Saurabh
Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013
242013
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
232015
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
202014
Elicitation for preferences single peaked on trees
P Dey, N Misra
arXiv preprint arXiv:1604.04403, 2016
182016
The system can't perform the operation now. Try again later.
Articles 1–20