  \c{S}tef\u{a}nescu proved an elegant factorization result for polynomials
over discrete valuation domains [CASC'2014, Lecture Notes in Computer Science,
Ed. by V. Gerdt, W. Koepf, W. Mayr, and E. Vorozhtsov, Springer, Berlin, {Vol.
\textbf{8660}}, pp. 460--471, 2014.] In this paper, a generalization of
\c{S}tef\u{a}nescu's result is proved to cover a larger class of polynomials
over discrete valuation domains. Such results are useful in devising algorithms
for polynomial factorization.
