Before revision:  Inspired by their ideas, we present an arguably simpler algorithm with an improved running time bound of n^{ O (\log^2 n)}.
After revision:  Inspired by their ideas, we present an arguably simpler algorithm with an improved running time bound of n^{ \mathcal{O (\log^2 n)}.