We provide algorithms that find, in case of existence, indefinite nested sum extensions in which a (creative) telescoping solution can be expressed with minimal nested depth.