Information Processing Letters · 2015 · 50 citations · 9 references
ComputingComputer ScienceComputational GeometryApproximation AlgorithmsFpt Approximation AlgorithmsRandomized Covering AlgorithmsVertex Cover Approximation
9
Node-Deletion Problems on Bipartite Graphs
Mihalis Yannakakis · SIAM Journal on Computing · 1981 · 300 citations
Finding paths of length k in time
Ryan Williams · Information Processing Letters · 2008 · 195 citations
Boštjan Brešar, František Kardoš, Ján Katrenič et al. · Discrete Applied Mathematics · 2011 · 166 citations · Full text