 | 2008 |
|---|
| 8 |       | Richard B. Borie,
R. Gary Parker,
Craig A. Tovey:
Solving problems on recursively constructed graphs.
ACM Comput. Surv. 41(1): (2008) |
| 2003 |
|---|
| 7 | | Steven B. Horton,
T. Easton,
R. Gary Parker:
The linear arrangement problem on recursively constructed graphs.
Networks 42(3): 165-168 (2003) |
| 2001 |
|---|
| 6 | | T. Easton,
R. Gary Parker:
On completing latin squares.
Discrete Applied Mathematics 113(2-3): 167-181 (2001) |
| 2000 |
|---|
| 5 | | Steven B. Horton,
R. Gary Parker,
Richard B. Borie:
On minimum cuts and the linear arrangement problem.
Discrete Applied Mathematics 103(1-3): 127-139 (2000) |
| 1995 |
|---|
| 4 | | Steven B. Horton,
R. Gary Parker:
on Halin Subgraphs and Supergraphs.
Discrete Applied Mathematics 56(1): 19-35 (1995) |
| 1992 |
|---|
| 3 | | 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 |
|---|
| 2 | | Richard B. Borie,
R. Gary Parker,
Craig A. Tovey:
Deterministic Decomposition of Recursive Graph Classes.
SIAM J. Discrete Math. 4(4): 481-501 (1991) |
| 1988 |
|---|
| 1 |  | R. Gary Parker,
Ronald L. Rardin:
Discrete optimization.
Academic Press 1988: I-XI, 1-472 |
Data released under the ODC-BY 1.0 license — See also our legal information page