Circular Permutations by Number of Rises and Successions. - Wayne M. Dymàcek; D. P. Roselle (J. Comb. Theory A, 1978)

Cyclic Designs and Uniformly Deep Families. - Wayne M. Dymàcek; D. P. Roselle (J. Comb. Theory A, 1980)

Complements of Steinhaus graphs. - Wayne M. Dymàcek (Discret. Math., 1981)

Bipartite Steinhaus graphs. - Wayne M. Dymàcek (Discret. Math., 1986)

Generating strings for bipartite Steinhaus graphs. - Wayne M. Dymàcek; Tom P. Whaley (Discret. Math., 1995)

Parallel searches for hereditary node properties in binary trees. - Tom P. Whaley; Anurag Chandra; Noah Egorin; Wayne M. Dymàcek (ACM Southeast Regional Conference, 1998)

Characterizations of bipartite Steinhaus graphs. - Gerard J. Chang; Bhaskar DasGupta; Wayne M. Dymàcek; Martin Fürer; Matthew Koerlin; Yueh-Shin Lee; Tom P. Whaley (Discret. Math., 1999)

Disconnected Complements of Steinhaus graphs. - Wayne M. Dymàcek; Matthew Koerlin; Jean-Guy Speton; Tom P. Whaley; Jennifer Yanulavich (Electron. Notes Discret. Math., 2002)

Finding Factors of Factor Rings over the Gaussian Integers. - Greg Dresden; Wayne M. Dymàcek (Am. Math. Mon., 2005)