| A survey of gossiping and broadcasting in communication networks SM Hedetniemi, ST Hedetniemi, AL Liestman Networks 18 (4), 319-349, 1988 | 1838 | 1988 |
| Roman domination in graphs EJ Cockayne, PA Dreyer Jr, SM Hedetniemi, ST Hedetniemi Discrete mathematics 278 (1-3), 11-22, 2004 | 816 | 2004 |
| Domination in graphs applied to electric power networks TW Haynes, SM Hedetniemi, ST Hedetniemi, MA Henning SIAM journal on discrete mathematics 15 (4), 519-529, 2002 | 478 | 2002 |
| A linear algorithm for the domination number of a tree E Cockaynif, S Goodman, S Hedetniemi Information Processing Letters 4 (2), 41-44, 1975 | 277 | 1975 |
| Edge domination in trees S Mitchell, ST Hedetniemi Proc. of the 8th Southeastern Conference on Combinatorics, Graph Theory and …, 1977 | 269 | 1977 |
| Constant time generation of rooted trees T Beyer, SM Hedetniemi SIAM Journal on Computing 9 (4), 706-712, 1980 | 212 | 1980 |
| Alliances in graphs P Kristiansen, SM Hedetniemi, ST Hedetniemi Journal of Combinatorial Mathematics and Combinatorial Computing 48, 157-178, 2004 | 190 | 2004 |
| Minimum broadcast graphs AM Farley, S Hedetniemi, S Mitchell, A Proskurowski Discrete Math 25, 189-193, 1979 | 181 | 1979 |
| Broadcast chromatic numbers of graphs W Goddard, SM Hedetniemi, ST Hedetniemi, JM Harris, DF Rall Ars Combinatoria 86, 33-50, 2008 | 172 | 2008 |
| Linear algorithms to recognize outerplanar and maximal outerplanar graphs SL Mitchell Information Processing Letters 9 (5), 229-232, 1979 | 167 | 1979 |
| Eternal security in graphs W Goddard, SM Hedetniemi, ST Hedetniemi J. Combin. Math. Combin. Comput 52 (01), 2005 | 166 | 2005 |
| On the algorithmic complexity of total domination R Laskar, J Pfaff, SM Hedetniemi, ST Hedetniemi SIAM Journal on Algebraic Discrete Methods 5 (3), 420-425, 1984 | 153 | 1984 |
| Approximating MAPs for belief networks is NP-hard and other theorems AM Abdelbar, SM Hedetniemi Artificial Intelligence 102 (1), 21-38, 1998 | 144 | 1998 |
| Self-stabilizing algorithms for minimal dominating sets and maximal independent sets SM Hedetniemi, ST Hedetniemi, DP Jacobs, PK Srimani Computers & Mathematics with Applications 46 (5-6), 805-811, 2003 | 125 | 2003 |
| Linear algorithms for finding the Jordan center and path center of a tree SM Hedetniemi, EJ Cockayne, ST Hedetniemi Transportation Science 15 (2), 98-114, 1981 | 124 | 1981 |
| Broadcasts in graphs JE Dunbar, DJ Erwin, TW Haynes, SM Hedetniemi, ST Hedetniemi Discrete Applied Mathematics 154 (1), 59-75, 2006 | 120 | 2006 |
| Offensive alliances in graphs O Favaron, G Fricke, W Goddard, SM Hedetniemi, ST Hedetniemi, ... International Symposium on Computer and Information Sciences, 298-302, 2022 | 113 | 2022 |
| Alliances in graphs SM Hedetniemi, ST Hedetniemi, P Kristiansen J. Combin. Math. Combin. Comput 48, 157-177, 2004 | 105 | 2004 |
| Sufficient conditions for a graph to be hamiltonian S Goodman, S Hedetniemi Journal of Combinatorial Theory, Series B 16 (2), 175-180, 1974 | 103 | 1974 |
| A linear algorithm for the Grundy (coloring) number of a tree SM Hedetniemi, ST Hedetniemi, T Beyer Congr. Numer 36, 351-363, 1982 | 86 | 1982 |
Stephen T. HedetniemiProfessor Emeritus, School of Computing, Clemson UniversityEmail confirmado em clemson.edu