Two Packing Problems on k-Matroid Trees. - David A. Grable (Eur. J. Comb., 1991)

Sharpened Bonferroni Inequalities. - David A. Grable (J. Comb. Theory B, 1993)

Hypergraphs and sharpened sieve inequalities. - David A. Grable (Discret. Math., 1994)

Almost All Linear Spaces and Partial t-Designs Have Trivial Automorphism Groups. - David A. Grable (J. Comb. Theory A, 1994)

The Minimum Independence Number for Designs. - David A. Grable; Kevin T. Phelps; Vojtech Rödl (Comb., 1995)

The genus of a random graph. - Dan Archdeacon; David A. Grable (Discret. Math., 1995)

The Diameter of a Random Graph with Bounded Diameter. - David A. Grable (Random Struct. Algorithms, 1995)

Nearly-Perfect Hypergraph Packing is in NC. - David A. Grable (Inf. Process. Lett., 1996)

Set intersection representations for almost all graphs. - Nancy Eaton; David A. Grable (J. Graph Theory, 1996)

Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds. - David A. Grable; Alessandro Panconesi (SODA, 1997)

On Random Greedy Triangle Packing. - David A. Grable (Electron. J. Comb., 1997)

Nearly optimal distributed edge coloring in O(log log n) rounds. - David A. Grable; Alessandro Panconesi (Random Struct. Algorithms, 1997)

Fast Distributed Algorithms for {Brooks-Vizing} Colourings. - David A. Grable; Alessandro Panconesi (SODA, 1998)

A Large Deviation Inequality for Functions of Independent, Multi-Way Choices. - David A. Grable (Comb. Probab. Comput., 1998)

Near-Optimal, Distributed Edge Colouring via the Nibble Method. - Devdatt P. Dubhashi; David A. Grable; Alessandro Panconesi (Theor. Comput. Sci., 1998)

More-Than-Nearly-Perfect Packings and Partial Designs. - David A. Grable (Comb., 1999)

Forbidden induced partial orders. - Graham R. Brightwell; David A. Grable; Hans Jürgen Prömel (Discret. Math., 1999)

Fast Distributed Algorithms for Brooks-Vizing Colorings. - David A. Grable; Alessandro Panconesi (J. Algorithms, 2000)