Author:
Fomin Fedor V.,Høie Kjartan
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference25 articles.
1. Fixed parameter algorithms for dominating set and related problems on planar graphs;Alber;Algorithmica,2002
2. Finding maximum independent sets in sparse and general graphs;Beigel,1999
3. New spectral lower bounds on the bisection width of graphs;Bezrukov;Theoret. Comput. Sci.,2004
4. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
5. Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems;Chen,2003
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献