On Path Cover Problems in Digraphs and Applications to Program Testing. - Simeon C. Ntafos; S. Louis Hakimi (IEEE Trans. Software Eng., 1979)

A Report on Random Testing. - Joe W. Duran; Simeon C. Ntafos (ICSE, 1981)

On Structured Digraphs and Program Testing. - Simeon C. Ntafos; S. Louis Hakimi (IEEE Trans. Computers, 1981)

On the complexity of some coding problems. - Simeon C. Ntafos; S. Louis Hakimi (IEEE Trans. Inf. Theory, 1981)

An Evaluation of Required Element Testing Strategies. - Simeon C. Ntafos (ICSE, 1984)

On Legal Path Problems in Digraphs. - Heung-Soon Ihm; Simeon C. Ntafos (Inf. Process. Lett., 1984)

On the Computational Complexity of Path Cover Problems. - Simeon C. Ntafos; Teofilo F. Gonzalez (J. Comput. Syst. Sci., 1984)

An Evaluation of Random Testing. - Joe W. Duran; Simeon C. Ntafos (IEEE Trans. Software Eng., 1984)

On Required Element Testing. - Simeon C. Ntafos (IEEE Trans. Software Eng., 1984)

Parallel Tree Techniques and Code Optimization. - Eliezer Dekel; Simeon C. Ntafos; Shietung Peng (Aegean Workshop on Computing, 1986)

On Gallery Watchmen in Grids. - Simeon C. Ntafos (Inf. Process. Lett., 1986)

Compression Trees and Their Applications. - Eliezer Dekel; Simeon C. Ntafos; Shietung Peng (ICPP, 1987)

Path Planning in 0/1/infinity Weighted Regions with Applications. - Laxmi P. Gewali; Alex C. Meng; Joseph S. B. Mitchell; Simeon C. Ntafos (SCG, 1988)

Optimum Watchman Routes. - Wei-pang Chin; Simeon C. Ntafos (Inf. Process. Lett., 1988)

On Decomposing Polygons into Uniformly Monotone Parts. - Robin Liu; Simeon C. Ntafos (Inf. Process. Lett., 1988)

A Comparison of Some Structural Testing Strategies. - Simeon C. Ntafos (IEEE Trans. Software Eng., 1988)

Path Planning in 0/1/ Weighted Regions with Applications. - Laxmi P. Gewali; Alex C. Meng; Joseph S. B. Mitchell; Simeon C. Ntafos (INFORMS J. Comput., 1990)

The Robber Route Problem. - Simeon C. Ntafos (Inf. Process. Lett., 1990)

Path planning in the presence of vertical obstacles. - Laxmi P. Gewali; Simeon C. Ntafos; Ioannis G. Tollis (IEEE Trans. Robotics Autom., 1990)

On Partitioning Rectilinear Polygons into Star-Shaped Polygons. - Robon Liu; Simeon C. Ntafos (Algorithmica, 1991)

Watchman Routes Under Limited Visibility. - Simeon C. Ntafos (Comput. Geom., 1991)

Shortest Watchman Routes in Simple Polygons. - Wei-pang Chin; Simeon C. Ntafos (Discret. Comput. Geom., 1991)

Software Testing: Theory and Practice. - Simeon C. Ntafos (ITC, 1992)

Covering Grids and Orthogonal Polygons with Periscope Guards. - Laxmi P. Gewali; Simeon C. Ntafos (Comput. Geom., 1992)

The zookeeper route problem. - Wei-pang Chin; Simeon C. Ntafos (Inf. Sci., 1992)

On covering orthogonal polygons with star-shaped polygons. - Laxmi P. Gewali; J. Mark Keil; Simeon C. Ntafos (Inf. Sci., 1992)

Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. - Svante Carlsson; Bengt J. Nilsson; Simeon C. Ntafos (Int. J. Comput. Geom. Appl., 1993)

On Some Reliability Estimation Problems in Random and Partition Testing. - Markos Z. Tsoukalas; Joe W. Duran; Simeon C. Ntafos (IEEE Trans. Software Eng., 1993)

Optimum Placement of Guards. - Simeon C. Ntafos; Markos Z. Tsoukalas (Inf. Sci., 1994)

External watchman routes. - Simeon C. Ntafos; Laxmi P. Gewali (Vis. Comput., 1994)

A Greedy Algorithm for Over-The-Cell Channel Routing. - Gudni Gudmundsson; Simeon C. Ntafos (VLSI Design, 1996)

Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks. - Charles O. Shields Jr.; Vikas Jain; Simeon C. Ntafos; Ravi Prakash 001; S. Venkatesan 001 (IPPS/SPDP Workshops, 1998)

On Random and Partition Testing. - Simeon C. Ntafos (ISSTA, 1998)

Watchman Routes in the Presence of a Pair of Convex Polygons. - Laxmi P. Gewali; Simeon C. Ntafos (Inf. Sci., 1998)

A high-assurance measurement repository system. - Farokh B. Bastani; Simeon C. Ntafos; I-Ling Yen; Doug E. Harris; Richard R. Morrow; Raymond A. Paul (HASE, 2000)

On Comparisons of Random, Partition, and Proportional Partition Testing. - Simeon C. Ntafos (IEEE Trans. Software Eng., 2001)

Geometric approach for finding HPD-credible sets with applications. - Laxmi P. Gewali; Simeon C. Ntafos; Ashok K. Singh (Appl. Math. Comput., 2002)

Guarding a terrain by two watchtowers. - Pankaj K. Agarwal; Sergey Bereg; Ovidiu Daescu; Haim Kaplan; Simeon C. Ntafos; Binhai Zhu (SCG, 2005)

k-Link Shortest Paths in Weighted Subdivisions. - Ovidiu Daescu; Joseph S. B. Mitchell; Simeon C. Ntafos; James D. Palmer 002; Chee-Keng Yap (WADS, 2005)

Two-Guard Art Gallery Problem. - Junqiang Zhou; Simeon C. Ntafos (CCCG, 2006)

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. - Ovidiu Daescu; Joseph S. B. Mitchell; Simeon C. Ntafos; James D. Palmer 002; Chee-Keng Yap (SCG, 2006)

An Experimental Study of Weighted k-Link Shortest Path Algorithms. - Ovidiu Daescu; Joseph S. B. Mitchell; Simeon C. Ntafos; James D. Palmer 002; Chee-Keng Yap (WAFR, 2006)

Fault Detection Framework for Video Surveillance Systems. - Junqiang Zhou; Simeon C. Ntafos; Balakrishnan Prabhakaran 001 (AVSS, 2008)

On Some City Guarding Problems. - Lichen Bao; Sergey Bereg; Ovidiu Daescu; Simeon C. Ntafos; Junqiang Zhou (COCOON, 2008)

Guarding a Terrain by Two Watchtowers. - Pankaj K. Agarwal; Sergey Bereg; Ovidiu Daescu; Haim Kaplan; Simeon C. Ntafos; Micha Sharir; Binhai Zhu (Algorithmica, 2010)