The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Hans-Dietrich O. F. Gronau: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  26. Preface. [Citation Graph (, )][DBLP]


  27. Orthogonal covers by multiplication graphs. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002