The Enumeration of Irreducible Combinatorial Objects. - Janet Simpson Beissinger (J. Comb. Theory A, 1985)

Similar constructions for young tableaux and involutions, and their application to shiftable tableaux. - Janet Simpson Beissinger (Discret. Math., 1987)

Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials. - Janet Simpson Beissinger; Uri N. Peled (Graphs Comb., 1987)

A note on major sequences and external activity in trees. - Janet Simpson Beissinger; Uri N. Peled (Electron. J. Comb., 1997)