  We present an algorithm which for any given ideal $I\subseteq\mathbb{K}
[x,y]$ finds all elements of $I$ that have the form $f(x) - g(y)$, i.e., all
elements in which no monomial is a multiple of $xy$.
