Algorithm to solve certain ternary quartic Diophantine equations

In this paper, we develop an algorithm to solve completely the Diophantine equation F(x; y) = z^2 , where the quartic inhomogeneous polynomial F(x; y) with integer coe cients satises certain technical conditions. The procedure is an extension of the version of Runge s method given by Poulakis.