Author:
Fomin Fedor V.,Marx Dániel
Publisher
Springer Berlin Heidelberg
Reference45 articles.
1. Ajtai, M.: The shortest vector problem in
$\ell_{\mbox{2}}$
is NP-hard for randomized reductions. In: STOC, pp. 10–19 (1998)
2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42(4), 844–856 (1995)
3. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11(1), 49–57 (1995)
4. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Wareham, H.T.: The parameterized complexity of sequence alignment and consensus. Theor. Comput. Sci. 147(1, 2), 31–54 (1995)
5. Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica 55(1), 1–13 (2009)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chain Minors are FPT;Algorithmica;2016-10-20
2. On the complexity of connection games;Theoretical Computer Science;2016-09