Simeon C. Ntafos

According to our database1, Simeon C. Ntafos
  • authored at least 48 papers between 1979 and 2010.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 




Guarding a Terrain by Two Watchtowers.
Algorithmica, 2010

On Some City Guarding Problems.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Fault Detection Framework for Video Surveillance Systems.
Proceedings of the Fifth IEEE International Conference on Advanced Video and Signal Based Surveillance, 2008

An Experimental Study of Weighted k-Link Shortest Path Algorithms.
Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Two-Guard Art Gallery Problem.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

k-Link Shortest Paths in Weighted Subdivisions.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Guarding a terrain by two watchtowers.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Geometric approach for finding HPD-credible sets with applications.
Applied Mathematics and Computation, 2002

On Comparisons of Random, Partition, and Proportional Partition Testing.
IEEE Trans. Software Eng., 2001

A high-assurance measurement repository system.
Proceedings of the 5th IEEE International Symposium on High-Assurance Systems Engineering (HASE 2000), 2000

Watchman Routes in the Presence of a Pair of Convex Polygons.
Inf. Sci., 1998

On Random and Partition Testing.
Proceedings of ACM SIGSOFT International Symposium on Software Testing and Analysis, 1998

Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks.
IPPS/SPDP Workshops, 1998

Watchman routes in the presence of a pair of convex polygons.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

External watchman routes.
The Visual Computer, 1994

Optimum Placement of Guards.
Inf. Sci., 1994

On Some Reliability Estimation Problems in Random and Partition Testing.
IEEE Trans. Software Eng., 1993

Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons.
Int. J. Comput. Geometry Appl., 1993

On covering orthogonal polygons with star-shaped polygons.
Inf. Sci., 1992

The zookeeper route problem.
Inf. Sci., 1992

Covering Grids and Orthogonal Polygons with Periscope Guards.
Comput. Geom., 1992

Software Testing: Theory and Practice.
Proceedings of the Proceedings IEEE International Test Conference 1992, 1992

Shortest Watchman Routes in Simple Polygons.
Discrete & Computational Geometry, 1991

Watchman Routes Under Limited Visibility.
Comput. Geom., 1991

On Partitioning Rectilinear Polygons into Star-Shaped Polygons.
Algorithmica, 1991

Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons.
Proceedings of the Algorithms and Data Structures, 1991

On some reliability estimation problems in random and partition testing.
Proceedings of the Second International Symposium on Software Reliability Engineering, 1991

Path planning in the presence of vertical obstacles.
IEEE Trans. Robotics and Automation, 1990

The Robber Route Problem.
Inf. Process. Lett., 1990

Path Planning in 0/1/ Weighted Regions with Applications.
INFORMS Journal on Computing, 1990

A Comparison of Some Structural Testing Strategies.
IEEE Trans. Software Eng., 1988

On Decomposing Polygons into Uniformly Monotone Parts.
Inf. Process. Lett., 1988

Optimum Watchman Routes.
Inf. Process. Lett., 1988

Path Planning in 0/1/infinity Weighted Regions with Applications.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

Compression Trees and Their Applications.
Proceedings of the International Conference on Parallel Processing, 1987

On Gallery Watchmen in Grids.
Inf. Process. Lett., 1986

Optimum Watchman Routes.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

Parallel Tree Techniques and Code Optimization.
Proceedings of the VLSI Algorithms and Architectures, 1986

On Required Element Testing.
IEEE Trans. Software Eng., 1984

An Evaluation of Random Testing.
IEEE Trans. Software Eng., 1984

On the Computational Complexity of Path Cover Problems.
J. Comput. Syst. Sci., 1984

On Legal Path Problems in Digraphs.
Inf. Process. Lett., 1984

An Evaluation of Required Element Testing Strategies.
Proceedings of the Proceedings, 1984

On the complexity of some coding problems.
IEEE Trans. Information Theory, 1981

On Structured Digraphs and Program Testing.
IEEE Trans. Computers, 1981

A Report on Random Testing.
Proceedings of the 5th International Conference on Software Engineering, 1981

On Path Cover Problems in Digraphs and Applications to Program Testing.
IEEE Trans. Software Eng., 1979