{"id":9,"date":"2022-01-11T12:43:51","date_gmt":"2022-01-11T17:43:51","guid":{"rendered":"https:\/\/sites.miamioh.edu\/millerz\/?page_id=9"},"modified":"2025-10-28T10:20:05","modified_gmt":"2025-10-28T14:20:05","slug":"publications","status":"publish","type":"page","link":"https:\/\/sites.miamioh.edu\/millerz\/publications\/","title":{"rendered":"Publications of Zevi Miller"},"content":{"rendered":"\n

<\/p>\n\n\n\n

<\/p>\n\n\n\n

    \n
  1. S. Bereg, Z. Miller, I.H. Sudborough, Upper Bounds for Chebyshev Permutation Arrays, Entropy<\/em>,<\/a> (2025) 27 (6) 558, https:\/\/doi.org\/10.3390\/e27060558.<\/a><\/li>\n\n\n\n
  2. Zevi Miller, Walker Yane, A Saturation Problem on Meshes<\/em><\/a>, Discrete Mathematics, Algorithms and Applications https:\/\/doi.org\/10.1142\/S1793830925500569<\/a>.<\/li>\n\n\n\n
  3. Zevi Miller, Walker Yane, Saturation of K4 subdivisions in multidimensional grids<\/a>,<\/em> Journal of Combinatorial Mathematics and Combinatorial Computing, 123<\/strong> (2024) 585-626.<\/li>\n\n\n\n
  4. S. Bereg, Z. Miller, L. Mojica, L. Morales, I.H. Sudborough, New Lower Bounds for Permutation Arrays Using Contraction,<\/em><\/a> Designs, Codes and Cryptography 87<\/strong> (2019) 2105-2128.<\/li>\n\n\n\n
  5. T. Jiang, Z. Miller, and D. Yager, On the Bandwidth of the Kneser graph<\/em><\/a>, Discrete Applied Mathematics, 227 <\/strong>(2017) 84-94.<\/li>\n\n\n\n
  6. Z. Miller, D. Pritikin, and I.H. Sudborough, Embedding multidimensional grids into optimal hypercubes<\/em> <\/a>, Theoretical Computer Science 552<\/strong> (2014) 52-82.<\/li>\n\n\n\n
  7. T. Jiang, Z. Miller, and D.Pritikin, Near optimal bounds for Steiner trees in the hypercube<\/em><\/a>, SIAM Journal on Computing 40<\/strong> (2011), no. 5, 1340-1360.<\/li>\n\n\n\n
  8. T. Jiang, Z. Miller, and D. Pritikin, Separation numbers of trees<\/em><\/a>, Theoretical Computer Science 410<\/strong> (2009), 3769-3781.<\/li>\n\n\n\n
  9. D.Craft, Z. Miller, and D. Pritikin, A Solitaire Game Played on 2-Colored Graphs<\/em><\/a>, Figure<\/a> Discrete Math. 309<\/strong> (2009), no. 1, 188-201.<\/li>\n\n\n\n
  10. R. Akhtar, T. Jiang, and Z. Miller, Asymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs<\/em><\/a>, SIAM J. Discrete Math. 22<\/strong> (2008), no. 2, 425-449.<\/li>\n\n\n\n
  11. Z. Miller, D.Pritikin, M. Perkel, and I. H. Sudborough, The Sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner Problem<\/em>,<\/a> Networks 45<\/strong> (2005), no. 3, 143-164.<\/li>\n\n\n\n
  12. N. Alon, T. Jiang, Z. Miller, and D. Pritikin, Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints<\/em><\/a>, Random Structures & Algorithms 23<\/strong> (2003), no. 4, 409-433.<\/li>\n\n\n\n
  13. Y.-B. Lin, Z. Miller, M. Perkel, D. Pritikin, and I. H. Sudborough, Expansion of layouts of complete binary trees into grids<\/em><\/a>, Discrete Appl. Math. 131<\/strong> (2003), no. 3, 611-642.<\/li>\n\n\n\n
  14. L. Gardner, Z. Miller, D. Pritikin, and I. H. Sudborough, One-to-many embeddings of hypercubes into Cayley graphs generated by reversals<\/em><\/a>, Theory Comput. Syst. 34<\/strong> (2001), no. 5, 399-431.<\/li>\n\n\n\n
  15. Z. Miller and D. Pritikin, On randomized greedy matchings<\/em><\/a>, Random Structures & Algorithms 10<\/strong> (1997), no. 3, 353-383.<\/li>\n\n\n\n
  16. Z. Miller, D. Pritikin, and I. H. Sudborough, Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group<\/em><\/a>, Math. Systems Theory 29<\/strong> (1996), no. 6, 551-572.<\/li>\n\n\n\n
  17. Z. Miller and D.Pritikin, Separation in graphs: a survey and some new results<\/em><\/a>, Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), Wiley-Intersci. Publ., Wiley, New York, 1995, pp. 801-817.<\/li>\n\n\n\n
  18. Arthur M. Hobbs and Z. Miller, Total closure in outerplanar graphs<\/a><\/em>, Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), Wiley-Intersci. Publ., Wiley, New York, 1995, pp. 557-577.<\/li>\n\n\n\n
  19. Z. Miller and M. Perkel, A stability theorem for the automorphism groups of powers of the n-cube<\/a><\/em>, Australas. J. Combin. 10<\/strong> (1994), 17-28.<\/li>\n\n\n\n
  20. Z. Miller and I. H. Sudborough, Compressing grids into small hypercubes<\/em><\/a>, Networks 24<\/strong> (1994), no. 6, 327-357.
    Note: Figures 4, 7, and 9 are missing from this online version.<\/strong><\/li>\n\n\n\n
  21. Z. Miller and D.Pritikin, Applying a result of Frankl and R\u00f6dl to the construction of Steiner trees in the hypercube<\/em>, <\/a>Discrete Math. 131<\/strong> (1994), no. 1-3, 183-194.<\/li>\n\n\n\n
  22. Z. Miller, D. Pritikin, and I. Hal Sudborough, Near embeddings of hypercubes into Cayley graphs on the symmetric group<\/em><\/a>, IEEE Trans. Comput. 43<\/strong> (1994), no. 1, 13-22.<\/li>\n\n\n\n
  23. Z. Miller and D. Pritikin, Eigenvalues and separation in graphs<\/em><\/a>, Linear Algebra Appl. 181<\/strong> (1993), 187-219.<\/li>\n\n\n\n
  24. S. Bettayeb, Z. Miller, and I. H. Sudborough, Embedding grids into hypercubes<\/em>, J. Comput. System Sci. 45<\/strong> (1992), no. 3, 340-366.<\/li>\n\n\n\n
  25. Z. Miller and M. Perkel, The Steiner problem in the hypercube<\/em><\/a>, Networks 22<\/strong> (1992), no. 1, 1-19.<\/li>\n\n\n\n
  26. Z. Miller, Graph layouts<\/em><\/a>, (book chapter) Applications of discrete mathematics, McGraw-Hill, New York, 1991, pp. 365-393.<\/li>\n\n\n\n
  27. Z. Miller, Multidimensional bandwidth in random graphs<\/em>, Graph theory, combinatorics, and applications. Vol. 2 (Kalamazoo, MI, 1988), Wiley-Intersci. Publ., Wiley, New York, 1991, pp. 861-870.<\/li>\n\n\n\n
  28. Z. Miller and D. Pritikin, The harmonious coloring number of a graph<\/em>, Discrete Math. 93<\/strong> (1991), no. 2-3, 211-228.<\/li>\n\n\n\n
  29. C. McDiarmid and Z. Miller, Lattice bandwidth of random graphs<\/a><\/em>, Discrete Appl. Math. 30<\/strong> (1991), no. 2-3, 221-227, ARIDAM III (New Brunswick, NJ, 1988).<\/li>\n\n\n\n
  30. Z. Miller and I. H. Sudborough, A polynomial algorithm for recognizing bounded cutwidth in hypergraphs<\/em><\/a>, Math. Systems Theory 24<\/strong> (1991), no. 1, 11-40.<\/li>\n\n\n\n
  31. B. Cong, Z. Miller, and I. H. Sudborough, Optimum simulation of meshes by small hypercubes<\/em>, Aspects and prospects of theoretical computer science (Smolenice, 1990), Lecture Notes in Comput. Sci., vol. 464, Springer, Berlin, 1990, pp. 30-46.<\/li>\n\n\n\n
  32. C. Gowri Sankaran, Z. Miller, and J. Opatrn\u00fd, A new bandwidth reduction algorithm for trees<\/em><\/a>, Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1989), vol. 72, 1990, pp. 33-50.<\/li>\n\n\n\n
  33. Z. Miller, Bandwidth in multigrids for random graphs<\/em>, Combinatorics, computing and complexity (Tianjing and Beijing, 1988), Math. Appl. (Chinese Ser.), vol. 1, Kluwer Acad. Publ., Dordrecht, 1989, pp. 161-172.<\/li>\n\n\n\n
  34. Z. Miller and D. Pritikin, On the separation number of a graph<\/em><\/a>, Networks 19<\/strong> (1989), no. 6, 651-666.<\/li>\n\n\n\n
  35. S. Bettayeb, Z. Miller, and I. Hal Sudborough, Embedding grids into hypercubes<\/em>, VLSI algorithms and architectures (Corfu, 1988), Lecture Notes in Comput. Sci., vol. 319, Springer, New York, 1988, pp. 201-211.<\/li>\n\n\n\n
  36. Z. Miller and D. Pritikin, The harmonious coloring number of a graph<\/em>, Congr. Numer. 63<\/strong> (1988), 213-228, 250th Anniversary Conference on Graph Theory (Fort Wayne, IN, 1986).<\/li>\n\n\n\n
  37. D. Z. Du and Z. Miller, Matroids and subset interconnection design<\/em><\/a>, SIAM J. Discrete Math. 1<\/strong> (1988), no. 4, 416-424.<\/li>\n\n\n\n
  38. Z. Miller, A linear algorithm for topological bandwidth in degree-three trees<\/em><\/a>, SIAM Journal on Computing 17<\/strong> (1988), no. 5, 1018-1035.<\/li>\n\n\n\n
  39. M. Goldberg and Z. Miller, A parallel algorithm for bisection width in trees<\/em><\/a>, Comput. Math. Appl. 15<\/strong> (1988), no. 4, 259-266.<\/li>\n\n\n\n
  40. Z. Miller and I. H. Sudborough, A polynomial algorithm for recognizing small cutwidth in hypergraphs<\/em>, VLSI algorithms and architectures (Loutraki, 1986), Lecture Notes in Comput. Sci., vol. 227, Springer, Berlin, 1986, pp. 252-260.<\/li>\n\n\n\n
  41. Z. Miller, A linear algorithm for topological bandwidth in degree three trees<\/em>, Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), Wiley-Intersci. Publ., Wiley, New York, 1985, pp. 561-582.<\/li>\n\n\n\n
  42. Z. Miller and J. B. Orlin, NP-completeness for minimizing maximum edge length in grid embeddings<\/a><\/em>, J. Algorithms 6<\/strong> (1985), no. 1, 10-16.<\/li>\n\n\n\n
  43. F. Harary and Z. Miller, Generalized Ramsey theory. VIII. The size Ramsey number of small graphs<\/em>, Studies in pure mathematics, Birkh\u00e4user, Basel, 1983, pp. 271-283.<\/li>\n\n\n\n
  44. Z. Miller, Medians and distance sequences in graphs<\/a><\/em>, Ars Combin. 15<\/strong> (1983), 169-177.<\/li>\n\n\n\n
  45. Z. Miller, Minimum simplicial complexes with given abelian automorphism group<\/em><\/a>, Trans. Amer. Math. Soc. 271<\/strong> (1982), no. 2, 689-718.<\/li>\n\n\n\n
  46. Z. Miller, Extremal regular graphs for the achromatic number<\/em><\/a>, Discrete Math. 40<\/strong> (1982), no. 2-3, 235-253.<\/li>\n\n\n\n
  47. Z. Miller, The bandwidth of caterpillar graphs<\/em><\/a>, Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. II (Baton Rouge, La., 1981), vol. 33, 1981, pp. 235-252.<\/li>\n\n\n\n
  48. Z. Miller and H. Miller, Chromatic Numbers of Hypergraphs and Coverings of Graphs<\/a>, J. Graph Theory 5<\/strong> (1981), no. 3, 299-305.<\/li>\n\n\n\n
  49. F. Buckley, Z. Miller, and P.J. Slater, On graphs containing a given graph as center<\/em><\/a>, J. Graph Theory 5<\/strong> (1981), no. 4, 427-434.<\/li>\n\n\n\n
  50. A. Blass, F. Harary, and Z. Miller, Which trees are link graphs?<\/em><\/a>, J. Combin. Theory Ser. B 29<\/strong> (1980), no. 3, 277-292.<\/li>\n\n\n\n
  51. R.A. Brualdi, F. Harary, and Z.Miller, Bigraphs versus digraphs via matrices<\/em><\/a>, J. Graph Theory 4<\/strong> (1980), no. 1, 51-73.<\/li>\n\n\n\n
  52. Z. Miller, Contractions of graphs: a theorem of Ore and an extremal problem<\/a><\/em>, Discrete Math. 21<\/strong> (1978), no. 3, 261-272.<\/li>\n\n\n\n
  53. F. Harary, D. Hsu, and Z. Miller, The bichromaticity of a tree,<\/a><\/em> <\/a>Theory and applications of graphs(Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich., 1976), Lecture Notes in Math., vol. 642, Springer, Berlin, 1978, pp. 236-246.<\/li>\n\n\n\n
  54. F. Harary and Z. Miller, On point-symmetric and arc-symmetric digraphs<\/em>, Nanta Math. 10<\/strong> (1977), no. 1, 50-52.<\/li>\n\n\n\n
  55. F. Harary, D. Hsu, and Z. Miller, The bichromaticity of a lattice-graph<\/a><\/em>, J. Austral. Math. Soc. Ser. A 23<\/strong> (1977), no. 3, 354-359.<\/li>\n\n\n\n
  56. F. Harary, D. Hsu, and Z. Miller, The biparticity of a graph<\/a><\/em>, J. Graph Theory 1<\/strong> (1977), no. 2, 131-133.<\/li>\n<\/ol>\n\n\n\n
    \n\n\n\n

    Back to home page<\/a>.<\/p>\n\n\n\n

    \n\n\n\n

    millerz@miamioh.edu<\/a><\/p>\n\n\n\n

    <\/p>\n\n\n\n

    <\/p>\n\n\n\n\n\n\n\n

    <\/p>\n\n\n","protected":false},"excerpt":{"rendered":"

    Back to home page. millerz@miamioh.edu<\/p>\n","protected":false},"author":3036,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"class_list":["post-9","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/sites.miamioh.edu\/millerz\/wp-json\/wp\/v2\/pages\/9","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.miamioh.edu\/millerz\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.miamioh.edu\/millerz\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.miamioh.edu\/millerz\/wp-json\/wp\/v2\/users\/3036"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.miamioh.edu\/millerz\/wp-json\/wp\/v2\/comments?post=9"}],"version-history":[{"count":0,"href":"https:\/\/sites.miamioh.edu\/millerz\/wp-json\/wp\/v2\/pages\/9\/revisions"}],"wp:attachment":[{"href":"https:\/\/sites.miamioh.edu\/millerz\/wp-json\/wp\/v2\/media?parent=9"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}