Author:
Damaschke Peter,Molokov Leonid
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications;Bar-Yehuda;SIAM J. Discrete Math.,2010
2. Nondeterminism within P;Buss;SIAM J. Comput.,1993
3. Improved upper bounds for vertex cover;Chen;Theoret. Comput. Sci.,2010
4. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction;Damaschke;Theoret. Comput. Sci.,2006
5. Pareto complexity of two-parameter FPT problems: a case study for partial vertex cover;Damaschke,2009
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Possibilistic Data Cleaning;IEEE Transactions on Knowledge and Data Engineering;2021
2. Circulant graphs and GCD and LCM of subsets;Information Processing Letters;2015-02