 | 2003 |
|---|
| 8 |       | Richard A. Duke,
Paul Erdös,
Vojtech Rödl:
On large intersecting subfamilies of uniform setfamilies.
Random Struct. Algorithms 23(4): 351-356 (2003) |
| 1995 |
|---|
| 7 | | Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl:
On Uncrowded Hypergraphs.
Random Struct. Algorithms 6(2/3): 209-212 (1995) |
| 6 | | Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl:
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.
SIAM J. Comput. 24(3): 598-620 (1995) |
| 1994 |
|---|
| 5 | | Noga Alon,
Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl,
Raphael Yuster:
The Algorithmic Aspects of the Regularity Lemma.
J. Algorithms 16(1): 80-109 (1994) |
| 4 |  | Richard A. Duke,
Vojtech Rödl:
The Erdös-Ko-Rado Theorem for Small Families.
J. Comb. Theory, Ser. A 65(2): 246-251 (1994) |
| 1992 |
|---|
| 3 | | Noga Alon,
Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl,
Raphael Yuster:
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)
FOCS 1992: 473-481 |
| 2 | | Richard A. Duke,
Paul Erdös,
Vojtech Rödl:
Cycle-connected graphs.
Discrete Mathematics 108(1-3): 261-278 (1992) |
| 1985 |
|---|
| 1 | | Vojtech Rödl,
Richard A. Duke:
On graphs with small subgraphs of large chromatic number.
Graphs and Combinatorics 1(1): 91-96 (1985) |
Data released under the ODC-BY 1.0 license — See also our legal information page