Journal of Discrete Algorithms · 2009 · 15 citations · 14 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsSet TheoryCombinatorial Set TheoryCounting PrinciplesDisjoint Set UnionEnumerative CombinatoricsProbabilistic CombinatoricsTopological CombinatoricsIntersection TheoremsParameterized Algorithms For Hitting SetSet Cover
14
Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text
Improved upper bounds for vertex cover
Jianer Chen, Iyad Kanj, Ge Xia · Theoretical Computer Science · 2010 · 387 citations
Strong computational lower bounds via parameterized complexity
Jianer Chen, Xiuzhen Huang, Iyad Kanj et al. · Journal of Computer and System Sciences · 2006 · 266 citations
The Parameterized Complexity of Counting Problems
Jörg Flum, Martin Grohe · SIAM Journal on Computing · 2004 · 242 citations