- Oliver Riordan:
Spanning Subgraphs Of Random Graphs. Comb. Probab. Comput. 9(2): 125-148 (2000) - Oliver Riordan, Alex Selby:
The Maximum Degree Of A Random Graph. Comb. Probab. Comput. 9(6): 549-572 (2000) - Hanna D. Robalewska, Nicholas C. Wormald:
Random Star Processes. Comb. Probab. Comput. 9(1): 33-43 (2000) - Yoav Seginer:
The Expected Norm Of Random Matrices. Comb. Probab. Comput. 9(2): 149-166 (2000) - C. R. Subramanian:
Algorithms For Colouring Random K-Colourable Graphs. Comb. Probab. Comput. 9(1): 45-77 (2000) - Robin Thomas, Jan Mcdonald Thomson:
Excluding Minors In Nonplanar Graphs Of Girth At Least Five. Comb. Probab. Comput. 9(6): 573-585 (2000) - Jean-Pierre Tillich, Gilles Zémor:
Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error. Comb. Probab. Comput. 9(5): 465-479 (2000) - Jacques Verstraëte:
On Arithmetic Progressions Of Cycle Lengths In Graphs. Comb. Probab. Comput. 9(4): 369-373 (2000) - Margit Voigt:
Algorithmic Aspects Of Partial List Colourings. Comb. Probab. Comput. 9(4): 375-380 (2000) - Van H. Vu:
On The Choice Number Of Random Hypergraphs. Comb. Probab. Comput. 9(1): 79-95 (2000) - David G. Wagner:
Zeros Of Reliability Polynomials And F-Vectors Of Matroids. Comb. Probab. Comput. 9(2): 167-190 (2000)