Parameterized VERTEX COVER in Graphs of Small Degree

We describe a new approach to improve algorithms for solving the k-VERTEX COVER problem, that complements the state-of-the-art kernelization techniques based on solving maximum-flow instances. Our algorithm applies to graphs of small bounded degree, adapts existing k-vertex cover machinery, and incurs no additional complexity. We also investigate the applicability of our new algorithm to solving the Maximum Independent Set problem in graphs of small bounded degree.