Single-exponential algorithm for Diverse Odd Cycle Transversal

Develop a $2^{O(kr)}$-time algorithm for Diverse Odd Cycle Transversal parameterized by the combined parameter $k+r$.

Background

The meta-theorem presented in the paper yields a running time of $2^{O(kr\log(kr))}$, up to polynomial factors in the input size, for the diverse variants covered by its oracle framework. The authors identify obtaining the sharper $2^{O(kr)}$ bound for Diverse Odd Cycle Transversal, with solution size parameter $k$ and number of requested solutions $r$, as a concrete open problem.