Zevi Miller

From MaRDI portal
Person:740974

Available identifiers

zbMath Open miller.zeviMaRDI QIDQ740974

List of research outcomes

PublicationDate of PublicationType
New lower bounds for permutation arrays using contraction2019-09-12Paper
Near embeddings of hypercubes into Cayley graphs on the symmetric group2018-09-14Paper
On the bandwidth of the Kneser graph2017-06-19Paper
Embedding multidimensional grids into optimal hypercubes2014-09-10Paper
Near Optimal Bounds for Steiner Trees in the Hypercube2012-02-11Paper
Separation numbers of trees2009-09-10Paper
Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs2009-05-27Paper
A solitaire game played on 2-colored graphs2009-01-28Paper
The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem2005-06-01Paper
Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints2004-02-03Paper
https://portal.mardi4nfdi.de/entity/Q43442271998-06-01Paper
Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group1996-12-01Paper
https://portal.mardi4nfdi.de/entity/Q48710431996-07-17Paper
https://portal.mardi4nfdi.de/entity/Q48711721996-07-17Paper
https://portal.mardi4nfdi.de/entity/Q48737601996-04-22Paper
Compressing grids into small hypercubes1995-05-01Paper
https://portal.mardi4nfdi.de/entity/Q43252761995-03-08Paper
Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube1995-01-02Paper
Eigenvalues and separation in graphs1993-05-16Paper
Embedding grids into hypercubes1993-01-17Paper
The steiner problem in the hypercube1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39792581992-06-26Paper
Lattice bandwidth of random graphs1991-01-01Paper
A polynomial algorithm for recognizing bounded cutwidth in hypergraphs1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30353041990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34916111989-01-01Paper
On the separation number of a graph1989-01-01Paper
A Linear Algorithm for Topological Bandwidth in Degree-Three Trees1988-01-01Paper
Matroids and Subset Interconnection Design1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37274011986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36917801985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33204201983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33358201983-01-01Paper
Extremal regular graphs for the achromatic number1982-01-01Paper
Minimum Simplicial Complexes with Given Abelian Automorphism Group1982-01-01Paper
On graphs containing a given graph as center1981-01-01Paper
Chromatic numbers of hypergraphs and coverings of graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47399291981-01-01Paper
Which trees are link graphs?1980-01-01Paper
Bigraphs versus digraphs via matrices1980-01-01Paper
Contractions of graphs: A theorem of Ore and an extremal problem1978-01-01Paper
The bichromaticity of a tree1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41412751977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41467521977-01-01Paper
The biparticity of a graph1977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Zevi Miller