 | 2006 |
|---|
| 9 |       | Grant A. Cheston,
Tjoen Seng Jap:
A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs.
J. Graph Algorithms Appl. 10(2): 159-190 (2006) |
| 2002 |
|---|
| 8 | | Grant A. Cheston,
J. Paul Tremblay:
Integrating Software Engineering in Introductory Computing Courses.
IEEE Software 19(5): 64-71 (2002) |
| 2000 |
|---|
| 7 |  | Grant A. Cheston,
Stephen T. Hedetniemi,
Arthur L. Liestman,
J. B. Stehman:
The even adjacency split problem for graphs.
Discrete Applied Mathematics 102(3): 175-188 (2000) |
| 1994 |
|---|
| 6 | | Grant A. Cheston,
Gerd Fricke:
Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance.
Discrete Applied Mathematics 55(3): 241-258 (1994) |
| 5 | | K. S. Easwarakumar,
C. Pandu Rangan,
Grant A. Cheston:
A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph.
Inf. Process. Lett. 51(3): 121-124 (1994) |
| 1990 |
|---|
| 4 | | Grant A. Cheston,
Gerd Fricke,
Stephen T. Hedetniemi,
David Pokrass Jacobs:
On the computational complexity of upper fractional domination.
Discrete Applied Mathematics 27(3): 195-207 (1990) |
| 1989 |
|---|
| 3 | | Grant A. Cheston,
Arthur M. Farley,
Stephen T. Hedetniemi,
Andrzej Proskurowski:
Centering a Spanning Tree of a Biconnected Graph.
Inf. Process. Lett. 32(5): 247-250 (1989) |
| 1978 |
|---|
| 2 | | Grant A. Cheston:
A Correction to a Unilaterally Connected Components Algorithm.
Inf. Process. Lett. 7(2): 125- (1978) |
| 1974 |
|---|
| 1 | | David F. Shanno,
Allen Berg,
Grant A. Cheston:
Restarts and Rotations of Quasi-Newton Methods.
IFIP Congress 1974: 557-561 |
