New lower bounds for permutation arrays using contraction.
Des. Codes Cryptogr., 2019
Maximizing Hamming Distance in Contraction of Permutation Arrays.
On the bandwidth of the Kneser graph.
Discret. Appl. Math., 2017
Embedding multidimensional grids into optimal hypercubes.
Theor. Comput. Sci., 2014
Near Optimal Bounds for Steiner Trees in the Hypercube.
SIAM J. Comput., 2011
Separation numbers of trees.
Theor. Comput. Sci., 2009
A solitaire game played on 2-colored graphs.
Discret. Math., 2009
Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs.
SIAM J. Discret. Math., 2008
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem.
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints.
Random Struct. Algorithms, 2003
Expansion of layouts of complete binary trees into grids.
Discret. Appl. Math., 2003
On Mapping Complete Binary Trees into Grids and Extended Grids.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999
On randomized greedy matchings.
Random Struct. Algorithms, 1997
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group.
Math. Syst. Theory, 1996
Embedding hypercubes into pancake, cycle prefix and substring reversal networks.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group.
IEEE Trans. Computers, 1994
Compressing grids into small hypercubes.
Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube.
Discret. Math., 1994
A stability theorem for the automorphism groups of powers of the n-cube.
Australas. J Comb., 1994
Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract).
Proceedings of the Parallel and Distributed Computing, 1994
The steiner problem in the hypercube.
Embedding Grids into Hypercubes.
J. Comput. Syst. Sci., 1992
A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs.
Math. Syst. Theory, 1991
The harmonious coloring number of a graph.
Discret. Math., 1991
Lattice bandwidth of random graphs.
Discret. Appl. Math., 1991
Optimum Simulation of Meshes by Small Hypercubes.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990
On the separation number of a graph.
Matroids and Subset Interconnection Design.
SIAM J. Discret. Math., 1988
A Linear Algorithm for Topological Bandwidth in Degree-Three Trees.
SIAM J. Comput., 1988
A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs.
Proceedings of the VLSI Algorithms and Architectures, 1986
NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings.
J. Algorithms, 1985
Extremal regular graphs for the achromatic number.
Discret. Math., 1982
Chromatic numbers of hypergraphs and coverings of graphs.
J. Graph Theory, 1981
On graphs containing a given graph as center.
J. Graph Theory, 1981
Bigraphs versus digraphs via matrices.
J. Graph Theory, 1980
Which trees are link graphs?
J. Comb. Theory, Ser. B, 1980
Contractions of graphs: A theorem of ore and an extremal problem.
Discret. Math., 1978
The biparticity of a graph.
J. Graph Theory, 1977