| 2006 |
|---|
| 11 | EE | Brendan Nagle,
Vojtech Rödl,
Mathias Schacht:
The counting lemma for regular k-uniform hypergraphs.
Random Struct. Algorithms 28(2): 113-179 (2006) |
| 2005 |
|---|
| 10 | EE | Penny E. Haxell,
Brendan Nagle,
Vojtech Rödl:
An Algorithmic Version of the Hypergraph Regularity Method.
FOCS 2005: 439-448 |
| 2004 |
|---|
| 9 | EE | Andrzej Czygrinow,
Brendan Nagle:
Bounding the strong chromatic index of dense random graphs.
Discrete Mathematics 281(1-3): 129-136 (2004) |
| 8 | EE | Andrzej Czygrinow,
Brendan Nagle:
Strong edge colorings of uniform graphs.
Discrete Mathematics 286(3): 219-223 (2004) |
| 2003 |
|---|
| 7 | | Yoshiharu Kohayakawa,
Brendan Nagle,
Vojtech Rödl:
Hereditary Properties Of Triple Systems.
Combinatorics, Probability & Computing 12(2): (2003) |
| 6 | EE | Andrzej Czygrinow,
Brendan Nagle:
Matrix-Free Proof of a Regularity Characterization.
Electr. J. Comb. 10: (2003) |
| 5 | EE | Penny E. Haxell,
Brendan Nagle,
Vojtech Rödl:
Integer and fractional packings in dense 3-uniform hypergraphs.
Random Struct. Algorithms 22(3): 248-310 (2003) |
| 4 | EE | Brendan Nagle,
Vojtech Rödl:
Regularity properties for triple systems.
Random Struct. Algorithms 23(3): 264-332 (2003) |
| 2002 |
|---|
| 3 | EE | Yoshiharu Kohayakawa,
Brendan Nagle,
Vojtech Rödl:
Efficient Testing of Hypergraphs.
ICALP 2002: 1017-1028 |
| 2 | EE | Y. Dementieva,
Penny E. Haxell,
Brendan Nagle,
Vojtech Rödl:
On characterizing hypergraph regularity.
Random Struct. Algorithms 21(3-4): 293-335 (2002) |
| 2001 |
|---|
| 1 | EE | Brendan Nagle,
Vojtech Rödl:
The asymptotic number of triple systems not containing a fixed one.
Discrete Mathematics 235(1-3): 271-290 (2001) |
