dblp.uni-trier.dewww.uni-trier.de

Oliver Riordan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
32EEBéla Bollobás, Svante Janson, Oliver Riordan: Line-of-Sight Percolation. Combinatorics, Probability & Computing 18(1-2): 83-106 (2009)
2008
31EEOliver Riordan: The k-Core and Branching Processes. Combinatorics, Probability & Computing 17(1): 111-136 (2008)
30EEBéla Bollobás, Oliver Riordan: Percolation on dual lattices with k-fold symmetry. Random Struct. Algorithms 32(4): 463-472 (2008)
2007
29EEBéla Bollobás, Oliver Riordan: A note on the Harris-Kesten Theorem. Eur. J. Comb. 28(6): 1720-1723 (2007)
28EEBéla Bollobás, Svante Janson, Oliver Riordan: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1): 3-122 (2007)
27EEBéla Bollobás, Svante Janson, Oliver Riordan: Spread-out percolation in Rd. Random Struct. Algorithms 31(2): 239-246 (2007)
26EENoam 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
25EEBéla Bollobás, Oliver Riordan: Sharp thresholds and percolation in the plane. Random Struct. Algorithms 29(4): 524-548 (2006)
2005
24EEBé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)
23EEBé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
22EEBéla Bollobás, Oliver Riordan: The Phase Transition and Connectedness in Uniformly Grown Random Graphs. WAW 2004: 1-18
21EEBéla Bollobás, Oliver Riordan: The Diameter of a Scale-Free Random Graph. Combinatorica 24(1): 5-34 (2004)
20EEBé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
19EENoam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan: Degree Distribution of the FKP Network Model. ICALP 2003: 725-738
18EEBé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)
15EEBéla Bollobás, Oliver Riordan: Disjointly representing set systems. J. Comb. Theory, Ser. A 102(1): 1-9 (2003)
14EEPaul 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)
12EENoga Alon, Jaroslaw Grytczuk, Mariusz Haluszczak, Oliver Riordan: Nonrepetitive colorings of graphs. Random Struct. Algorithms 21(3-4): 336-346 (2002)
2001
11EEPaul 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)
7EEBéla Bollobás, Oliver Riordan: Polychromatic polynomials. Discrete Mathematics 219(1-3): 1-7 (2000)
6EEBéla Bollobás, Oliver Riordan: Constrained Graph Processes. Electr. J. Comb. 7: (2000)
5EEBéla Bollobás, Luke Pebody, Oliver Riordan: Contraction-Deletion Invariants for Graphs. J. Comb. Theory, Ser. B 80(2): 320-345 (2000)
1999
4EEBé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
3EEBé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)
1EEOliver Riordan: An Ordering on the Even Discrete Torus. SIAM J. Discrete Math. 11(1): 110-127 (1998)

Coauthor Index

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)