| |
| 2008 | ||
|---|---|---|
| 7 | EE | Bennett Thompson, David J. Pearce, Craig Anslow, Gary Haggard: Visualizing the computation tree of the Tutte Polynomial. SOFTVIS 2008: 211-212 |
| 2005 | ||
| 6 | Stephen Guattery, Gary Haggard, Ronald C. Read: Chromatic Equivalence of Generalized Ladder Graphs. Ars Comb. 75: (2005) | |
| 2001 | ||
| 5 | Gary Haggard, Thomas R. Mathies: Using Thresholds to Compute Chromatic Polynomials. Ars Comb. 58: (2001) | |
| 1999 | ||
| 4 | EE | Gary Haggard, Thomas R. Mathies: The computation of chromatic polynomials. Discrete Mathematics 199(1-3): 227-231 (1999) |
| 1991 | ||
| 3 | EE | Gary Haggard: A project for data structures and algorithms. SIGCSE 1991: 140-145 |
| 1988 | ||
| 2 | EE | David Finkel, Gary Haggard: Program complexity: a tutorial. SIGCSE 1988: 73-77 |
| 1986 | ||
| 1 | EE | Gary Haggard, Kevin Karplus: Finding minimal perfect hash functions. SIGCSE 1986: 191-193 |
| 1 | Craig Anslow | [7] |
| 2 | David Finkel | [2] |
| 3 | Stephen Guattery | [6] |
| 4 | Kevin Karplus | [1] |
| 5 | Thomas R. Mathies | [4] [5] |
| 6 | David J. Pearce | [7] |
| 7 | Ronald C. Read | [6] |
| 8 | Bennett Thompson | [7] |