# David A. Grable

According to our database

Collaborative distances:

^{1}, David A. Grable authored at least 18 papers between 1991 and 2000.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2000

Fast Distributed Algorithms for Brooks-Vizing Colorings.

J. Algorithms, 2000

1999

Forbidden induced partial orders.

Discrete Mathematics, 1999

More-Than-Nearly-Perfect Packings and Partial Designs.

Combinatorica, 1999

1998

Near-Optimal, Distributed Edge Colouring via the Nibble Method.

Theor. Comput. Sci., 1998

A Large Deviation Inequality for Functions of Independent, Multi-Way Choices.

Combinatorics, Probability & Computing, 1998

Fast Distributed Algorithms for {Brooks-Vizing} Colourings.

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Nearly optimal distributed edge coloring in O(log log n) rounds.

Random Struct. Algorithms, 1997

On Random Greedy Triangle Packing.

Electr. J. Comb., 1997

Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds.

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Set intersection representations for almost all graphs.

Journal of Graph Theory, 1996

Nearly-Perfect Hypergraph Packing is in NC.

Inf. Process. Lett., 1996

1995

The Diameter of a Random Graph with Bounded Diameter.

Random Struct. Algorithms, 1995

The genus of a random graph.

Discrete Mathematics, 1995

The Minimum Independence Number for Designs.

Combinatorica, 1995

1994

Almost All Linear Spaces and Partial t-Designs Have Trivial Automorphism Groups.

J. Comb. Theory, Ser. A, 1994

Hypergraphs and sharpened sieve inequalities.

Discrete Mathematics, 1994

1993

Sharpened Bonferroni Inequalities.

J. Comb. Theory, Ser. B, 1993

1991

Two Packing Problems on k-Matroid Trees.

Eur. J. Comb., 1991