Search the dblp DataBase
Grant A. Cheston :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
David F. Shanno , Allen Berg , Grant A. Cheston Restarts and Rotations of Quasi-Newton Methods. [Citation Graph (0, 0)][DBLP ] IFIP Congress, 1974, pp:557-561 [Conf ] Grant A. Cheston , Gerd Fricke Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:55, n:3, pp:241-258 [Journal ] Grant A. Cheston , Stephen T. Hedetniemi , Arthur L. Liestman , J. B. Stehman The even adjacency split problem for graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:102, n:3, pp:175-188 [Journal ] Grant A. Cheston A Correction to a Unilaterally Connected Components Algorithm. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1978, v:7, n:2, pp:125-0 [Journal ] Grant A. Cheston , Arthur M. Farley , Stephen T. Hedetniemi , Andrzej Proskurowski Centering a Spanning Tree of a Biconnected Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:5, pp:247-250 [Journal ] K. S. Easwarakumar , C. Pandu Rangan , Grant A. Cheston A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:3, pp:121-124 [Journal ] Grant A. Cheston , J. Paul Tremblay Integrating Software Engineering in Introductory Computing Courses. [Citation Graph (0, 0)][DBLP ] IEEE Software, 2002, v:19, n:5, pp:64-71 [Journal ] On the computational complexity of upper fractional domination. [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs