An efficiently solvable case of the minimum weight equivalent subgraph problem. - Michael B. Richey; R. Gary Parker; Ronald L. Rardin (Networks, 1985)

On multiple steiner subgraph problems. - Michael B. Richey; R. Gary Parker (Networks, 1986)

Discrete optimization. - R. Gary Parker; Ronald L. Rardin (Academic Press, 1988)

Algorithms for recognition of regular properties and decomposition of recursive graph families. - Richard B. Borie; R. Gary Parker; Craig A. Tovey (Ann. Oper. Res., 1991)

Deterministic Decomposition of Recursive Graph Classes. - Richard B. Borie; R. Gary Parker; Craig A. Tovey (SIAM J. Discret. Math., 1991)

Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families. - Richard B. Borie; R. Gary Parker; Craig A. Tovey (Algorithmica, 1992)

on Halin Subgraphs and Supergraphs. - Steven B. Horton; R. Gary Parker (Discret. Appl. Math., 1995)

On minimum cuts and the linear arrangement problem. - Steven B. Horton; R. Gary Parker; Richard B. Borie (Discret. Appl. Math., 2000)

On completing latin squares. - Todd Easton; R. Gary Parker (Discret. Appl. Math., 2001)

Graph Representation. - Alfred V. Aho; Mark Goldberg; Josef Lauri; Richard B. Borie; R. Gary Parker; Craig A. Tovey (Handbook of Graph Theory, 2003)

Connectivity and Traversability. - Josep Fàbrega; Miguel Angel Fiol; Herbert Fleischner; R. Gary Parker; A Dewdney; Ronald J. Gould; Gregory Z. Gutin (Handbook of Graph Theory, 2003)

Graphs in Computer Science. - Harold N. Gabow; Camil Demetrescu; Irene Finocchi; Giuseppe Francesco Italiano; Giuseppe Liotta; Roberto Tamassia; Richard B. Borie; R. Gary Parker; Craig A. Tovey (Handbook of Graph Theory, 2003)

The linear arrangement problem on recursively constructed graphs. - Steven B. Horton; Todd Easton; R. Gary Parker (Networks, 2003)

Solving problems on recursively constructed graphs. - Richard B. Borie; R. Gary Parker; Craig A. Tovey (ACM Comput. Surv., 2008)