| 2005 |
|---|
| 25 | EE | Jens-P. Bode,
Hans-Dietrich O. F. Gronau,
Heiko Harborth:
Some Ramsey Schur Numbers.
Combinatorics, Probability & Computing 14(1-2): 25-30 (2005) |
| 2004 |
|---|
| 24 | EE | Andreas Brandstädt,
Konrad Engel,
Hans-Dietrich O. F. Gronau,
Roger Labahn:
Preface: ODSA.
Discrete Applied Mathematics 138(1-2): 1 (2004) |
| 23 | EE | Ramadan El-Shanawany,
Hans-Dietrich O. F. Gronau,
Martin Grüttmüller:
Orthogonal double covers of Kn, n by small graphs.
Discrete Applied Mathematics 138(1-2): 47-63 (2004) |
| 22 | EE | Hans-Dietrich O. F. Gronau,
Donald L. Kreher,
Alan C. H. Ling:
Super-simple (v, 5, 2)-designs.
Discrete Applied Mathematics 138(1-2): 65-77 (2004) |
| 2002 |
|---|
| 21 | | Hans-Dietrich O. F. Gronau,
Martin Grüttmüller,
Sven Hartmann,
Uwe Leck,
Volker Leck:
On Orthogonal Double Covers of Graphs.
Des. Codes Cryptography 27(1-2): 49-91 (2002) |
| 1996 |
|---|
| 20 | EE | Gustav Burosch,
Hans-Dietrich O. F. Gronau,
Jean-Marie Laborde,
Ingo Warnke:
On posets of m-ary words.
Discrete Mathematics 152(1-3): 69-91 (1996) |
| 1995 |
|---|
| 19 | | Andrew Granville,
Hans-Dietrich O. F. Gronau,
Ronald C. Mullin:
On a Problem of Hering Concerning Orthogonal Covers of Kn.
J. Comb. Theory, Ser. A 72(2): 345-350 (1995) |
| 1994 |
|---|
| 18 | EE | Holger Brandes,
Heiko Harborth,
Hans-Dietrich O. F. Gronau,
Christian Schwahn:
Ramsey numbers for sets of small graphs.
Discrete Mathematics 125(1-3): 73-86 (1994) |
| 1991 |
|---|
| 17 | EE | Bernhard Ganter,
Hans-Dietrich O. F. Gronau:
Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions.
Discrete Mathematics 88(2-3): 149-155 (1991) |
| 1987 |
|---|
| 16 | | Hans-Dietrich O. F. Gronau:
Efficient Algorithmic Construction of Designs.
FCT 1987: 167-171 |
| 1986 |
|---|
| 15 | | Konrad Engel,
Hans-Dietrich O. F. Gronau:
An Erös - Ko - Rado Type Theorem II.
Acta Cybern. 7(4): 405-411 (1986) |
| 14 | EE | Hans-Dietrich O. F. Gronau,
Roger Labahn:
An extremal coloring problem on matrices.
Discrete Mathematics 61(2-3): 321-324 (1986) |
| 1985 |
|---|
| 13 | EE | Konrad Engel,
Hans-Dietrich O. F. Gronau:
An intersection-union theorem for integer sequences.
Discrete Mathematics 54(2): 153-159 (1985) |
| 1983 |
|---|
| 12 | | Hans-Dietrich O. F. Gronau:
Maximum Nontrivial k-uniform Set Families in Which no µ Sets Have an Empty Intersection.
Elektronische Informationsverarbeitung und Kybernetik 19(7/8): 357-364 (1983) |
| 11 | | Hans-Dietrich O. F. Gronau:
More on the Erdös-Ko-Rado Theorem for Integer Sequences.
J. Comb. Theory, Ser. A 35(3): 279-288 (1983) |
| 1982 |
|---|
| 10 | | Hans-Dietrich O. F. Gronau,
Chr. Proske:
Maximal families of restricted subsets f a finite set.
Acta Cybern. 5: 441-451 (1982) |
| 9 | | Hans-Dietrich O. F. Gronau:
On Sperner families in which no k sets have an empty intersection III.
Combinatorica 2(1): 25-36 (1982) |
| 1981 |
|---|
| 8 | EE | G. F. Clements,
Hans-Dietrich O. F. Gronau:
On maximal antichains containing no set and its complement.
Discrete Mathematics 33(3): 239-247 (1981) |
| 7 | EE | Hans-Dietrich O. F. Gronau:
On maximal families of subsets of a finite set.
Discrete Mathematics 34(2): 119-130 (1981) |
| 6 | EE | Hans-Dietrich O. F. Gronau:
Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I.
Discrete Mathematics 37(1): 67-72 (1981) |
| 5 | | Hans-Dietrich O. F. Gronau:
On Sperner Families in Which No k Sets Have an Empty Intersection, II.
J. Comb. Theory, Ser. A 30(3): 298-316 (1981) |
| 1980 |
|---|
| 4 | | Hans-Dietrich O. F. Gronau:
On Sperner families in which no 3 sets have an empty intersection.
Acta Cybern. 4: 213-220 (1980) |
| 3 | | Hans-Dietrich O. F. Gronau:
Recognition of monotone functions.
Acta Cybern. 4: 279-281 (1980) |
| 2 | | Hans-Dietrich O. F. Gronau:
On Sperner Families in which No K Sets Have an Empty Intersection.
J. Comb. Theory, Ser. A 28(1): 54-63 (1980) |
| 1 | | Hans-Dietrich O. F. Gronau:
On Maximal Antichains Consisting of Sets and Their Complements.
J. Comb. Theory, Ser. A 29(3): 370-375 (1980) |
