| 2006 |
|---|
| 12 | EE | A. J. Radcliffe,
Alex D. Scott:
Reconstructing under Group Actions.
Graphs and Combinatorics 22(3): 399-419 (2006) |
| 2004 |
|---|
| 11 | EE | Patricia Nelson,
A. J. Radcliffe:
Semi-regular graphs of minimum independence number.
Discrete Mathematics 275(1-3): 237-263 (2004) |
| 2003 |
|---|
| 10 | EE | Luke Pebody,
A. J. Radcliffe,
Alex D. Scott:
Finite Subsets of the Plane are 18-Reconstructible.
SIAM J. Discrete Math. 16(2): 262-275 (2003) |
| 1999 |
|---|
| 9 | EE | A. J. Radcliffe,
Alex D. Scott:
Reconstructing Subsets of Reals.
Electr. J. Comb. 6: (1999) |
| 1998 |
|---|
| 8 | EE | A. J. Radcliffe,
Alex D. Scott:
Reconstructing Subsets of Zn.
J. Comb. Theory, Ser. A 83(2): 169-187 (1998) |
| 1997 |
|---|
| 7 | EE | David M. Berman,
A. J. Radcliffe,
Alex D. Scott,
Hong Wang,
Larry Wargo:
All trees contain a large induced subgraph having all degrees 1 (mod k).
Discrete Mathematics 175(1-3): 35-40 (1997) |
| 1996 |
|---|
| 6 | EE | A. J. Radcliffe,
Zsuzsanna Szaniszló:
Extremal Cases of the Ahlswede-Cai Inequality.
J. Comb. Theory, Ser. A 76(1): 108-120 (1996) |
| 1995 |
|---|
| 5 | | Alan M. Frieze,
A. J. Radcliffe,
Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs.
Combinatorics, Probability & Computing 4: 47-66 (1995) |
| 4 | EE | A. J. Radcliffe,
Alex D. Scott:
Every tree contains a large induced subgraph with all degrees odd.
Discrete Mathematics 140(1-3): 275-279 (1995) |
| 3 | | Béla Bollobás,
A. J. Radcliffe:
Defect Sauer Results.
J. Comb. Theory, Ser. A 72(2): 189-208 (1995) |
| 1994 |
|---|
| 2 | EE | Imre Leader,
A. J. Radcliffe:
Littlewood-Offord Inequalities for Random Variables.
SIAM J. Discrete Math. 7(1): 90-101 (1994) |
| 1993 |
|---|
| 1 | | Alan M. Frieze,
A. J. Radcliffe,
Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs.
SODA 1993: 341-351 |
