Let M be a number field of degree m with ring of integers \bZ_M . Let F\in\bZ_M[X,Y] be a form of degree n such that F(X,1) has distinct roots. Let\break G\in\bZ[X,Y] be an arbitrary polynomial of degree k . Assuming that k\le n-2m\pl 1 if all roots of F^{(i)}(X,1) (1\le i\le n) are complex and k\le n-4m\pl 1 otherwise, we provide an efficient algorithm for finding all solutions X,Y\in\bZ_M , \max\b(\overline{|X|},\overline{|Y|}\,\b)\ki C of the inequality \overline{\b|F(X,Y)\b|\!}\,\le c \cdot \overline{\b|G(X,Y)\b|\!}\,. We provide numerical examples with m=3 and C=10^{100} .