| Most Laplacian eigenvalues of a tree are small | 0 | 0.34 | 2021 |
| Eigenvalue location in cographs. | 2 | 0.40 | 2018 |
| Locating the Eigenvalues for Graphs of Small Clique-Width. | 0 | 0.34 | 2018 |
| Laplacian Distribution and Domination. | 0 | 0.34 | 2017 |
| Domination number and Laplacian eigenvalue distribution | 2 | 0.43 | 2016 |
| A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets | 2 | 0.39 | 2015 |
| Diagonalization of generalized lollipop graphs | 2 | 0.47 | 2015 |
| Computing the Characteristic Polynomial of Threshold Graphs. | 3 | 0.49 | 2014 |
| Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets. | 0 | 0.34 | 2013 |
| A systematic approach to teaching abstraction and mathematical modeling | 4 | 0.48 | 2012 |
| Anonymous daemon conversion in self-stabilizing algorithms by randomization in constant space | 4 | 0.45 | 2008 |
| Self-Stabilizing Graph Protocols | 13 | 0.72 | 2008 |
| Distance- k knowledge in self-stabilizing algorithms | 18 | 0.89 | 2008 |
| Polynomial recognition of equal unions in hypergraphs with few vertices of large degree | 0 | 0.34 | 2006 |
| Distance-k information in self-stabilizing algorithms | 10 | 0.77 | 2006 |
| Self-Stabilizing Global Optimization Algorithms For Large Network Graphs | 8 | 0.71 | 2005 |
| Self-Stabilizing Algorithms For Orderings And Colorings | 4 | 0.56 | 2005 |
| Fault Tolerant Algorithms for Orderings and Colorings | 6 | 0.58 | 2004 |
| Self-Stabilizing Maximal K-Dependent Sets In Linear Time | 1 | 0.38 | 2004 |
| A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time | 3 | 0.40 | 2003 |
| Linear time self-stabilizing colorings | 25 | 1.18 | 2003 |
| Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks | 30 | 1.61 | 2003 |
| A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Graph | 15 | 0.96 | 2003 |
| Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time | 8 | 2.43 | 2002 |
| A note on equal unions in families of sets | 3 | 0.56 | 2001 |
| Domination Subdivision Numbers. | 10 | 2.06 | 2001 |
| Maximal matching stabilizes in time O(m) | 24 | 1.34 | 2001 |
| An O(n2) Algorithm for the Characteristic Polynomial of a Tree | 0 | 0.34 | 2001 |
| A simple heuristic for maximizing service of carousel storage | 9 | 2.42 | 2000 |
| Complexity of recognizing equal unions in families of sets | 5 | 0.64 | 2000 |
| On the complexity of sign-nonsingularity and equal unions of sets | 2 | 0.52 | 2000 |
| Independence And Irredundance In K-Regular Graphs | 5 | 0.81 | 1998 |
| A course in computational nonassociative algebra | 0 | 0.34 | 1997 |
| Maximal irredundant functions | 1 | 0.62 | 1996 |
| The Albert nonassociative algebra system: a progress report | 2 | 0.48 | 1994 |
| Undecidability of Winkler's r-neighborhood problem for covering digraphs | 0 | 0.34 | 1994 |
| The Private Neighbor Cube | 18 | 1.43 | 1994 |
| Efficient sets in graphs | 6 | 1.83 | 1993 |
| The word problem for free partially commutative, partially associative groupoids | 0 | 0.34 | 1993 |
| Experimenting with the identity (xy)z = y(zx) | 5 | 0.72 | 1993 |
| Fast Change of Basis in Algebras. | 1 | 0.41 | 1992 |
| Probabilistic checking of associativity in algebras | 2 | 0.55 | 1991 |
| On the computational complexity of upper fractional domination | 15 | 2.12 | 1990 |
| Verification of Non-Identities in Algebras | 1 | 0.47 | 1988 |
