Gary Haggard

15 papers A 3Journal 7Unranked 4
YearRankTypeTitle / Venue / Authors
2010 J jnl
Computing Tutte Polynomials.
ACM Trans. Math. Softw.
Gary Haggard, David J. Pearce, Gordon F. Royle
2010 J jnl
Edge-Selection Heuristics for Computing Tutte Polynomials.
Chic. J. Theor. Comput. Sci.
David J. Pearce, Gary Haggard, Gordon F. Royle
2010 — conf
Graph works - pilot graph theory visualization tool.
SOFTVIS
Dan Medani, Gary Haggard, Chris Bassett, Peter Koch, Nikolas Lampert, Tim Medlock, Steven Pierce, Ryan Smith, Andrew Yehl
2009 — conf
Edge-Selection Heuristics for Computing Tutte Polynomials.
CATS
David J. Pearce, Gary Haggard, Gordon F. Royle
2008 — conf
Visualizing the computation tree of the Tutte Polynomial.
SOFTVIS
Bennett Thompson, David J. Pearce, Craig Anslow, Gary Haggard
2007 — conf
Improving Mutual Understanding of Development Artifacts: A Semiotics-Based Approach.
AMCIS
Jennifer Ferreira, Robert E. Crossler, Gary Haggard
2006 — book
Discrete mathematics for computer science.
Gary Haggard, John S. Schlipf, Sue Whitesides
2005 J jnl
Chromatic Equivalence of Generalized Ladder Graphs.
Ars Comb.
Stephen Guattery, Gary Haggard, Ronald C. Read
2001 J jnl
Using Thresholds to Compute Chromatic Polynomials.
Ars Comb.
Gary Haggard, Thomas R. Mathies
1999 J jnl
The computation of chromatic polynomials.
Discret. Math.
Gary Haggard, Thomas R. Mathies
1991 A conf
A project for data structures and algorithms.
SIGCSE
Gary Haggard
1988 A conf
Program complexity: a tutorial.
SIGCSE
David Finkel, Gary Haggard
1986 A conf
Finding minimal perfect hash functions.
SIGCSE
Gary Haggard, Kevin Karplus
1976 J jnl
Extremal edge problems for graphs with given hyperoctahedral automorphism group.
Discret. Math.
Gary Haggard, Donald McCarthy, Andrew Wohlgemuth
1973 J jnl
The least number of edges for graphs having dihedral automorphism group.
Discret. Math.
Gary Haggard