The biparticity of a graph. - Frank Harary; Derbiau Hsu; Zevi Miller (J. Graph Theory, 1977)

Contractions of graphs: A theorem of ore and an extremal problem. - Zevi Miller (Discret. Math., 1978)

Which trees are link graphs? - Andreas Blass; Frank Harary; Zevi Miller (J. Comb. Theory B, 1980)

Bigraphs versus digraphs via matrices. - Richard A. Brualdi; Frank Harary; Zevi Miller (J. Graph Theory, 1980)

On graphs containing a given graph as center. - Fred Buckley; Zevi Miller; Peter J. Slater (J. Graph Theory, 1981)

Chromatic numbers of hypergraphs and coverings of graphs. - Zevi Miller; Heinrich Müller (J. Graph Theory, 1981)

Extremal regular graphs for the achromatic number. - Zevi Miller (Discret. Math., 1982)

NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings. - Zevi Miller; James B. Orlin (J. Algorithms, 1985)

A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. - Zevi Miller; Ivan Hal Sudborough (Aegean Workshop on Computing, 1986)

A Linear Algorithm for Topological Bandwidth in Degree-Three Trees. - Zevi Miller (SIAM J. Comput., 1988)

Matroids and Subset Interconnection Design. - Ding-Zhu Du; Zevi Miller (SIAM J. Discret. Math., 1988)

On the separation number of a graph. - Zevi Miller; Dan Pritikin (Networks, 1989)

Optimum Simulation of Meshes by Small Hypercubes. - Bin Cong; Zevi Miller; Ivan Hal Sudborough (IMYCS, 1990)

Lattice bandwidth of random graphs. - Colin McDiarmid; Zevi Miller (Discret. Appl. Math., 1991)

The harmonious coloring number of a graph. - Zevi Miller; Dan Pritikin (Discret. Math., 1991)

A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. - Zevi Miller; Ivan Hal Sudborough (Math. Syst. Theory, 1991)

Embedding Grids into Hypercubes. - Saïd Bettayeb; Zevi Miller; Ivan Hal Sudborough (J. Comput. Syst. Sci., 1992)

The steiner problem in the hypercube. - Zevi Miller; Manley Perkel (Networks, 1992)

Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract). - Saïd Bettayeb; Zevi Miller; Tony Peng; Ivan Hal Sudborough (Canada-France Conference on Parallel and Distributed Computing, 1994)

A stability theorem for the automorphism groups of powers of the n-cube. - Zevi Miller; Manley Perkel (Australas. J Comb., 1994)

Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube. - Zevi Miller; Dan Pritikin (Discret. Math., 1994)

Compressing grids into small hypercubes. - Zevi Miller; Ivan Hal Sudborough (Networks, 1994)

Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group. - Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (IEEE Trans. Computers, 1994)

Embedding hypercubes into pancake, cycle prefix and substring reversal networks. - Linda Gardner; Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (HICSS (2), 1995)

Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. - Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (Math. Syst. Theory, 1996)

On randomized greedy matchings. - Zevi Miller; Dan Pritikin (Random Struct. Algorithms, 1997)

On Mapping Complete Binary Trees into Grids and Extended Grids. - Y.-B. Lin; Ivan Hal Sudborough; Zevi Miller; Dan Pritikin; Manley Perkel (ISPAN, 1999)

Expansion of layouts of complete binary trees into grids. - Y.-B. Lin; Zevi Miller; Manley Perkel; Dan Pritikin; Ivan Hal Sudborough (Discret. Appl. Math., 2003)

Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. - Noga Alon; Tao Jiang 003; Zevi Miller; Dan Pritikin (Random Struct. Algorithms, 2003)

The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. - Zevi Miller; Dan Pritikin; Manley Perkel; Ivan Hal Sudborough (Networks, 2005)

Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs. - Reza Akhtar; Tao Jiang 003; Zevi Miller (SIAM J. Discret. Math., 2008)

A solitaire game played on 2-colored graphs. - David Craft; Zevi Miller; Dan Pritikin (Discret. Math., 2009)

Separation numbers of trees. - Tao Jiang 003; Zevi Miller; Dan Pritikin (Theor. Comput. Sci., 2009)

Near Optimal Bounds for Steiner Trees in the Hypercube. - Tao Jiang 003; Zevi Miller; Dan Pritikin (SIAM J. Comput., 2011)

Embedding multidimensional grids into optimal hypercubes. - Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (Theor. Comput. Sci., 2014)

On the bandwidth of the Kneser graph. - Tao Jiang 003; Zevi Miller; Derrek Yager (Discret. Appl. Math., 2017)

Maximizing Hamming Distance in Contraction of Permutation Arrays. - Sergey Bereg; Zevi Miller; Luis Gerardo Mojica; Linda Morales; Ivan Hal Sudborough (CoRR, 2018)

New lower bounds for permutation arrays using contraction. - Sergey Bereg; Zevi Miller; Luis Gerardo Mojica; Linda Morales; Ivan Hal Sudborough (Des. Codes Cryptogr., 2019)