Author:
Fomin Fedor V.,Jansen Bart M.P.,Pilipczuk Michał
Funder
Netherlands Organization for Scientific Research (NWO)
European Research Council (ERC)
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference42 articles.
1. Solving MAX-r-SAT above a tight lower bound;Alon;Algorithmica,2011
2. Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind;Berge;Wiss. Z., Martin-Luther-Univ. Halle-Wittenb., Math.-Nat.wiss. Reihe,1961
3. Kernel(s) for problems with no kernel: On out-trees with many leaves;Binkele-Raible;ACM Trans. Algorithms,2012
4. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theor. Comput. Sci.,1998
5. Kernelization: New upper and lower bound techniques;Bodlaender,2009
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献