Author:
Shachnai Hadas,Zehavi Meirav
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference60 articles.
1. Computers and Intractability: a Guide to the Theory of NP-Completeness;Garey,1979
2. On efficient fixed-parameter algorithms for weighted vertex cover;Niedermeier;J. Algorithms,2003
3. Nondeterminism within P;Buss;SIAM J. Comput.,1993
4. Fixed-parameter tractability and completeness II: on completeness for W[1];Downey;Theor. Comput. Sci.,1995
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献