default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Gary Parker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j10]Richard B. Borie, R. Gary Parker, Craig A. Tovey
:
Solving problems on recursively constructed graphs. ACM Comput. Surv. 41(1): 4:1-4:51 (2008)- 2003
- [j9]Steven B. Horton, Todd Easton, R. Gary Parker:
The linear arrangement problem on recursively constructed graphs. Networks 42(3): 165-168 (2003) - [p3]Alfred V. Aho, Mark Goldberg, Josef Lauri, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graph Representation. Handbook of Graph Theory 2003: 56-125 - [p2]Josep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin:
Connectivity and Traversability. Handbook of Graph Theory 2003: 193-339 - [p1]Harold N. Gabow, Camil Demetrescu, Irene Finocchi, Giuseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graphs in Computer Science. Handbook of Graph Theory 2003: 952-1073 - 2001
- [j8]Todd Easton, R. Gary Parker:
On completing latin squares. Discret. Appl. Math. 113(2-3): 167-181 (2001) - 2000
- [j7]Steven B. Horton, R. Gary Parker, Richard B. Borie:
On minimum cuts and the linear arrangement problem. Discret. Appl. Math. 103(1-3): 127-139 (2000)
1990 – 1999
- 1995
- [j6]Steven B. Horton, R. Gary Parker:
on Halin Subgraphs and Supergraphs. Discret. Appl. Math. 56(1): 19-35 (1995) - 1992
- [j5]Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families. Algorithmica 7(5&6): 555-581 (1992) - 1991
- [j4]Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Algorithms for recognition of regular properties and decomposition of recursive graph families. Ann. Oper. Res. 33(3): 125-149 (1991) - [j3]Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Deterministic Decomposition of Recursive Graph Classes. SIAM J. Discret. Math. 4(4): 481-501 (1991)
1980 – 1989
- 1988
- [b1]R. Gary Parker, Ronald L. Rardin:
Discrete optimization. Computer science and scientific computing, Academic Press 1988, ISBN 978-0-12-545075-1, pp. I-XI, 1-472 - 1986
- [j2]Michael B. Richey, R. Gary Parker:
On multiple steiner subgraph problems. Networks 16(4): 423-438 (1986) - 1985
- [j1]Michael B. Richey, R. Gary Parker, Ronald L. Rardin:
An efficiently solvable case of the minimum weight equivalent subgraph problem. Networks 15(2): 217-228 (1985)
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:06 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:
