 | 2008 |
|---|
| 40 |       | Lichen Bao,
Sergey Bereg,
Ovidiu Daescu,
Simeon C. Ntafos,
Junqiang Zhou:
On Some City Guarding Problems.
COCOON 2008: 600-610 |
| 2006 |
|---|
| 39 | | Junqiang Zhou,
Simeon C. Ntafos:
Two-Guard Art Gallery Problem.
CCCG 2006 |
| 38 | | Ovidiu Daescu,
Joseph S. B. Mitchell,
Simeon C. Ntafos,
James D. Palmer,
Chee-Keng Yap:
Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.
Symposium on Computational Geometry 2006: 483-484 |
| 37 | | Ovidiu Daescu,
Joseph S. B. Mitchell,
Simeon C. Ntafos,
James D. Palmer,
Chee-Keng Yap:
An Experimental Study of Weighted k-Link Shortest Path Algorithms.
WAFR 2006: 187-202 |
| 2005 |
|---|
| 36 | | Pankaj K. Agarwal,
Sergey Bereg,
Ovidiu Daescu,
Haim Kaplan,
Simeon C. Ntafos,
Binhai Zhu:
Guarding a terrain by two watchtowers.
Symposium on Computational Geometry 2005: 346-355 |
| 35 | | Ovidiu Daescu,
Joseph S. B. Mitchell,
Simeon C. Ntafos,
James D. Palmer,
Chee-Keng Yap:
k-Link Shortest Paths in Weighted Subdivisions.
WADS 2005: 325-337 |
| 2001 |
|---|
| 34 | | Simeon C. Ntafos:
On Comparisons of Random, Partition, and Proportional Partition Testing.
IEEE Trans. Software Eng. 27(10): 949-960 (2001) |
| 1998 |
|---|
| 33 |  | Charles Shields Jr.,
Vikas Jain,
Simeon C. Ntafos,
Ravi Prakash,
S. Venkatesan:
Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks.
IPPS/SPDP Workshops 1998: 770-789 |
| 32 | | Simeon C. Ntafos:
On Random and Partition Testing.
ISSTA 1998: 42-48 |
| 31 | | Laxmi Gewali,
Simeon C. Ntafos:
Watchman Routes in the Presence of a Pair of Convex Polygons.
Inf. Sci. 105(1-4): 123-149 (1998) |
| 1994 |
|---|
| 30 | | Simeon C. Ntafos,
Markos Z. Tsoukalas:
Optimum Placement of Guards.
Inf. Sci. 76(1-2): 141-150 (1994) |
| 29 | | Simeon C. Ntafos,
Laxmi Gewali:
External watchman routes.
The Visual Computer 10(8): 474-483 (1994) |
| 1993 |
|---|
| 28 | | Markos Z. Tsoukalas,
Joe W. Duran,
Simeon C. Ntafos:
On Some Reliability Estimation Problems in Random and Partition Testing.
IEEE Trans. Software Eng. 19(7): 687-697 (1993) |
| 27 | | Svante Carlsson,
Bengt J. Nilsson,
Simeon C. Ntafos:
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons.
Int. J. Comput. Geometry Appl. 3(1): 85-105 (1993) |
| 1992 |
|---|
| 26 | | Simeon C. Ntafos:
Software Testing: Theory and Practice.
ITC 1992: 553 |
| 25 | | Laxmi Gewali,
Simeon C. Ntafos:
Covering Grids and Orthogonal Polygons with Periscope Guards.
Comput. Geom. 2: 309-334 (1992) |
| 24 | | Wei-pang Chin,
Simeon C. Ntafos:
The zookeeper route problem.
Inf. Sci. 63(3): 245-259 (1992) |
| 23 | | Laxmi Gewali,
Mark Keil,
Simeon C. Ntafos:
On covering orthogonal polygons with star-shaped polygons.
Inf. Sci. 65(1-2): 45-63 (1992) |
| 1991 |
|---|
| 22 | | Svante Carlsson,
Bengt J. Nilsson,
Simeon C. Ntafos:
Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons.
WADS 1991: 367-378 |
| 21 | | Robon Liu,
Simeon C. Ntafos:
On Partitioning Rectilinear Polygons into Star-Shaped Polygons.
Algorithmica 6(6): 771-800 (1991) |
| 20 | | Simeon C. Ntafos:
Watchman Routes Under Limited Visibility.
Comput. Geom. 1: 149-170 (1991) |
| 19 | | Wei-pang Chin,
Simeon C. Ntafos:
Shortest Watchman Routes in Simple Polygons.
Discrete & Computational Geometry 6: 9-31 (1991) |
| 1990 |
|---|
| 18 | | Laxmi Gewali,
Alex C. Meng,
Joseph S. B. Mitchell,
Simeon C. Ntafos:
Path Planning in 0/1/ Weighted Regions with Applications.
INFORMS Journal on Computing 2(3): 253-272 (1990) |
| 17 | | Simeon C. Ntafos:
The Robber Route Problem.
Inf. Process. Lett. 34(2): 59-63 (1990) |
| 1988 |
|---|
| 16 | | Laxmi Gewali,
Alex C. Meng,
Joseph S. B. Mitchell,
Simeon C. Ntafos:
Path Planning in 0/1/infinity Weighted Regions with Applications.
Symposium on Computational Geometry 1988: 266-278 |
| 15 | | Simeon C. Ntafos:
A Comparison of Some Structural Testing Strategies.
IEEE Trans. Software Eng. 14(6): 868-874 (1988) |
| 14 | | Robin Liu,
Simeon C. Ntafos:
On Decomposing Polygons into Uniformly Monotone Parts.
Inf. Process. Lett. 27(2): 85-89 (1988) |
| 1987 |
|---|
| 13 | | Eliezer Dekel,
Simeon C. Ntafos,
Shietung Peng:
Compression Trees and Their Applications.
ICPP 1987: 132-139 |
| 1986 |
|---|
| 12 | | Eliezer Dekel,
Simeon C. Ntafos,
Shietung Peng:
Parallel Tree Techniques and Code Optimization.
Aegean Workshop on Computing 1986: 205-216 |
| 11 | | Wei-pang Chin,
Simeon C. Ntafos:
Optimum Watchman Routes.
Symposium on Computational Geometry 1986: 24-33 |
| 10 | | Simeon C. Ntafos:
On Gallery Watchmen in Grids.
Inf. Process. Lett. 23(2): 99-102 (1986) |
| 1984 |
|---|
| 9 | | Simeon C. Ntafos:
An Evaluation of Required Element Testing Strategies.
ICSE 1984: 250-256 |
| 8 | | Joe W. Duran,
Simeon C. Ntafos:
An Evaluation of Random Testing.
IEEE Trans. Software Eng. 10(4): 438-444 (1984) |
| 7 | | Simeon C. Ntafos:
On Required Element Testing.
IEEE Trans. Software Eng. 10(6): 795-803 (1984) |
| 6 | | Heung-Soon Ihm,
Simeon C. Ntafos:
On Legal Path Problems in Digraphs.
Inf. Process. Lett. 18(2): 93-98 (1984) |
| 5 | | Simeon C. Ntafos,
Teofilo F. Gonzalez:
On the Computational Complexity of Path Cover Problems.
J. Comput. Syst. Sci. 29(2): 225-242 (1984) |
| 1981 |
|---|
| 4 | | Joe W. Duran,
Simeon C. Ntafos:
A Report on Random Testing.
ICSE 1981: 179-183 |
| 3 | | Simeon C. Ntafos,
S. Louis Hakimi:
On Structured Digraphs and Program Testing.
IEEE Trans. Computers 30(1): 67-77 (1981) |
| 2 | | Simeon C. Ntafos,
S. Louis Hakimi:
On the complexity of some coding problems.
IEEE Transactions on Information Theory 27(6): 794- (1981) |
| 1979 |
|---|
| 1 | | Simeon C. Ntafos,
S. Louis Hakimi:
On Path Cover Problems in Digraphs and Applications to Program Testing.
IEEE Trans. Software Eng. 5(5): 520-529 (1979) |
