  In this paper, we continue our previous work on the reduction of algebraic
lattices over imaginary quadratic fields for the special case when the lattice
is spanned over a two dimensional basis. In particular, we show that the
algebraicvariant of Gauss algorithm returns a basis that corresponds to the
successive minima of the lattice in polynomial time if the chosen ring is
Euclidean.
