Oliver Riordan

2009
32	EE	Béla Bollobás, Svante Janson, Oliver Riordan: Line-of-Sight Percolation. Combinatorics, Probability & Computing 18(1-2): 83-106 (2009)
2008
31	EE	Oliver Riordan: The k-Core and Branching Processes. Combinatorics, Probability & Computing 17(1): 111-136 (2008)
30	EE	Béla Bollobás, Oliver Riordan: Percolation on dual lattices with k-fold symmetry. Random Struct. Algorithms 32(4): 463-472 (2008)
2007
29	EE	Béla Bollobás, Oliver Riordan: A note on the Harris-Kesten Theorem. Eur. J. Comb. 28(6): 1720-1723 (2007)
28	EE	Béla Bollobás, Svante Janson, Oliver Riordan: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1): 3-122 (2007)
27	EE	Béla Bollobás, Svante Janson, Oliver Riordan: Spread-out percolation in Rd. Random Struct. Algorithms 31(2): 239-246 (2007)
26	EE	Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan: Degree distribution of the FKP network model. Theor. Comput. Sci. 379(3): 306-316 (2007)
2006
25	EE	Béla Bollobás, Oliver Riordan: Sharp thresholds and percolation in the plane. Random Struct. Algorithms 29(4): 524-548 (2006)
2005
24	EE	Béla Bollobás, Svante Janson, Oliver Riordan: The phase transition in the uniformly grown random graph has infinite order. Random Struct. Algorithms 26(1-2): 1-36 (2005)
23	EE	Béla Bollobás, Oliver Riordan: Slow emergence of the giant component in the growing m-out graph. Random Struct. Algorithms 27(1): 1-24 (2005)
2004
22	EE	Béla Bollobás, Oliver Riordan: The Phase Transition and Connectedness in Uniformly Grown Random Graphs. WAW 2004: 1-18
21	EE	Béla Bollobás, Oliver Riordan: The Diameter of a Scale-Free Random Graph. Combinatorica 24(1): 5-34 (2004)
20	EE	Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov: On the Value of a Random Minimum Weight Steiner Tree. Combinatorica 24(2): 187-207 (2004)
2003
19	EE	Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan: Degree Distribution of the FKP Network Model. ICALP 2003: 725-738
18	EE	Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan: Directed scale-free graphs. SODA 2003: 132-139
17		Béla Bollobás, Oliver Riordan: Robustness and Vulnerability of Scale-Free Random Graphs. Internet Mathematics 1(1): (2003)
16		Béla Bollobás, Oliver Riordan: Coupling Scale-Free and Classical Random Graphs. Internet Mathematics 1(2): (2003)
15	EE	Béla Bollobás, Oliver Riordan: Disjointly representing set systems. J. Comb. Theory, Ser. A 102(1): 1-9 (2003)
14	EE	Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp: Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory, Ser. B 87(2): 366-373 (2003)
2002
13		Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan: Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Combinatorics, Probability & Computing 11(4): (2002)
12	EE	Noga Alon, Jaroslaw Grytczuk, Mariusz Haluszczak, Oliver Riordan: Nonrepetitive colorings of graphs. Random Struct. Algorithms 21(3-4): 336-346 (2002)
2001
11	EE	Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott: Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. Eur. J. Comb. 22(1): 1-4 (2001)
10		Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor E. Tusnády: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3): 279-290 (2001)
2000
9		Oliver Riordan: Spanning Subgraphs Of Random Graphs. Combinatorics, Probability & Computing 9(2): (2000)
8		Oliver Riordan, Alex Selby: The Maximum Degree Of A Random Graph. Combinatorics, Probability & Computing 9(6): (2000)
7	EE	Béla Bollobás, Oliver Riordan: Polychromatic polynomials. Discrete Mathematics 219(1-3): 1-7 (2000)
6	EE	Béla Bollobás, Oliver Riordan: Constrained Graph Processes. Electr. J. Comb. 7: (2000)
5	EE	Béla Bollobás, Luke Pebody, Oliver Riordan: Contraction-Deletion Invariants for Graphs. J. Comb. Theory, Ser. B 80(2): 320-345 (2000)
1999
4	EE	Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp: Closure and Hamiltonian-connectivity of claw-free graphs. Discrete Mathematics 195(1-3): 67-80 (1999)
1998
3	EE	Béla Bollobás, Oliver Riordan: On some conjectures of Graffiti. Discrete Mathematics 179(1-3): 223-230 (1998)
2		Béla Bollobás, Oliver Riordan: Colorings generated by monotone properties. Random Struct. Algorithms 12(1): 1-25 (1998)
1	EE	Oliver Riordan: An Ordering on the Even Discrete Torus. SIAM J. Discrete Math. 11(1): 110-127 (1998)

Coauthor Index

1	Noga Alon	[12]
2	Paul N. Balister (Paul Balister)	[11] [14]
3	Noam Berger	[19] [26]
4	Béla Bollobás	[2] [3] [4] [5] [6] [7] [10] [11] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [32]
5	Christian Borgs	[18] [19] [26]
6	Jennifer T. Chayes	[18] [19] [26]
7	Colin Cooper	[13]
8	Alan M. Frieze	[13]
9	David Gamarnik	[20]
10	Jaroslaw Grytczuk	[12]
11	Mariusz Haluszczak	[12]
12	Svante Janson	[24] [27] [28] [32]
13	Luke Pebody	[5]
14	Bruce A. Reed	[13]
15	Zdenek Ryjácek	[4]
16	Akira Saito	[4]
17	Richard H. Schelp	[4] [14]
18	Alex D. Scott (Alexander D. Scott)	[11]
19	Alex Selby	[8]
20	Joel H. Spencer (Joel Spencer)	[10]
21	Benny Sudakov	[20]
22	Gábor E. Tusnády	[10]

Colors in the list of coauthors