A. J. Radcliffe

	2006
12		A. J. Radcliffe, Alex D. Scott: Reconstructing under Group Actions. Graphs and Combinatorics 22(3): 399-419 (2006)
	2004
11		Patricia Nelson, A. J. Radcliffe: Semi-regular graphs of minimum independence number. Discrete Mathematics 275(1-3): 237-263 (2004)
	2003
10		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		A. J. Radcliffe, Alex D. Scott: Reconstructing Subsets of Reals. Electr. J. Comb. 6: (1999)
	1998
8		A. J. Radcliffe, Alex D. Scott: Reconstructing Subsets of Zn. J. Comb. Theory, Ser. A 83(2): 169-187 (1998)
	1997
7		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		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		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		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

Coauthor Index

1	David M. Berman	[7]
2	Béla Bollobás	[3]
3	Alan M. Frieze	[1] [5]
4	Imre Leader	[2]
5	Patricia Nelson	[11]
6	Luke Pebody	[10]
7	Alex D. Scott (Alexander D. Scott)	[4] [7] [8] [9] [10] [12]
8	Stephen Suen	[1] [5]
9	Zsuzsanna Szaniszló	[6]
10	Hong Wang	[7]
11	Larry Wargo	[7]

Colors in the list of coauthors