Publications of Zevi Miller

Note that some PDF versions have been automatically translated from Microsoft Word. Some symbols may be incorrect. Contact the author for a hard copy.

  1. Tao Jiang, Zevi Miller, Dan Pritikin, Near optimal bounds for Steiner trees in the hypercube, SIAM Journal on Computing 40 (2011), no. 5, 1340-1360.

  2. Tao Jiang, Zevi Miller, Dan Pritikin, Separation numbers of trees, Theoretical Computer Science 410 (2009), 3769-3781.

  3. David Craft, Zevi Miller, Dan Pritikin, A Solitaire Game Played on 2-Colored Graphs, Figure Discrete Math. 309 (2009), no. 1, 188-201.

  4. Reza Akhtar, Tao Jiang, Zevi Miller, Asymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs, SIAM J. Discrete Math. 22 (2008), no. 2, 425-449.

  5. Zevi Miller, Dan Pritikin, Manley Perkel, and I. H. Sudborough, The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem, Networks 45 (2005), no. 3, 143-164.

  6. Noga Alon, Tao Jiang, Zevi Miller, and Dan Pritikin, Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints, Random Structures Algorithms 23 (2003), no. 4, 409-433.

  7. Y.-B. Lin, Z. Miller, M. Perkel, D. Pritikin, and I. H. Sudborough, Expansion of layouts of complete binary trees into grids, Discrete Appl. Math. 131 (2003), no. 3, 611-642. MR2011372 (2004h:05034)

  8. L. Gardner, Z. Miller, D. Pritikin, and I. H. Sudborough, One-to-many embeddings of hypercubes into Cayley graphs generated by reversals, Theory Comput. Syst. 34 (2001), no. 5, 399-431. MR1862889 (2003j:68107)

  9. Zevi Miller and Dan Pritikin, On randomized greedy matchings, Random Structures Algorithms 10 (1997), no. 3, 353-383. MR1606234 (99b:05134)

  10. Z. Miller, D. Pritikin, and I. H. Sudborough, Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group, Math. Systems Theory 29 (1996), no. 6, 551-572. MR1412762 (98d:68170)

  11. Zevi Miller and Dan Pritikin, Separation in graphs: a survey and some new results, Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), Wiley-Intersci. Publ., Wiley, New York, 1995, pp. 801-817. MR1405859 (97d:05092)

  12. Arthur M. Hobbs and Zevi Miller, Total closure in outerplanar graphs, Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), Wiley-Intersci. Publ., Wiley, New York, 1995, pp. 557-577. MR1405839 (97d:05081)

  13. Zevi Miller and Manley Perkel, A stability theorem for the automorphism groups of powers of the n-cube, Australas. J. Combin. 10 (1994), 17-28. MR1296937 (95j:05110)

  14. Zevi Miller and I. H. Sudborough, Compressing grids into small hypercubes, Networks 24 (1994), no. 6, 327-357. MR1294099 (96f:68018)
    Note: Figures 4, 7, and 9 are missing from this online version.

  15. Zevi Miller and Dan Pritikin, Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube, Discrete Math. 131 (1994), no. 1-3, 183-194. MR1287732 (95e:05033)

  16. Zevi Miller, Dan Pritikin, and I. Hal Sudborough, Near embeddings of hypercubes into Cayley graphs on the symmetric group, IEEE Trans. Comput. 43 (1994), no. 1, 13-22. MR1266937 (95a:68009)

  17. Zevi Miller and Dan Pritikin, Eigenvalues and separation in graphs, Linear Algebra Appl. 181 (1993), 187-219. MR1204348 (94a:05111)

  18. Said Bettayeb, Zevi Miller, and I. Hal Sudborough, Embedding grids into hypercubes, J. Comput. System Sci. 45 (1992), no. 3, 340-366. MR1193377 (93i:05052)

  19. Zevi Miller and Manley Perkel, The Steiner problem in the hypercube, Networks 22 (1992), no. 1, 1-19. MR1140369 (93d:05095)

  20. Zevi Miller, Graph layouts, Applications of discrete mathematics, McGraw-Hill, New York, 1991, pp. 365-393. MR1260230 (94m:05182)

  21. Zevi Miller, Multidimensional bandwidth in random graphs, Graph theory, combinatorics, and applications. Vol. 2 (Kalamazoo, MI, 1988), Wiley-Intersci. Publ., Wiley, New York, 1991, pp. 861-870. MR1170830 (93c:05103)

  22. Z. Miller and D. Pritikin, The harmonious coloring number of a graph, Discrete Math. 93 (1991), no. 2-3, 211-228. MR1139582 (93g:05052)

  23. Colin McDiarmid and Zevi Miller, Lattice bandwidth of random graphs, Discrete Appl. Math. 30 (1991), no. 2-3, 221-227, ARIDAM III (New Brunswick, NJ, 1988). MR1095375 (92d:05140)

  24. Zevi Miller and I. H. Sudborough, A polynomial algorithm for recognizing bounded cutwidth in hypergraphs, Math. Systems Theory 24 (1991), no. 1, 11-40. MR1076123 (91i:68118)

  25. Bin Cong, Zevi Miller, and I. H. Sudborough, Optimum simulation of meshes by small hypercubes, Aspects and prospects of theoretical computer science (Smolenice, 1990), Lecture Notes in Comput. Sci., vol. 464, Springer, Berlin, 1990, pp. 30-46. MR1086398 (91j:68009)

  26. Chandra GowriSankaran, Zevi Miller, and Jaroslav Opatrný, A new bandwidth reduction algorithm for trees, Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1989), vol. 72, 1990, pp. 33-50. MR1041805 (91f:05102)

  27. Zevi Miller, Bandwidth in multigrids for random graphs, Combinatorics, computing and complexity (Tianjing and Beijing, 1988), Math. Appl. (Chinese Ser.), vol. 1, Kluwer Acad. Publ., Dordrecht, 1989, pp. 161-172. MR1095285 (92c:05141)

  28. Zevi Miller and Dan Pritikin, On the separation number of a graph, Networks 19 (1989), no. 6, 651-666. MR1013751 (91g:05078)

  29. Said Bettayeb, Zevi Miller, and I. Hal Sudborough, Embedding grids into hypercubes, VLSI algorithms and architectures (Corfu, 1988), Lecture Notes in Comput. Sci., vol. 319, Springer, New York, 1988, pp. 201-211. MR1017474

  30. Z. Miller and D. Pritikin, The harmonious coloring number of a graph, Congr. Numer. 63 (1988), 213-228, 250th Anniversary Conference on Graph Theory (Fort Wayne, IN, 1986). MR988653 (90b:05055)

  31. Ding Zhu Du and Zevi Miller, Matroids and subset interconnection design, SIAM J. Discrete Math. 1 (1988), no. 4, 416-424. MR968849 (89i:05157)

  32. Zevi Miller, A linear algorithm for topological bandwidth in degree-three trees, SIAM Journal on Computing 17 (1988), no. 5, 1018-1035. MR961055 (89j:05067)

  33. M. Goldberg and Z. Miller, A parallel algorithm for bisection width in trees, Comput. Math. Appl. 15 (1988), no. 4, 259-266. MR949277 (89k:68119)

  34. Z. Miller and I. H. Sudborough, A polynomial algorithm for recognizing small cutwidth in hypergraphs, VLSI algorithms and architectures (Loutraki, 1986), Lecture Notes in Comput. Sci., vol. 227, Springer, Berlin, 1986, pp. 252-260. MR861965

  35. Zevi Miller, A linear algorithm for topological bandwidth in degree three trees, Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), Wiley-Intersci. Publ., Wiley, New York, 1985, pp. 561-582. MR812692 (87d:05001)

  36. Z. Miller and J. B. Orlin, NP-completeness for minimizing maximum edge length in grid embeddings, J. Algorithms 6 (1985), no. 1, 10-16. MR780848 (86d:68059)

  37. Frank Harary and Zevi Miller, Generalized Ramsey theory. VIII. The size Ramsey number of small graphs, Studies in pure mathematics, Birkhäuser, Basel, 1983, pp. 271-283. MR820229 (87a:05105)

  38. Zevi Miller, Medians and distance sequences in graphs, Ars Combin. 15 (1983), 169-177. MR706298 (84h:05078)

  39. Zevi Miller, Minimum simplicial complexes with given abelian automorphism group, Trans. Amer. Math. Soc. 271 (1982), no. 2, 689-718. MR654857 (84j:05082)

  40. Zevi Miller, Extremal regular graphs for the achromatic number, Discrete Math. 40 (1982), no. 2-3, 235-253. MR676729 (84b:05048)

  41. Zevi Miller, The bandwidth of caterpillar graphs, Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. II (Baton Rouge, La., 1981), vol. 33, 1981, pp. 235-252. MR681918 (84d:68069)

  42. Zevi Miller and Heinrich Müller, Chromatic numbers of hypergraphs and coverings of graphs, J. Graph Theory 5 (1981), no. 3, 299-305. MR625071 (82m:05046)

  43. Fred Buckley, Zevi Miller, and Peter J. Slater, On graphs containing a given graph as center, J. Graph Theory 5 (1981), no. 4, 427-434. MR635706 (82k:05090)

  44. Andreas Blass, Frank Harary, and Zevi Miller, Which trees are link graphs?, J. Combin. Theory Ser. B 29 (1980), no. 3, 277-292. MR602420 (82h:05016)

  45. Richard A. Brualdi, Frank Harary, and Zevi Miller, Bigraphs versus digraphs via matrices, J. Graph Theory 4 (1980), no. 1, 51-73. MR558453 (81b:05077)

  46. Zevi Miller, Contractions of graphs: a theorem of Ore and an extremal problem, Discrete Math. 21 (1978), no. 3, 261-272. MR522900 (80a:05169)

  47. Frank Harary, Derbiau Hsu, and Zevi Miller, The bichromaticity of a tree, 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. MR499495 (80a:05093)

  48. Frank Harary and Zevi Miller, On point-symmetric and arc-symmetric digraphs, Nanta Math. 10 (1977), no. 1, 50-52. MR0543815 (58 #27612)

  49. Frank Harary, Derbiau Hsu, and Zevi Miller, The bichromaticity of a lattice-graph, J. Austral. Math. Soc. Ser. A 23 (1977), no. 3, 354-359. MR0505736 (58 #21756)

  50. Frank Harary, Derbiau Hsu, and Zevi Miller, The biparticity of a graph, J. Graph Theory 1 (1977), no. 2, 131-133. MR0444523 (56 #2874)

Back to home page.
millerz@muohio.edu