Wayne M. Dymàcek

According to our database, Wayne M. Dymàcek authored at least 9 papers between 1978 and 2005.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2005

Finding Factors of Factor Rings over the Gaussian Integers.

Greg Dresden, Wayne M. Dymàcek

Am. Math. Mon., 2005

2002

Disconnected Complements of Steinhaus graphs.

Wayne M. Dymàcek, Matthew Koerlin, Jean-Guy Speton, Tom Whaley, Jennifer Yanulavich

Electron. Notes Discret. Math., 2002

1999

Characterizations of bipartite Steinhaus graphs.

Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley

Discret. Math., 1999

1998

Parallel searches for hereditary node properties in binary trees.

Tom Whaley, Anurag Chandra, Noah Egorin, Wayne M. Dymàcek

Proceedings of the 36th Annual ACM Southeast Regional Conference, 1998

1995

Generating strings for bipartite Steinhaus graphs.

Wayne M. Dymàcek, Tom Whaley

Discret. Math., 1995

1986

Bipartite Steinhaus graphs.

Wayne M. Dymàcek

Discret. Math., 1986

1981

Complements of Steinhaus graphs.

Wayne M. Dymàcek

Discret. Math., 1981

1980

Cyclic Designs and Uniformly Deep Families.

Wayne M. Dymàcek, D. P. Roselle

J. Comb. Theory A, 1980

1978

Circular Permutations by Number of Rises and Successions.

Wayne M. Dymàcek, D. P. Roselle

J. Comb. Theory A, 1978