Author:
DasGupta Bhaskar,Mobasheri Nasim
Funder
National Science Foundation
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. Hardness of approximations;Arora,1996
2. Tight approximability results for test set problems in bioinformatics;Berman;J. Comput. Syst. Sci.,2005
3. Improved upper bounds for vertex cover;Chen;Theoret. Comput. Sci.,2010
4. The complexity of theorem proving procedures;Cook,1971
5. Parameterized Algorithms;Cygan,2015
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献