Subject
General Computer Science,Theoretical Computer Science
Reference42 articles.
1. Solving MAX-r-SAT above a tight lower bound;Alon;Algorithmica,2011
2. Partially polynomial kernels for Set Cover and Test Cover;Basavaraju;SIAM J. Discrete Math.,2016
3. Metric dimension of bounded tree-length graphs;Belmonte;SIAM J. Discrete Math.,2017
4. Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy;Bodlaender,1994
5. Kernelization lower bounds by cross-composition;Bodlaender;SIAM J. Discrete Math.,2014
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献