 | 2010 |
| 12 |  | Dan Medani,
Gary Haggard,
Chris Bassett,
Peter Koch,
Nikolas Lampert,
Tim Medlock,
Steven Pierce,
Ryan Smith,
Andrew Yehl:
Graph works - pilot graph theory visualization tool.
SOFTVIS 2010: 205-206 |
| 11 |  | Gary Haggard,
David J. Pearce,
Gordon Royle:
Computing Tutte Polynomials.
ACM Trans. Math. Softw. 37(3): (2010) |
| 10 |  | David J. Pearce,
Gary Haggard,
Gordon Royle:
Edge-Selection Heuristics for Computing Tutte Polynomials.
Chicago J. Theor. Comput. Sci. 2010: (2010) |
| 2008 |
| 9 |  | Bennett Thompson,
David J. Pearce,
Craig Anslow,
Gary Haggard:
Visualizing the computation tree of the Tutte Polynomial.
SOFTVIS 2008: 211-212 |
| 2007 |
| 8 |  | Jenniifer Ferreira,
Robert Crossler,
Gary Haggard:
Improving Mutual Understanding of Development Artifacts: A Semiotics-Based Approach.
AMCIS 2007: 459 |
| 2006 |
| 7 |  | Gary Haggard,
John S. Schlipf,
Sue Whitesides:
Discrete mathematics for computer science.
Thomson Brooks/Cole 2006: I-XXXIII, 1-600 |
| 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 |  | Gary Haggard,
Thomas R. Mathies:
The computation of chromatic polynomials.
Discrete Mathematics 199(1-3): 227-231 (1999) |
| 1991 |
| 3 |  | Gary Haggard:
A project for data structures and algorithms.
SIGCSE 1991: 140-145 |
| 1988 |
| 2 |  | David Finkel,
Gary Haggard:
Program complexity: a tutorial.
SIGCSE 1988: 73-77 |
| 1986 |
| 1 |  | Gary Haggard,
Kevin Karplus:
Finding minimal perfect hash functions.
SIGCSE 1986: 191-193 |