The least number of edges for graphs having dihedral automorphism group. - Gary Haggard (Discret. Math., 1973)

Extremal edge problems for graphs with given hyperoctahedral automorphism group. - Gary Haggard; Donald McCarthy; Andrew Wohlgemuth (Discret. Math., 1976)

Finding minimal perfect hash functions. - Gary Haggard; Kevin Karplus (SIGCSE, 1986)

Program complexity: a tutorial. - David Finkel; Gary Haggard (SIGCSE, 1988)

A project for data structures and algorithms. - Gary Haggard (SIGCSE, 1991)

The computation of chromatic polynomials. - Gary Haggard; Thomas R. Mathies (Discret. Math., 1999)

Using Thresholds to Compute Chromatic Polynomials. - Gary Haggard; Thomas R. Mathies (Ars Comb., 2001)

Chromatic Equivalence of Generalized Ladder Graphs. - Stephen Guattery; Gary Haggard; Ronald C. Read (Ars Comb., 2005)

Discrete mathematics for computer science. - Gary Haggard; John S. Schlipf; Sue Whitesides (Thomson Brooks/Cole, 2006)

Improving Mutual Understanding of Development Artifacts: A Semiotics-Based Approach. - Jennifer Ferreira; Robert E. Crossler; Gary Haggard (AMCIS, 2007)

Visualizing the computation tree of the Tutte Polynomial. - Bennett Thompson; David J. Pearce 001; Craig Anslow; Gary Haggard (SOFTVIS, 2008)

Graph works - pilot graph theory visualization tool. - Dan Medani; Gary Haggard; Chris Bassett; Peter Koch 002; Nikolas Lampert; Tim Medlock; Steven Pierce; Ryan Smith; Andrew Yehl (SOFTVIS, 2010)

Edge-Selection Heuristics for Computing Tutte Polynomials. - David J. Pearce 001; Gary Haggard; Gordon F. Royle (Chic. J. Theor. Comput. Sci., 2010)

Computing Tutte Polynomials. - Gary Haggard; David J. Pearce 001; Gordon F. Royle (ACM Trans. Math. Softw., 2010)