1. Calculating bounds on reachability and connectedness in stochastic networks;Ball;Networks,1983
2. T. Beyer, F. Ruskey, Constant average time generation of subtrees of bounded size, Unpublished manuscript, 1989
3. A Gray code for the ideals of a forest poset;Koda;J. Algorithms,1993
4. E.L. Lawler, Efficient implementation of dynamic programming algorithms for sequencing problems, Stichting Mathematisch Centrum, Technical Report BW106/79, 1979
5. Gray codes from antimatroids;Pruesse;Order,1993