| Sufficient degree conditions for k-edge-connectedness of a graph | 3 | 0.47 | 2009 |
| Tiling Rectangles with Trominoes: 10641. | 0 | 0.34 | 2000 |
| Star arboricity of graphs | 16 | 1.17 | 1996 |
| Degree-bounded coloring of graphs: variations on a theme by Brooks | 1 | 0.37 | 1995 |
| Information Dissemination in Distributed Systems with Faulty Units | 15 | 1.31 | 1994 |
| Parallel Information Dissemination by Packets | 17 | 1.12 | 1994 |
| Gossiping with multiple sends and receives | 0 | 0.34 | 1994 |
| On minimum fault-tolerant networks | 8 | 0.68 | 1993 |
| Gossiping in a Distributed Network | 5 | 0.67 | 1993 |
| On Locating Path-Shaped Or Tree-Shaped Facilities On Networks | 49 | 2.94 | 1993 |
| Sequential Information Dissemination By Packets | 12 | 0.79 | 1992 |
| Data transfers in broadcast networks | 13 | 0.90 | 1992 |
| An optimal algorithm for distributed system level diagnosis | 37 | 2.84 | 1991 |
| Fitting polygonal functions to a set of points in the plane | 41 | 3.45 | 1991 |
| Parallel algorithms for gossiping by mail | 20 | 3.62 | 1990 |
| Recognizing tough graphs is NP-hard | 40 | 3.58 | 1990 |
| Parallel fault identification algorithm | 6 | 0.59 | 1990 |
| A note on the vertex arboricity of a graph | 17 | 1.99 | 1989 |
| Distributed diagnosis and the system user | 11 | 0.87 | 1988 |
| The complexity of searching a graph | 173 | 24.25 | 1988 |
| A cycle structure theorem for Hamiltonian graphs | 30 | 3.70 | 1988 |
| Data transfer in networks with transceivers | 8 | 0.81 | 1987 |
| System-level diagnosis: analysis of two new models | 0 | 0.34 | 1986 |
| Fault-Tolerant Routing in DeBruijn Comrnunication Networks | 64 | 5.86 | 1985 |
| On Adaptive System Diagnosis | 45 | 2.94 | 1984 |
| On Fault Identification in Diagnosable Systems | 77 | 4.78 | 1981 |
| On the number of hamiltonian cycles in a maximal planar graph. | 8 | 1.23 | 1979 |
| Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis" | 2 | 0.43 | 1978 |
| On the connectivity of maximal planar graphs. | 4 | 2.66 | 1978 |
| Characterization of Connection Assignment of Diagnosable Systems | 232 | 39.27 | 1974 |
| On the design of reliable networks | 20 | 10.70 | 1973 |
| Graph theoretic -ary codes (Corresp.) | 0 | 0.34 | 1971 |
| Steiner's problem in graphs and its implications | 151 | 87.01 | 1971 |
| A Graph-Theoretic Approach to a Class of Integer-Programming Problems | 11 | 58.69 | 1969 |
