Sparse color-critical hypergraphs. - H. L. Abbott; Donovan R. Hare (Comb., 1989)

Edge-pancyclic block-intersection graphs. - Brian Alspach; Donovan R. Hare (Discret. Math., 1991)

The Connectivity of the Block-Intersection Graphs of Designs. - Donovan R. Hare; William McCuaig (Des. Codes Cryptogr., 1993)

Sparsity Analysis of the $QR$ Factorization. - Donovan R. Hare; Charles R. Johnson; D. Dale Olesky; Pauline van den Driessche (SIAM J. Matrix Anal. Appl., 1993)

Sparse color-critical graphs and hypergraphs with no short cycles. - H. L. Abbott; Bing Zhou 004; Donovan R. Hare (J. Graph Theory, 1994)

Large Faces in 4-Critical Planar Graphs with Minimum Degree 4. - H. L. Abbott; Donovan R. Hare; Bing Zhou 004 (Comb., 1995)

Cycles in the block-intersection graph of pairwise balanced designs. - Donovan R. Hare (Discret. Math., 1995)

Vertex transversals that dominate. - Noga Alon; Michael R. Fellows; Donovan R. Hare (J. Graph Theory, 1996)

Arithmetic Progressions in Sequences with Bounded Gaps. - Tom C. Brown; Donovan R. Hare (J. Comb. Theory A, 1997)

Color-critical graphs and hypergraphs with few edges and no short cycles. - H. L. Abbott; Donovan R. Hare; Bing Zhou 004 (Discret. Math., 1998)

Square critically 3-chromatic hypergraphs. - H. L. Abbott; Donovan R. Hare (Discret. Math., 1999)

Families of 4-Sets Without Property B. - H. L. Abbott; Donovan R. Hare (Ars Comb., 2001)

The set of values of b for which there exist block designs with b blocks. - H. L. Abbott; Donovan R. Hare (Discret. Math., 2005)

The parametric complexity of graph diameter augmentation. - Yong Gao 001; Donovan R. Hare; James Nastos (Discret. Appl. Math., 2013)

The cluster deletion problem for cographs. - Yong Gao 001; Donovan R. Hare; James Nastos (Discret. Math., 2013)

Tools for counting odd cycles in graphs. - Donovan R. Hare (J. Comb. Theory B, 2019)