  We describe an elegant O*(2^k) algorithm for the disjoint compression problem
for Odd Cycle Transversal based on a reduction to Above Guarantee Vertex Cover.
We believe that this algorithm refines the understanding of the Odd Cycle
Transversal algorithm by Reed, Smith and Vetta.

Data Structures and Algorithms