Author:
Arvind V.,Raman Venkatesh
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. N. Alon, R. Yuster and U. Zwick, “Color-Coding”, Journal of the Association for Computing Machinery, 42(4) (1995) 844–856.
2. H. Bodlaender, “A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth”, SI AM J. Computing 25 (1996) 1305–1317.
3. R. G. Downey and M. R. Fellows, Parameterized Complexity, Springer-Verlag, 1998.
4. U. Feige and J. Kilian, “On Limited versus Polynomial Nondeterminism”, Chicago Journal of Theoretical Computer Science, March (1997).
5. H. Fernau, “Parameterized Enumeration”, to appear in the Proceedings of COCOON 2002.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献