| Edge dominating sets and vertex covers. | 0 | 0.34 | 2013 |
| Global Domination and Packing Numbers. | 1 | 0.37 | 2011 |
| Global secure sets of grid-like graphs | 4 | 0.50 | 2011 |
| On a graph's security number | 3 | 0.48 | 2009 |
| On global domination critical graphs | 0 | 0.34 | 2009 |
| Powerful alliances in graphs | 8 | 0.81 | 2009 |
| Partitioning a graph into alliance free sets | 4 | 0.54 | 2009 |
| Bounds On Powerful Alliance Numbers | 1 | 0.35 | 2008 |
| Bounds on a graph's security number | 13 | 1.00 | 2008 |
| Security in graphs | 12 | 1.40 | 2007 |
| On the dimension of trees | 1 | 0.43 | 2005 |
| Edge-recognizable domination numbers | 0 | 0.34 | 2003 |
| Full domination in graphs. | 0 | 0.34 | 2001 |
| An extremal bandwidth problem for bipartite graphs | 0 | 0.34 | 2000 |
| An Equation Involving The Neighborhood (Two-Step) And Line Graphs | 3 | 0.58 | 1999 |
| Inversions in k-sorted permutations | 0 | 0.34 | 1998 |
| On the radius and diameter of the clique graph | 2 | 0.50 | 1995 |
| Weak-Heap Sort | 26 | 1.41 | 1993 |
| Extremal graphs domination insensitive to the removal of k edges | 0 | 0.34 | 1993 |
| A Compilation Of Relations Between Graph Invariants - Supplement-1 | 6 | 0.87 | 1991 |
| Factor domination in graphs | 10 | 1.29 | 1990 |
| INGRID: A graph invariant manipulator | 3 | 0.68 | 1989 |
| Vertex Domination Critical Graphs | 28 | 3.37 | 1988 |
| An external problem for edge domination insensitive graphs | 8 | 1.07 | 1988 |
| A Compilation Of Relations Between Graph Invariants | 11 | 1.62 | 1985 |
| Upper-Bounds On The Edge Clique Cover Number Of A Graph | 2 | 0.66 | 1984 |
| On clique covers and independence numbers of graphs | 12 | 2.54 | 1983 |
| Efficiently identifying the faces of a solid | 9 | 0.83 | 1983 |
| The Complexity Of A Multiprocessor Task Assignment Problem Without Deadlines | 0 | 0.34 | 1982 |
| Graphs which, with their complements, have certain clique covering numbers | 9 | 1.95 | 1981 |
| A New Graph-Coloring Algorithm | 14 | 1.84 | 1981 |
