Nebel creates trees to facilitate the lexicographical generation of combinatorial objects in this paper. The strength of this approach is that the lexicographic successor of an object can be easily found by a tree traversal. Compression can be added in cases of nodes with one successor, and this speeds the process even more. A detailed analysis is given for the expected amount of work saved. This approach builds on an algorithm of Rainer Kemp [1].

The key contribution of this paper is the use of a tree, and the approach is an interesting and novel twist that makes good use of tree properties.