| Publication | Date of Publication | Type |
|---|
| New lower bounds for permutation arrays using contraction | 2019-09-12 | Paper |
| Near embeddings of hypercubes into Cayley graphs on the symmetric group | 2018-09-14 | Paper |
| On the bandwidth of the Kneser graph | 2017-06-19 | Paper |
| Embedding multidimensional grids into optimal hypercubes | 2014-09-10 | Paper |
| Near Optimal Bounds for Steiner Trees in the Hypercube | 2012-02-11 | Paper |
| Separation numbers of trees | 2009-09-10 | Paper |
| Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs | 2009-05-27 | Paper |
| A solitaire game played on 2-colored graphs | 2009-01-28 | Paper |
| The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem | 2005-06-01 | Paper |
| Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints | 2004-02-03 | Paper |
| One-to-many embeddings of hypercubes into Cayley graphs generated by reversals | 2002-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344227 | 1998-06-01 | Paper |
| Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group | 1996-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871043 | 1996-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871172 | 1996-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873760 | 1996-04-22 | Paper |
| Compressing grids into small hypercubes | 1995-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325276 | 1995-03-08 | Paper |
| Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube | 1995-01-02 | Paper |
| Eigenvalues and separation in graphs | 1993-05-16 | Paper |
| Embedding grids into hypercubes | 1993-01-17 | Paper |
| The steiner problem in the hypercube | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3979258 | 1992-06-26 | Paper |
| A polynomial algorithm for recognizing bounded cutwidth in hypergraphs | 1991-01-01 | Paper |
| Lattice bandwidth of random graphs | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3035304 | 1990-01-01 | Paper |
| On the separation number of a graph | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491611 | 1989-01-01 | Paper |
| Matroids and Subset Interconnection Design | 1988-01-01 | Paper |
| A Linear Algorithm for Topological Bandwidth in Degree-Three Trees | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727401 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691780 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3320420 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335820 | 1983-01-01 | Paper |
| Extremal regular graphs for the achromatic number | 1982-01-01 | Paper |
| Minimum Simplicial Complexes with Given Abelian Automorphism Group | 1982-01-01 | Paper |
| On graphs containing a given graph as center | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739929 | 1981-01-01 | Paper |
| Chromatic numbers of hypergraphs and coverings of graphs | 1981-01-01 | Paper |
| Bigraphs versus digraphs via matrices | 1980-01-01 | Paper |
| Which trees are link graphs? | 1980-01-01 | Paper |
| Contractions of graphs: A theorem of Ore and an extremal problem | 1978-01-01 | Paper |
| The bichromaticity of a tree | 1978-01-01 | Paper |
| The biparticity of a graph | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4146752 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4141275 | 1977-01-01 | Paper |
