{"id":237,"date":"2021-07-26T13:57:44","date_gmt":"2021-07-26T13:57:44","guid":{"rendered":"https:\/\/site.uvm.edu\/jdinitz\/?page_id=237"},"modified":"2022-10-10T15:36:12","modified_gmt":"2022-10-10T15:36:12","slug":"publications","status":"publish","type":"page","link":"https:\/\/site.uvm.edu\/jdinitz\/?page_id=237","title":{"rendered":"Publications"},"content":{"rendered":"\n
  1. New lower bounds for the number of pairwise orthogonal symmetric Latin squares<\/a>, Congressus Numerantium<\/em> 23<\/strong> (1979), pp. 393-398.<\/li>
  2. Boss block designs<\/a> (with D.R. Stinson), Ars Combinatoria<\/em> 9<\/strong> (1980), pp. 59-68.<\/li>
  3. A fast algorithm for finding strong starters <\/a>(with D.R. Stinson), SIAM J. on Algebraic and Discrete Methods<\/em>, Vol. 2, No. 1, March 1981, pp. 50-56.<\/li>
  4. Some new row complete Latin squares<\/a> (with D. Archdeacon, D.R. Stinson, and T. W. Tillson), Journal of Combinatorial Theory (A)<\/em>, Vol. 29, No. 3, Nov. 1980, pp. 393-398.<\/li>
  5. The construction and uses of frames<\/a> (with D.R. Stinson), Ars Combinatoria<\/em> 10<\/strong> (1980), pp. 31-53.<\/li>
  6. A note on Howell designs of odd side<\/a> (with D.R. Stinson), Utilitas Mathematics<\/em> 18<\/strong> (1980), pp. 207-216.<\/li>
  7. Further results on frames<\/a> (with D.R. Stinson), Ars Combinatoria<\/em> 11<\/strong> (1981), pp. 275-288.<\/li>
  8. The spectrum of Room cubes<\/a> (with D.R. Stinson), European Journal of Combinatorics<\/em> 2<\/strong> (1981), pp. 221-230.<\/li>
  9. Pairwise orthogonal symmetric latin squares<\/a>, Congressus Numerantium<\/em> 32<\/strong> (1981), pp. 261-265.<\/li>
  10. The existence of certain Room graphs<\/a>, Ars Combinatoria<\/em> 13<\/strong> (1982), pp. 115-128.<\/li>
  11. Continuous maps in block designs<\/a> (with S.W. Margolis), Ars Combinatoria<\/em> 14<\/strong> (1982), pp. 21-45.<\/li>
  12. Continuous maps in finite projective space<\/a> (with S.W. Margolis), Congressus Numerantium<\/em> 35<\/strong> (1982), pp. 239-244.<\/li>
  13. Translational hulls and block designs<\/a> (with S.W. Margolis), Semigroup Forum<\/em> 27<\/strong> (1983), pp. 247-263.<\/li>
  14. MOLS with holes <\/a>(with D.R. Stinson), Discrete Math<\/em> 44<\/strong> (1983), pp. 145-154.<\/li>
  15. On nonisomorphic Room squares<\/a> (with D.R. Stinson), Proceedings of American Math Soc.<\/em>, Vol. 89, No. 1, Sept. 1983, pp. 175-181.<\/li>
  16. Room n-cubes of low order<\/a>, J. Austral. Math Soc. (Series A)<\/em> 36<\/strong> (1984), pp. 237-252.<\/li>
  17. Room squares with holes of side 3, 5 and 7<\/a> (with D.R. Stinson and W.D. Wallis), Discrete Math<\/em> 47<\/strong> (1983), pp. 221-228.<\/li>
  18. Four orthogonal one-factorizations on ten points<\/a> (with W.D. Wallis), Annals of Discrete Math<\/em> 26<\/strong> 1985, pp. 143-150.<\/li>
  19. Orthogonal one-factorization graphs<\/a>, Journal of Graph Theory<\/em> 9<\/strong> (1985), pp. 147-159.<\/li>
  20. Sets of orthogonal one-factorizations of K10<\/a> (with D.S. Archdeacon and W.D. Wallis), Congressus Numerantium<\/em> 43<\/strong> (1984) pp. 45-79.<\/li>
  21. V-squares<\/a> (with D.S. Archdeacon and D.R. Stinson), Ars Combinatoria<\/em> 19<\/strong> (1985), pp. 161-174.<\/li>
  22. Orthogonal edge colorings of graphs<\/a> (with D.S. Archdeacon and F. Harary), Congressus Numerantium<\/em> 47<\/strong> (1985) pp. 49-67.<\/li>
  23. A hill-climbing algorithm for one-factorizations and Room squares<\/a> (with D.R. Stinson), SIAM J. Algebraic and Disc. Methods<\/em>, Vol. 8, No. 3 (1987), pp. 430-438.<\/li>
  24. The existence of Room 5-cubes<\/a>, Journal of Combinatorial Theory (A)<\/em>, Vol. 45, No. 1 (1987), pp. 125-138.<\/li>
  25. Factorizations and orthogonal matchings<\/a> (with D.S. Archdeacon), Congressus Numerantium<\/em> 58<\/strong> (1987), pp. 69-74.<\/li>
  26. Some perfect Room squares<\/a>, Journal of Combinatorial Mathematics and Combinatorial Computing<\/em> 2<\/strong> (1987), pp. 29-36.<\/li>
  27. On the existence of Room squares with subsquares<\/a> (with D.R. Stinson), Contemporary Mathematics<\/em> 111<\/strong> (1990), pp.73-91.<\/li>
  28. Some new perfect 1-factorizations from starters in finite fields <\/a>(with D.R. Stinson), Journal of Graph Theory<\/em> 13<\/strong> (1989), pp. 405-415.<\/li>
  29. Constructing indecomposable 1-factorizations of the complete multigraph<\/a> (with D.S. Archdeacon), Discrete Math<\/em> 92<\/strong> (1991), pp. 9-19.<\/li>
  30. Orthogonal 1-factorizations of the complete multigraph<\/a>, Coding Theory and Design Theory, Part II, IMA Vol. in Math. and its Applications, Vol. 21<\/em>, Springer, New York – Berlin (1990), pp. 70-85.<\/li>
  31. Spanning sets and scattering sets in Steiner triple systems<\/a> (with C.J. Colbourn and D.R. Stinson), Journal of Combinatorial Theory (A)<\/em> 57<\/strong> (1991), pp. 46-59.<\/li>
  32. Indecomposable triple systems with lambda = 6<\/a>, Journal of Combinatorial Mathematics and Combinatorial Computing<\/em> 5<\/strong> (1989), pp. 139-142.<\/li>
  33. Heuristic algorithms for finding irregularity strengths of graphs<\/a> (with D.K. Garnick), Journal of Combinatorial Mathematics and Combinatorial Computing<\/em> 8<\/strong> (1990), pp. 195-208.<\/li>
  34. Trains: an invariant for one-factorizations<\/a> (with W.D. Wallis), Ars Combinatoria<\/em> 32<\/strong> (1991), pp. 161-180.<\/li>
  35. Indecomposable triple systems exist for all lambda<\/a> (with D. Archdeacon), Discrete Math<\/em> 113<\/strong> (1993), pp. 1-6.<\/li>
  36. A brief introduction to design theory<\/a> (with D.R. Stinson), Contemporary Design Theory: A Collection of Surveys<\/em>, Wiley, New York, 1992, pp. 1-12.<\/li>
  37. Room squares and related designs<\/a> (with D.R. Stinson), Contemporary Design Theory: A Collection of Surveys<\/em>, Wiley, New York, 1992, pp. 137-194.<\/li>
  38. The irregularity strength of the m x n grid <\/a>(with D. K. Garnick and A. Gyarfas), Journal of Graph Theory<\/em> 16<\/strong> (1992), pp. 355-374.<\/li>
  39. A few more Room frames<\/a> (with D.R. Stinson), Graphs, Matrices and Designs<\/em>, Marcel Dekker, New York, 1993, pp. 133-146.<\/li>
  40. Uniform Room frames with five holes<\/a> (with E.R. Lamken), Journal of Combinatorial Designs<\/em> 1<\/strong> (1993), pp. 323-328.<\/li>
  41. On the number of one-factorizations of the complete graph on 12 points<\/a> (with D. K. Garnick), Congressus Numerantium<\/em>, 94<\/strong> (1993), pp. 159-168.<\/li>
  42. Howell designs with sub-designs<\/a> (with E.R. Lamken), Journal of Combinatorial Theory (A)<\/em> 65<\/strong> (1994), pp. 268 – 301.<\/li>
  43. The stipulation polynomial of a uniquely list-colorable graph<\/a> (with W.J. Martin), Australasian Journal of Combinatorics<\/em>, 11<\/strong> (1995), pp. 105 – 115.<\/li>
  44. Holey factorizations<\/a> (with D. K. Garnick), Ars Combinatoria<\/em>, 44<\/strong> (1996), pp. 65 – 92.<\/li>
  45. There are 526,915,620 nonisomorphic one-factorizations of K12<\/a>, (with D.K. Garnick and B.D. McKay), Journal of Combinatorial Designs<\/em> 2<\/strong> (1994), pp. 273 – 285.<\/li>
  46. Thwarts in transversal designs<\/a> (with C.J. Colbourn and M. Wotjas), Designs, Codes and Cryptography<\/em>, 5<\/strong> (1995), pp. 189 – 197.<\/li>
  47. On the spectra of certain classes of Room frames<\/a> (with D.R. Stinson and L.Zhu), Electronic Journal of Combinatorics<\/em> 1<\/strong> (1994), #R7, 21 pages.<\/li>
  48. There are 23 nonisomorphic perfect one-factorizations of K14<\/a>, (with D.K. Garnick), Journal of Combinatorial Designs<\/em>, 4<\/strong> (1996), pp. 1-4.<\/li>
  49. Making the MOLS Table<\/a> (with C.J. Colbourn), Computational and Constructive Design Theory<\/em>, (W.D. Wallis, ed.) Kluwer Academic Publishers, Norwell, Ma, 1996, pp. 67-134.<\/li>
  50. More thwarts in transversal designs<\/a> (with C.J. Colbourn and D.R. Stinson), Finite Fields and Applications<\/em>, 2<\/strong> (1996), pp. 293-303.<\/li>
  51. Disjoint difference families with block size 3<\/a> (with P. Rodney), Utilitas Math.<\/em>, 52 <\/strong>(1997), pp. 153-160<\/li>
  52. HOPS and COPS in Room frames<\/a> (with E.R. Lamken), Designs, Codes and Cryptography<\/em>, 19<\/strong> (2000), pp. 5-26.<\/li>
  53. N(n) and nu(n): similarities and differences<\/a> (with C.J. Colbourn), in Combinatorics, Complexity and Logic<\/em> (D.S. Bridges et al, eds.), Springer, Berlin, 1996, pp. 25-36.<\/li>
  54. Complete arcs in Steiner triple systems <\/a>(with C.J. Colbourn), Journal of Combinatorial Theory (A)<\/em>, 80 <\/strong>(1997), pp. 320-333<\/li>
  55. Room square patterns<\/a> (with E.R. Lamken), Journal of Statistical Planning and Inference<\/em>, 86<\/strong> (2000), pp. 397-410.<\/li>
  56. Generating sets in Steiner triple systems<\/a>, (with C.J. Colbourn), Mathematica Slovaca<\/em>, 50<\/strong> (2000), pp. 259-269.<\/li>
  57. Quorum systems constructed from Combinatorial Designs<\/a>, (with C.J. Colbourn and D.R. Stinson), Information and Comutation<\/em>, 169<\/strong> (2001), 160-173.<\/li>
  58. Block disjoint difference families for Steiner triple systems: v = 3 mod 6<\/a>, (with Nabil Shalaby), Journal of Statistical Planning and Inference<\/em>, 106<\/strong> (2002), 77-86.<\/li>
  59. Bicoloring Steiner triple systems<\/a>, (with C.J. Colbourn and A. Rosa), Electronic Journal of Combinatorics ,<\/em> 6 <\/strong>(1999), #R25, 16 pages.<\/li>
  60. Selected applications of combinatorial design theory<\/a>, (with C.J. Colbourn and D.R. Stinson), Surveys in Combinatorics, 1999 ,<\/em> (J.D Lamb and D.A. Preece, eds), Cambridge Univ. Press, Cambridge, pp. 37 – 100.<\/li>
  61. Mutually orthogonal latin squares: A brief survey of constructions<\/a>, (with C.J. Colbourn), Journal of Statistical Planning and Inference<\/em>, 95<\/strong> (2001), pp 9-48.<\/li>
  62. The existence of referee squares<\/a>, (with A.C.H. Ling), Discrete Mathematics<\/em>, 232<\/strong> (2001), 109 – 112.<\/li>
  63. Combinatorics in undergraduate courses<\/a>, (with I. Anderson, C. Rodger, and B. Webb), Bulletin of the Institute for Combinatorics and its Applications<\/em>, 32<\/strong> (2001), 37 – 52..<\/li>
  64. Scheduling the XFL<\/a>, (with D. Froncek), Congressus Numerantium<\/em>, 147<\/strong> (2000), 5 – 15<\/li>
  65. A singular direct product for bicoloring Steiner triple systems<\/a> (with D.R. Stinson), Codes and Designs<\/em> (edited by K.T. Arasu and A. Seress), de Gruyter, Berlin, 2002, 87 – 98.<\/li>
  66. Complementary partial resolution squares for Steiner triple systems<\/a> (with E.R. Lamken and A.C.H. Ling), Discrete Math<\/em>, 261<\/strong> (2003), 243-254.<\/li>
  67. New lower bounds on the maximum number of mutually orthogonal Steiner triple systems <\/a>(with P. Dukes), Designs 2002: Further Computational and Constructive Design Theory<\/em>, (W.D. Wallis, ed.) Kluwer Publishers, Norwell, Ma, 2002, 81 – 101.<\/li>
  68. Sets of three pairwise orthogonal Steiner triple systems<\/a>, (with A.C.H. Ling and P. Dukes), Journal of Combinatorial Theory (A)<\/em>, 101<\/strong> (2003), 90 – 116.<\/li>
  69. Cycle systems in the complete bipartite graph minus a one-factor<\/a> (with D. Archdeacon, M. Debowsky and H. Gavlas), Discrete Math. <\/em>, 284 <\/strong>(2004) (Special issue in honor of Curt Lindner on his 65th birthday), 37-43. http:\/\/authors.elsevier.com\/sd\/article\/S0012365X04001207<\/a><\/li>
  70. Enumeration of balanced tournament designs on 10 points <\/a>(with M. Dinitz), Journal of Combinatorial Mathematics and Combinatorial Computing<\/em>, 52<\/strong> (2005), 51 – 64.<\/li>
  71. On the maximum number of different ordered pairs of symbols in sets of latin squares <\/a>(with D. R. Stinson), Journal of Combinatorial Designs<\/em>, 13<\/strong> (2005), 1- 15.<\/li>
  72. On assigning referees to tournament schedules <\/a>(with D.R. Stinson), Bulletin of the Institute of Combinatorics and its Applications<\/em>, 44<\/strong> (2005), 22 – 28.<\/li>
  73. Sequentially perfect and uniform one-factorizations of the complete graph<\/a> (with P. Dukes and D.R. Stinson), Electron. J. Combin.<\/em> 12<\/strong> (2005), #R1, 12 pages.<\/li>
  74. Designing schedules for leagues and tournaments<\/a>, Graph Theory Notes of New York<\/em>, 48<\/strong> (2005), 7 – 21.<\/li>
  75. On the structure of uniform one-factorizations from starters in finite fields<\/a> (with P. Dukes), Finite Fields and Applications<\/em>, 12<\/strong> (2006), 283 – 300.<\/li>
  76. Fault Tolerant Routings with Minimum Optical Index<\/a> (with A.C.H. Ling and D.R. Stinson), Networks<\/em>, 48 <\/strong>(2006), 47-55.<\/li>
  77. Perfect hash families from transversal designs<\/a> (with A.C.H. Ling and D.R. Stinson), Australasian Journal of Combinatorics<\/em>, 37<\/strong> (2007), 233-242.<\/li>
  78. Two new infinite families of extremal class-uniformly resolvable designs <\/a>(with A.C.H. Ling), Journal of Combinatorial Designs<\/em>, 16<\/strong> (2008), 213-220.<\/li>
  79. Maximum uniformly resolvable designs with block sizes 2 and 4 <\/a>(with A.C.H. Ling and P. Danziger), Discrete Math<\/em> 309<\/strong> (2009), pp. 4716-4721, Special issue in honor of Anthony Hilton.<\/li>
  80. The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle<\/a> (with A.C.H. Ling), Journal of Combinatorial Designs<\/em>, 17<\/strong> (2009), 160-176.<\/li>
  81. The Hamilton-Waterloo problem with triangle-factors and Hamilton cycles: The case n = 3 (mod 18) <\/a>(with A.C.H. Ling). Journal of Combinatorial Mathematics and Combinatorial Computing<\/em>, 70<\/strong> (2009), 143 — 147.<\/li>
  82. On Hamiltonian paths with prescribed edge lengths in the complete graph<\/a> (with S. Janiszewski), Bulletin of the Institute of Combinatorics and its Applications<\/em>, 57<\/strong> (2009), 42–52.<\/li>
  83. On orthogonal generalized equitable rectangles<\/a> (with H. Cao, D. Kreher, D. Stinson, R. Wei), Des. Codes Cryptogr. <\/em>51<\/strong> (2009), 225–230.<\/li>
  84. The existence of N2<\/sub> resolvable latin squares<\/a> (with A.J. Wolfe and A.C.H. Ling), SIAM J. Discrete Math.<\/em>, 23<\/strong> (2009), 1217–1237.<\/li>
  85. The spectra of certain classes of Room frames: The last cases<\/a> (with G. Warrington), Electron. J. Combin<\/em> 17<\/strong> (2010), #R74, 13 pages.<\/li>
  86. Constructions for retransmission permutation arrays<\/a> (with M.B. Patterson, D.R. Stinson and R. Wei), Des. Codes Cryptogr. <\/em>, 65<\/strong> (2012), 325 — 351.<\/li>
  87. Packing Costas Arrays <\/a>(with P.J.R. Ostergard and D. R. Stinson), Journal of Combinatorial Mathematics and Combinatorial Computing<\/em>, 80<\/strong> (2012), 385–403.<\/li>
  88. Estimating landscape carrying capacity through maximum clique analysis <\/a>(with T.M. Donovan, G. Warrington and W.S. Schwenk), Ecological Applications<\/em>, 22<\/strong> (2012), 2265 — 2276.<\/li>
  89. On the existence of three dimensional Room frames and Howell cubes <\/a>(With E.R. Lamken and G.S. Warrington) Discrete Mathematics<\/em>, 313<\/strong> (2013) 1368 — 1384.<\/li>
  90. An analysis of NK landscapes: Interaction structure, statistical properties and expected number of local optima<\/a> (with J. Buzas) IEEE Transactions on Evolutionary Computing<\/em>, 18<\/strong> (2014), 807 — 818.<\/li>
  91. On Maximal Partial Costas Latin Squares<\/a> (with M.R. Frank) Journal of Combinatorial Mathematics and Combinatorial Computing<\/em>, 93<\/strong> (2015), 23-32<\/li>
  92. Square integer Heffter arrays with empty cells<\/a> (with D.S. Archdeacon, D.M. Donovan, and E. S. Yazici), Des. Codes Cryptogr<\/em>., 77<\/strong>\u00a0 (2015), 409 — 426<\/li>
  93. On Partial Sums in Cyclic Groups<\/a> (with D.S. Archdeacon, A. Mattern and D.R. Stinson), Journal of Combinatorial Mathematics and Comb. Computing, <\/em>98<\/strong> (2016),\u00a0 327-342.<\/li>
  94. Guest Editorial: Special issue in honour of Dan S. Archdeacon,<\/a> (with P. Bonnington and J. \u0160ir\u00e1\u0148), Australasian Journal of Combinatorics<\/em>, 67<\/strong> (2017), 65 – 76.<\/li>
  95. Biembedding Steiner triple systems and n<\/em>-cycle systems on orientable surfaces<\/a> (with A. Mattern),\u00a0 Australasian Journal of Combinatorics<\/em>, 67<\/strong> (2017), 327 -344.<\/li>
  96. Tight Heffter arrays exist for all possible orders<\/a>, (with D.S. Archdeacon and T. Boothby).\u00a0\u00a0 J. of Combinatorial Designs<\/em> 25<\/strong> (2017), 5 \u2013 35.<\/li>
  97. The existence of square integer Heffter arrays<\/a>, (with I.M. Wanless), Ars. Math. Contemp<\/em>. 13 <\/strong>(2017), 81 — 93.<\/li>
  98. The existence of square non-integer Heffter arrays<\/a> (with N.J. Cavenaugh, D. Donovan and E. S. Yazici), Ars. Math. Contemp<\/em>, 17 <\/strong>(2019), 369 \u2013 395.<\/li>
  99. Seeds for generalized taxicab numbers<\/a> (with R. Games and R. Roth), J. Integer Seq.<\/em> 22 <\/strong>(2019), Article 19.3.3, 16 pages.<\/li>
  100. A survey of Heffter arrays<\/a> (with Anita Pasotti), to appear.<\/li><\/ol>\n","protected":false},"excerpt":{"rendered":"

    New lower bounds for the number of pairwise orthogonal symmetric Latin squares, Congressus Numerantium 23 (1979), pp. 393-398. Boss block designs (with D.R. Stinson), Ars Combinatoria 9 (1980), pp. 59-68. A fast algorithm for finding strong starters (with D.R. Stinson), SIAM J. on Algebraic and Discrete Methods, Vol. 2, No. 1, March 1981, pp. 50-56. … <\/p>\n

    Continue reading “Publications”<\/span><\/a><\/p>\n","protected":false},"author":6743,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-237","page","type-page","status-publish","hentry","entry"],"featured_image_src":null,"featured_image_src_square":null,"_links":{"self":[{"href":"https:\/\/site.uvm.edu\/jdinitz\/index.php?rest_route=\/wp\/v2\/pages\/237","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/site.uvm.edu\/jdinitz\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/site.uvm.edu\/jdinitz\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/site.uvm.edu\/jdinitz\/index.php?rest_route=\/wp\/v2\/users\/6743"}],"replies":[{"embeddable":true,"href":"https:\/\/site.uvm.edu\/jdinitz\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=237"}],"version-history":[{"count":8,"href":"https:\/\/site.uvm.edu\/jdinitz\/index.php?rest_route=\/wp\/v2\/pages\/237\/revisions"}],"predecessor-version":[{"id":507,"href":"https:\/\/site.uvm.edu\/jdinitz\/index.php?rest_route=\/wp\/v2\/pages\/237\/revisions\/507"}],"wp:attachment":[{"href":"https:\/\/site.uvm.edu\/jdinitz\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=237"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}