An $O(n^2)$ time algorithm for the minimal permutation completion problem
Origin : Files produced by the author(s)