David A. Grable

18 papers A* 2Journal 16
YearRankTypeTitle / Venue / Authors
2000 J jnl
Fast Distributed Algorithms for Brooks-Vizing Colorings.
J. Algorithms
David A. Grable, Alessandro Panconesi
1999 J jnl
Forbidden induced partial orders.
Discret. Math.
Graham R. Brightwell, David A. Grable, Hans Jürgen Prömel
1999 J jnl
More-Than-Nearly-Perfect Packings and Partial Designs.
Comb.
David A. Grable
1998 J jnl
A Large Deviation Inequality for Functions of Independent, Multi-Way Choices.
Comb. Probab. Comput.
David A. Grable
1998 A* conf
Fast Distributed Algorithms for {Brooks-Vizing} Colourings.
SODA
David A. Grable, Alessandro Panconesi
1998 J jnl
Near-Optimal, Distributed Edge Colouring via the Nibble Method.
Theor. Comput. Sci.
Devdatt P. Dubhashi, David A. Grable, Alessandro Panconesi
1997 A* conf
Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds.
SODA
David A. Grable, Alessandro Panconesi
1997 J jnl
Nearly optimal distributed edge coloring in O(log log n) rounds.
Random Struct. Algorithms
David A. Grable, Alessandro Panconesi
1997 J jnl
On Random Greedy Triangle Packing.
Electron. J. Comb.
David A. Grable
1996 J jnl
Nearly-Perfect Hypergraph Packing is in NC.
Inf. Process. Lett.
David A. Grable
1996 J jnl
Set intersection representations for almost all graphs.
J. Graph Theory
Nancy Eaton, David A. Grable
1995 J jnl
The Diameter of a Random Graph with Bounded Diameter.
Random Struct. Algorithms
David A. Grable
1995 J jnl
The Minimum Independence Number for Designs.
Comb.
David A. Grable, Kevin T. Phelps, Vojtech Rödl
1995 J jnl
The genus of a random graph.
Discret. Math.
Dan Archdeacon, David A. Grable
1994 J jnl
Almost All Linear Spaces and Partial t-Designs Have Trivial Automorphism Groups.
J. Comb. Theory A
David A. Grable
1994 J jnl
Hypergraphs and sharpened sieve inequalities.
Discret. Math.
David A. Grable
1993 J jnl
Sharpened Bonferroni Inequalities.
J. Comb. Theory B
David A. Grable
1991 J jnl
Two Packing Problems on k-Matroid Trees.
Eur. J. Comb.
David A. Grable