The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Oliver Riordan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. The k-Core and Branching Processes. [Citation Graph (, )][DBLP]


  26. Line-of-Sight Percolation. [Citation Graph (, )][DBLP]


  27. A note on the Harris-Kesten Theorem. [Citation Graph (, )][DBLP]


Search in 0.065secs, Finished in 0.066secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002