Author:
Jansen Bart M.P.,Pieterse Astrid
Subject
General Computer Science,Theoretical Computer Science
Reference45 articles.
1. Easy problems for tree-decomposable graphs;Arnborg;J. Algorithms,1991
2. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
3. Kernelization: new upper and lower bound techniques;Bodlaender,2009
4. On problems without polynomial kernels;Bodlaender;J. Comput. Syst. Sci.,2009
5. (Meta) kernelization;Bodlaender;J. ACM,2016
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献