Discrete Applied Mathematics · 2012 · 64 citations · 28 references
ComputingComputer ScienceMathematicsAlgorithmsDiscrete MathematicsTheory Of ComputationGraph AlgorithmsGraph TheoryConnectivity AlgorithmsConnectivity KernelsGraph ConnectivityGraph KernelsKernelizationKernelization Lower BoundsNode Connectivity
28
Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text
Reducibility Among Combinatorial Problems
Kichard Rarp · 2012 · 1.4K citations
On problems without polynomial kernels
Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows et al. · Journal of Computer and System Sciences · 2009 · 577 citations