We note that the proof of Theorem  can easily be turned into an algorithm enumerating all minimal vertex covers of \(G\)  in time \(2^{\beta n + \gamma k} n^{O(1)}\) . Alternatively, a polynomial-delay algorithm, such as the one by [1]}, could be used for the enumeration.
