Search the dblp DataBase
Wayne M. Dymàcek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Tom Whaley, Anurag Chandra, Noah Egorin, Wayne M. Dymàcek
Parallel searches for hereditary node properties in binary trees. [Citation Graph (0, 0)][DBLP]
ACM Southeast Regional Conference, 1998, pp:280-282 [Conf] - Wayne M. Dymàcek, D. P. Roselle
Circular Permutations by Number of Rises and Successions. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1978, v:25, n:2, pp:196-201 [Journal] - Wayne M. Dymàcek, D. P. Roselle
Cyclic Designs and Uniformly Deep Families. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1980, v:28, n:2, pp:130-139 [Journal] - Wayne M. Dymàcek
Complements of Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1981, v:37, n:2-3, pp:167-180 [Journal] - Wayne M. Dymàcek
Bipartite Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1986, v:59, n:1-2, pp:9-20 [Journal] - Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley
Characterizations of bipartite Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1999, v:199, n:1-3, pp:11-25 [Journal] - Wayne M. Dymàcek, Tom Whaley
Generating strings for bipartite Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:141, n:1-3, pp:95-107 [Journal]
Search in 0.005secs, Finished in 0.006secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002