| An Experimental Study of Weighted k-Link Shortest Path Algorithms | 1 | 0.37 | 2006 |
| Two-Guard Art Gallery Problem | 0 | 0.34 | 2006 |
| Geometric approach for finding HPD-credible sets with applications | 0 | 0.34 | 2002 |
| On Comparisons of Random, Partition, and Proportional Partition Testing | 30 | 1.34 | 2001 |
| A high-assurance measurement repository system. | 1 | 0.35 | 2000 |
| On random and partition testing | 29 | 2.38 | 1998 |
| Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks | 1 | 0.41 | 1998 |
| External watchman routes | 8 | 0.71 | 1994 |
| Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons | 8 | 0.93 | 1993 |
| Software Testing: Theory and Practice | 0 | 0.34 | 1992 |
| Optimum Guard Covers And M-Watchmen Routes For Restricted Polygons | 12 | 0.92 | 1991 |
| On Partitioning Rectilinear Polygons into Star-Shaped Polygons | 0 | 0.34 | 1991 |
| Path planning in 0/1/ weighted regions with applications | 16 | 1.48 | 1990 |
| The robber route problem | 8 | 1.40 | 1990 |
| Path Planning in 0/1/infinity Weighted Regions with Applications | 3 | 0.69 | 1988 |
| Compression Trees and Their Applications | 1 | 0.39 | 1987 |
| On gallery watchmen in grids | 18 | 2.52 | 1986 |
| Optimum watchman routes | 69 | 13.50 | 1986 |
| Parallel tree techniques and code optimization | 0 | 0.34 | 1986 |
| An Evaluation of Random Testing | 354 | 56.03 | 1984 |
| On legal path problems in digraphs | 0 | 0.34 | 1984 |
| An evaluation of required element testing strategies | 23 | 9.92 | 1984 |
| On the complexity of some coding problems | 9 | 1.24 | 1981 |
| On structured digraphs and program testing | 8 | 1.57 | 1981 |
