default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGary Haggard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j7]David J. Pearce, Gary Haggard, Gordon F. Royle:
Edge-Selection Heuristics for Computing Tutte Polynomials. Chic. J. Theor. Comput. Sci. 2010 (2010)- [j6]Gary Haggard, David J. Pearce, Gordon F. Royle
:
Computing Tutte Polynomials. ACM Trans. Math. Softw. 37(3): 24:1-24:17 (2010) - [c7]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
2000 – 2009
- 2009
- [c6]David J. Pearce, Gary Haggard, Gordon F. Royle:
Edge-Selection Heuristics for Computing Tutte Polynomials. CATS 2009: 151-159 - 2008
- [c5]Bennett Thompson, David J. Pearce, Craig Anslow, Gary Haggard:
Visualizing the computation tree of the Tutte Polynomial. SOFTVIS 2008: 211-212 - 2007
- [c4]Jennifer Ferreira, Robert E. Crossler, Gary Haggard:
Improving Mutual Understanding of Development Artifacts: A Semiotics-Based Approach. AMCIS 2007: 459 - 2006
- [b1]Gary Haggard, John S. Schlipf, Sue Whitesides:
Discrete mathematics for computer science. Thomson Brooks/Cole 2006, ISBN 978-0-534-49501-5, pp. I-XXXIII, 1-600 - 2005
- [j5]Stephen Guattery, Gary Haggard, Ronald C. Read:
Chromatic Equivalence of Generalized Ladder Graphs. Ars Comb. 75 (2005) - 2001
- [j4]Gary Haggard, Thomas R. Mathies:
Using Thresholds to Compute Chromatic Polynomials. Ars Comb. 58 (2001)
1990 – 1999
- 1999
- [j3]Gary Haggard, Thomas R. Mathies:
The computation of chromatic polynomials. Discret. Math. 199(1-3): 227-231 (1999) - 1991
- [c3]Gary Haggard:
A project for data structures and algorithms. SIGCSE 1991: 140-145
1980 – 1989
- 1988
- [c2]David Finkel, Gary Haggard:
Program complexity: a tutorial. SIGCSE 1988: 73-77 - 1986
- [c1]Gary Haggard, Kevin Karplus:
Finding minimal perfect hash functions. SIGCSE 1986: 191-193
1970 – 1979
- 1976
- [j2]Gary Haggard, Donald McCarthy, Andrew Wohlgemuth:
Extremal edge problems for graphs with given hyperoctahedral automorphism group. Discret. Math. 14(2): 139-156 (1976) - 1973
- [j1]Gary Haggard:
The least number of edges for graphs having dihedral automorphism group. Discret. Math. 6(1): 53-78 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
