2002 |
8 | EE | Yoshiharu Kohayakawa,
Bernd Kreuter:
The Width of Random Subsets of Boolean Lattices.
J. Comb. Theory, Ser. A 100(2): 376-386 (2002) |
2000 |
7 | | Yoshiharu Kohayakawa,
Bernd Kreuter,
Deryk Osthus:
The length of random subsets of Boolean lattices.
Random Struct. Algorithms 16(2): 177-194 (2000) |
1998 |
6 | EE | Yoshiharu Kohayakawa,
Bernd Kreuter,
Angelika Steger:
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.
Combinatorica 18(1): 101-120 (1998) |
5 | | Thomas Emden-Weinert,
Stefan Hougardy,
Bernd Kreuter:
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth.
Combinatorics, Probability & Computing 7(4): 375-386 (1998) |
4 | | Bernd Kreuter:
Small sublattices in random subsets of Boolean lattices.
Random Struct. Algorithms 13(3-4): 383-407 (1998) |
1997 |
3 | | Bernd Kreuter,
Till Nierhoff:
Greedily Approximating the r-independent Set and k-center Problems on Random Instances.
RANDOM 1997: 43-53 |
2 | | Yoshiharu Kohayakawa,
Bernd Kreuter:
Threshold functions for asymmetric Ramsey properties involving cycles.
Random Struct. Algorithms 11(3): 245-276 (1997) |
1996 |
1 | | Bernd Kreuter:
Threshold functions for asymmetric Ramsey properties with respect to vertex colorings.
Random Struct. Algorithms 9(3): 335-348 (1996) |