A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
A multi-stack, O(n) space, constant amortized time algorithm is presented for listing all permutations of the integers 1,2,...,n that contain a subsequence of length k where all of the elements in the subsequence are in increasing order. (C) 1999 Published by Elsevier Science B.V. All rights reserved.
constant amortized time combinatorial problems listing algorithms