Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. - Paul Balister; Béla Bollobás; Alan Stacey (Random Struct. Algorithms, 1994)

Universal minimal total dominating functions of trees. - Alan Stacey (Discret. Math., 1995)

Searches On A Binary Tree With Random Edge-Weights. - Alan Stacey (Comb. Probab. Comput., 1999)

The Existence of Exactlym-Coloured Complete Subgraphs. - Alan Stacey; Peter Weidl (J. Comb. Theory B, 1999)

Counting Boundary Paths for Oriented Percolation Clusters. - Paul Balister; Béla Bollobás; Alan Stacey (Random Struct. Algorithms, 1999)

Branching Random Walks On Quasi-Transitive Graphs. - Alan Stacey (Comb. Probab. Comput., 2003)