Gary Haggard

According to our database, Gary Haggard authored at least 14 papers between 1973 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Computing Tutte Polynomials.

Gary Haggard, David J. Pearce, Gordon F. Royle

ACM Trans. Math. Softw., 2010

Edge-Selection Heuristics for Computing Tutte Polynomials.

David J. Pearce, Gary Haggard, Gordon F. Royle

Chic. J. Theor. Comput. Sci., 2010

Graph works - pilot graph theory visualization tool.

Dan Medani, Gary Haggard, Chris Bassett, Peter Koch, Nikolas Lampert, Tim Medlock, Steven Pierce, Ryan Smith, Andrew Yehl

Proceedings of the ACM 2010 Symposium on Software Visualization, 2010

2008

Visualizing the computation tree of the Tutte Polynomial.

Bennett Thompson, David J. Pearce, Craig Anslow, Gary Haggard

Proceedings of the ACM 2008 Symposium on Software Visualization, 2008

2007

Improving Mutual Understanding of Development Artifacts: A Semiotics-Based Approach.

Jennifer Ferreira, Robert E. Crossler, Gary Haggard

Proceedings of the Reaching New Heights. 13th Americas Conference on Information Systems, 2007

2006

Discrete mathematics for computer science.

Gary Haggard, John S. Schlipf, Sue Whitesides

Thomson Brooks/Cole, ISBN: 978-0-534-49501-5, 2006

2005

Chromatic Equivalence of Generalized Ladder Graphs.

Stephen Guattery, Gary Haggard, Ronald C. Read

Ars Comb., 2005

2001

Using Thresholds to Compute Chromatic Polynomials.

Gary Haggard, Thomas R. Mathies

Ars Comb., 2001

1999

The computation of chromatic polynomials.

Gary Haggard, Thomas R. Mathies

Discret. Math., 1999

1991

A project for data structures and algorithms.

Gary Haggard

Proceedings of the 22nd SIGCSE Technical Symposium on Computer Science Education, 1991

1988

Program complexity: a tutorial.

David Finkel, Gary Haggard

Proceedings of the 19th SIGCSE Technical Symposium on Computer Science Education, 1988

1986

Finding minimal perfect hash functions.

Gary Haggard, Kevin Karplus

Proceedings of the 17th SIGCSE Technical Symposium on Computer Science Education, 1986

1976

Extremal edge problems for graphs with given hyperoctahedral automorphism group.

Gary Haggard, Donald McCarthy, Andrew Wohlgemuth

Discret. Math., 1976

1973

The least number of edges for graphs having dihedral automorphism group.

Gary Haggard

Discret. Math., 1973