The number of rounds needed to exchange information within a graph. - Susan F. Assmann; Daniel J. Kleitman (Discret. Appl. Math., 1983)

Characterization of curve map graphs. - Susan F. Assmann; Daniel J. Kleitman (Discret. Appl. Math., 1984)

On a Dual Version of the One-Dimensional Bin Packing Problem. - Susan F. Assmann; David S. Johnson 001; Daniel J. Kleitman; Joseph Y.-T. Leung (J. Algorithms, 1984)