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 | 86 | 2003 |

Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks W Goddard, ST Hedetniemi, DP Jacobs, PK Srimani Proceedings International Parallel and Distributed Processing Symposium, 14 pp., 2003 | 68 | 2003 |

Linear time self-stabilizing colorings ST Hedetniemi, DP Jacobs, PK Srimani Information Processing Letters 87 (5), 251-255, 2003 | 66 | 2003 |

Maximal matching stabilizes in time O(m) ST Hedetniemi, DP Jacobs, PK Srimani Information Processing Letters 80 (5), 221-223, 2001 | 66 | 2001 |

Eigenvalues and energy in threshold graphs DP Jacobs, V Trevisan, F Tura Linear Algebra and its Applications 465, 412-425, 2015 | 44 | 2015 |

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 | 42 | 2000 |

Locating the eigenvalues of trees DP Jacobs, V Trevisan Linear Algebra and its Applications 434 (1), 81-88, 2011 | 41 | 2011 |

The private neighbor cube M Fellows, G Fricke, S Hedetniemi, D Jacobs SIAM Journal on Discrete Mathematics 7 (1), 41-47, 1994 | 40 | 1994 |

Eigenvalue location in threshold graphs DP Jacobs, V Trevisan, F Tura Linear Algebra and its applications 439 (10), 2762-2773, 2013 | 38 | 2013 |

Domination subdivision numbers TW Haynes, SM Hedetniemi, ST Hedetniemi, DP Jacobs, J Knisely, ... Discussiones Mathematicae Graph Theory 21 (2), 239-254, 2001 | 34 | 2001 |

A simple heuristic for maximizing service of carousel storage DP Jacobs, JC Peck, JS Davis Computers & Operations Research 27 (13), 1351-1356, 2000 | 34 | 2000 |

On the computational complexity of upper fractional domination GA Cheston, G Fricke, ST Hedetniemi, DP Jacobs Discrete Applied Mathematics 27 (3), 195-207, 1990 | 34 | 1990 |

Distance-k knowledge in self-stabilizing algorithms W Goddard, ST Hedetniemi, DP Jacobs, V Trevisan Theoretical Computer Science 399 (1), 118-127, 2008 | 33 | 2008 |

A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph W Goddard, ST Hedetniemi, DP Jacobs, PK Srimani Proceedings International Parallel and Distributed Processing Symposium, 4 pp., 2003 | 33 | 2003 |

Reducing the adjacency matrix of a tree G Fricke, S Hedetniemi, D Jacobs, V Trevisan The Electronic Journal of Linear Algebra 1, 1996 | 33 | 1996 |

Self-stabilizing graph protocols W Goddard, ST Hedetniemi, DP Jacobs, P Srimani, Z Xu Parallel Processing Letters 18 (01), 189-199, 2008 | 29 | 2008 |

Albert User Guide DP Jacobs, D Lee, SV Muddana, AJ Offut, K Prabhu, T Whiteley Department of Computers Science, Clemson University, 1993 | 21* | 1993 |

Fault tolerant distributed coloring algorithms that stabilize in linear time ST Hedetniemi, DP Jacobs, PK Srimani Proceedings 16th International Parallel and Distributed Processing Symposium …, 2002 | 20 | 2002 |

Independence and irredundance in k-regular graphs GH Fricke, ST Hedetniemi, DP Jacobs Ars Combinatoria 49, 271-279, 1998 | 19 | 1998 |

The determinant of a tree's neighborhood matrix DP Jacobs, V Trevisan Linear algebra and its applications 256, 235-249, 1997 | 19 | 1997 |