A. J. Radcliffe

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j17		Jonathan Cutler, A. J. Radcliffe: Hypergraph Independent Sets. Combinatorics, Probability & Computing 22(1): 9-20 (2013)
	2011
j16		Jonathan Cutler, A. J. Radcliffe: An Entropy Proof of the Kahn-Lovász Theorem. Electr. J. Comb. 18(1) (2011)
j15		Jonathan Cutler, A. J. Radcliffe: Extremal Problems for Independent Set Enumeration. Electr. J. Comb. 18(1) (2011)
j14		Josh Brown Kramer, Jonathan Cutler, A. J. Radcliffe: Negative Dependence and Srinivasan's Sampling Process. Combinatorics, Probability & Computing 20(3): 347-361 (2011)
j13		Jonathan Cutler, A. J. Radcliffe: Extremal graphs for homomorphisms. Journal of Graph Theory 67(4): 261-284 (2011)
	2010
j12		C. Anderson, Jonathan Cutler, A. J. Radcliffe, Lorenzo Traldi: On the interlace polynomials of forests. Discrete Mathematics 310(1): 31-36 (2010)
	2006
j11		A. J. Radcliffe, Alex D. Scott: Reconstructing under Group Actions. Graphs and Combinatorics 22(3): 399-419 (2006)
	2004
j10		Patricia Nelson, A. J. Radcliffe: Semi-regular graphs of minimum independence number. Discrete Mathematics 275(1-3): 237-263 (2004)
	2003
j9		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
j8		A. J. Radcliffe, Alex D. Scott: Reconstructing Subsets of Reals. Electr. J. Comb. 6 (1999)
	1998
j7		A. J. Radcliffe, Alex D. Scott: Reconstructing Subsets of Z_n. J. Comb. Theory, Ser. A 83(2): 169-187 (1998)
	1997
j6		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
j5		A. J. Radcliffe, Zsuzsanna Szaniszló: Extremal Cases of the Ahlswede-Cai Inequality. J. Comb. Theory, Ser. A 76(1): 108-120 (1996)
	1995
j4		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)
j3		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)
j2		Béla Bollobás, A. J. Radcliffe: Defect Sauer Results. J. Comb. Theory, Ser. A 72(2): 189-208 (1995)
	1994
j1		Imre Leader, A. J. Radcliffe: Littlewood-Offord Inequalities for Random Variables. SIAM J. Discrete Math. 7(1): 90-101 (1994)
	1993
c1		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	C. Anderson	[j12]
2	David M. Berman	[j6]
3	Béla Bollobás	[j2]
4	Jonathan Cutler	[j17] [j16] [j15] [j14] [j13] [j12]
5	Alan M. Frieze	[j4] [c1]
6	Josh Brown Kramer	[j14]
7	Imre Leader	[j1]
8	Patricia Nelson	[j10]
9	Luke Pebody	[j9]
10	Alex D. Scott (Alexander D. Scott)	[j11] [j9] [j8] [j7] [j6] [j3]
11	Stephen Suen	[j4] [c1]
12	Zsuzsanna Szaniszló	[j5]
13	Lorenzo Traldi	[j12]
14	Hong Wang 0022	[j6]
15	Larry Wargo	[j6]

Colors in the list of coauthors

Last update Sun May 19 08:27:12 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page