I tried unsuccessfully to find this information in other posts, so I'll ask it here:
The $n$-th derivative of $e^{f(x)}$ can be given in terms of the complete Bell polynomials:
$$ \begin{align} \frac{d^n}{dx^n}e^{f(x)} &= e^{f(x)}B_n(f^{(1)}(x),...,f^{(n)}(x))\\ &= e^{f(x)}B_n^{(1)}(f) \end{align} $$
where $f^{(n)}(x) = \frac{d^n}{dx^n}f(x)$ and $B_n^{(1)}(f)$ indicates that we are considering the derivatives of $f$ with respect to its 1st argument.
I need the two-variable version of this formula, i.e.
$$ \begin{align} \frac{d^m}{dy^m}\frac{d^n}{dx^n}e^{f(x,y)} &= \frac{d^m}{dy^m}e^{f(x,y)}B_n(f^{(1,0)}(x,y),...,f^{(n,0)}(x,y))\\ &=\frac{d^m}{dy^m}e^{f(x,y)} B_n^{(1)}(f)\\ &=\sum_{k=0}^m \binom{m}{k}\frac{\partial^k e^{f(x,y)}}{\partial y^k}\frac{\partial^{m-k} B_n^{(1)}(f)}{\partial y^{m-k}}\\ &=e^{f(x,y)}\sum_{k=0}^m \binom{m}{k}B_k^{(2)}(f)\frac{\partial^{m-k} B_n^{(1)}(f)}{\partial y^{m-k}} \end{align} $$
So all I need to compute are the derivatives of $B_n(f^{(1,0)}(x,y),...,f^{(n,0)}(x,y))$ with respect to $y$.
We can consider the derivatives $f^{(j,0)}(x,y)$ as independent functions of $y$, so all in all I need a way to compute the terms:
$$ \frac{\partial^k}{\partial y^k}B_n(h_1(y),...,h_n(y)) $$
The answer by Markus is definitely appreciated, but I may have found a simpler way.
We expect the solution to be in the form
$$ \frac{\partial^{m+n}}{\partial x^m \partial y^n}e^{f(x,y)} = e^{f(x,y)}T_{mn}, $$
where $T_{mn} = \sum_{p,q}C^{mn}_{pq}f^{(p,q)}(x,y)$ is a polynomial in the partial derivatives of $f(x,y)$. I have worked out a recursive definition of $T_{mn}$:
$$ \begin{align} T_{m0} &= B_m(f^{(1,0)}(x,y),\dots,f^{(m,0)}(x,y))\\ T_{mn} &= \sum_{r=0}^m\sum_{s=0}^{n-1}\binom{m}{r}\binom{n-1}{s}T_{rs}f^{(m-r,n-s)}(x,y)\qquad n\geq1 \end{align} $$
The only issue is that I don't have an actual proof, I found this result by generating a lot of examples with Mathematica and by staring at them long enough.