Fall colorings of graphs JE Dunbar, SM Hedetniemi, ST Hedetniemi, DP Jacobs, J Knisely, ... Journal of Combinatorial Mathematics and Combinatorial Computing 33, 257-274, 2000 | 56 | 2000 |
Domination subdivision numbers T Haynes, S Hedetniemi, S Hedetniemi, D Jacobs, J Knisely, ... Discussiones mathematicae graph theory 21 (2), 239-253, 2001 | 43 | 2001 |
Secondary domination in graphs SM Hedetniemi, ST Hedetniemi, J Knisely, DF Rall, TW Haynes AKCE International Journal of Graphs and Combinatorics 5 (2), 103-115, 2008 | 37 | 2008 |
A tridiagonal system solver for distributed memory parallel processors with vector nodes CL Cox, JA Knisely Journal of Parallel and Distributed Computing 13 (3), 325-331, 1991 | 19 | 1991 |
The study of cyclic gossiping in graphs JA Knisely | 2 | 1993 |
Broadcasting and gossiping in communication networks R Laskar, JA Knisely Applied Mathematical Modeling, 1999 | 1 | 1999 |
Minimal cyclic broadcast graphs J Knisely, R Laskar Congressus Numerantium, 210-214, 1994 | 1 | 1994 |
Cyclic gossiping times for some classes of graphs JA Knisely, R Laskar Networks: An International Journal 28 (3), 135-141, 1996 | | 1996 |
Implementation of a nonsymmetric cyclic reduction algorithm on a hypercube architecture with vector processors JA Knisely | | 1989 |
Domination Criticality J Knisely | | |