default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimeon C. Ntafos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j29]Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu:
Guarding a Terrain by Two Watchtowers. Algorithmica 58(2): 352-390 (2010)
2000 – 2009
- 2008
- [c20]Junqiang Zhou, Simeon C. Ntafos, Balakrishnan Prabhakaran:
Fault Detection Framework for Video Surveillance Systems. AVSS 2008: 219-226 - [c19]Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou:
On Some City Guarding Problems. COCOON 2008: 600-610 - 2006
- [c18]Junqiang Zhou, Simeon C. Ntafos:
Two-Guard Art Gallery Problem. CCCG 2006 - [c17]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. SCG 2006: 483-484 - [c16]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
- [c15]Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu:
Guarding a terrain by two watchtowers. SCG 2005: 346-355 - [c14]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 - 2002
- [j28]Laxmi P. Gewali, Simeon C. Ntafos, Ashok K. Singh:
Geometric approach for finding HPD-credible sets with applications. Appl. Math. Comput. 125(2-3): 195-207 (2002) - 2001
- [j27]Simeon C. Ntafos:
On Comparisons of Random, Partition, and Proportional Partition Testing. IEEE Trans. Software Eng. 27(10): 949-960 (2001) - 2000
- [c13]Farokh B. Bastani, Simeon C. Ntafos, I-Ling Yen, Doug E. Harris, Richard R. Morrow, Raymond A. Paul:
A high-assurance measurement repository system. HASE 2000: 265-272
1990 – 1999
- 1998
- [j26]Laxmi P. Gewali, Simeon C. Ntafos:
Watchman Routes in the Presence of a Pair of Convex Polygons. Inf. Sci. 105(1-4): 123-149 (1998) - [c12]Charles O. 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 - [c11]Simeon C. Ntafos:
On Random and Partition Testing. ISSTA 1998: 42-48 - 1996
- [j25]Gudni Gudmundsson, Simeon C. Ntafos:
A Greedy Algorithm for Over-The-Cell Channel Routing. VLSI Design 5(1): 23-36 (1996) - 1995
- [c10]Laxmi P. Gewali, Simeon C. Ntafos:
Watchman routes in the presence of a pair of convex polygons. CCCG 1995: 127-132 - 1994
- [j24]Simeon C. Ntafos, Markos Z. Tsoukalas:
Optimum Placement of Guards. Inf. Sci. 76(1-2): 141-150 (1994) - [j23]Simeon C. Ntafos, Laxmi P. Gewali:
External watchman routes. Vis. Comput. 10(8): 474-483 (1994) - 1993
- [j22]Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos:
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. Int. J. Comput. Geom. Appl. 3(1): 85-105 (1993) - [j21]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) - 1992
- [j20]Laxmi P. Gewali, Simeon C. Ntafos:
Covering Grids and Orthogonal Polygons with Periscope Guards. Comput. Geom. 2: 309-334 (1992) - [j19]Wei-pang Chin, Simeon C. Ntafos:
The zookeeper route problem. Inf. Sci. 63(3): 245-259 (1992) - [j18]Laxmi P. Gewali, J. Mark Keil, Simeon C. Ntafos:
On covering orthogonal polygons with star-shaped polygons. Inf. Sci. 65(1-2): 45-63 (1992) - [c9]Simeon C. Ntafos:
Software Testing: Theory and Practice. ITC 1992: 553 - 1991
- [j17]Robon Liu, Simeon C. Ntafos:
On Partitioning Rectilinear Polygons into Star-Shaped Polygons. Algorithmica 6(6): 771-800 (1991) - [j16]Simeon C. Ntafos:
Watchman Routes Under Limited Visibility. Comput. Geom. 1: 149-170 (1991) - [j15]Wei-pang Chin, Simeon C. Ntafos:
Shortest Watchman Routes in Simple Polygons. Discret. Comput. Geom. 6: 9-31 (1991) - [c8]Markos Z. Tsoukalas, Joe W. Duran, Simeon C. Ntafos:
On some reliability estimation problems in random and partition testing. ISSRE 1991: 194-201 - [c7]Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos:
Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. WADS 1991: 367-378 - 1990
- [j14]Laxmi P. Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos:
Path Planning in 0/1/ Weighted Regions with Applications. INFORMS J. Comput. 2(3): 253-272 (1990) - [j13]Simeon C. Ntafos:
The Robber Route Problem. Inf. Process. Lett. 34(2): 59-63 (1990) - [j12]Laxmi P. Gewali, Simeon C. Ntafos, Ioannis G. Tollis:
Path planning in the presence of vertical obstacles. IEEE Trans. Robotics Autom. 6(3): 331-341 (1990)
1980 – 1989
- 1988
- [j11]Robin Liu, Simeon C. Ntafos:
On Decomposing Polygons into Uniformly Monotone Parts. Inf. Process. Lett. 27(2): 85-89 (1988) - [j10]Wei-pang Chin, Simeon C. Ntafos:
Optimum Watchman Routes. Inf. Process. Lett. 28(1): 39-44 (1988) - [j9]Simeon C. Ntafos:
A Comparison of Some Structural Testing Strategies. IEEE Trans. Software Eng. 14(6): 868-874 (1988) - [c6]Laxmi P. Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos:
Path Planning in 0/1/infinity Weighted Regions with Applications. SCG 1988: 266-278 - 1987
- [c5]Eliezer Dekel, Simeon C. Ntafos, Shietung Peng:
Compression Trees and Their Applications. ICPP 1987: 132-139 - 1986
- [j8]Simeon C. Ntafos:
On Gallery Watchmen in Grids. Inf. Process. Lett. 23(2): 99-102 (1986) - [c4]Eliezer Dekel, Simeon C. Ntafos, Shietung Peng:
Parallel Tree Techniques and Code Optimization. Aegean Workshop on Computing 1986: 205-216 - [c3]Wei-pang Chin, Simeon C. Ntafos:
Optimum Watchman Routes. SCG 1986: 24-33 - 1984
- [j7]Heung-Soon Ihm, Simeon C. Ntafos:
On Legal Path Problems in Digraphs. Inf. Process. Lett. 18(2): 93-98 (1984) - [j6]Simeon C. Ntafos, Teofilo F. Gonzalez:
On the Computational Complexity of Path Cover Problems. J. Comput. Syst. Sci. 29(2): 225-242 (1984) - [j5]Joe W. Duran, Simeon C. Ntafos:
An Evaluation of Random Testing. IEEE Trans. Software Eng. 10(4): 438-444 (1984) - [j4]Simeon C. Ntafos:
On Required Element Testing. IEEE Trans. Software Eng. 10(6): 795-803 (1984) - [c2]Simeon C. Ntafos:
An Evaluation of Required Element Testing Strategies. ICSE 1984: 250-256 - 1981
- [j3]Simeon C. Ntafos, S. Louis Hakimi:
On Structured Digraphs and Program Testing. IEEE Trans. Computers 30(1): 67-77 (1981) - [j2]Simeon C. Ntafos, S. Louis Hakimi:
On the complexity of some coding problems. IEEE Trans. Inf. Theory 27(6): 794-796 (1981) - [c1]Joe W. Duran, Simeon C. Ntafos:
A Report on Random Testing. ICSE 1981: 179-183
1970 – 1979
- 1979
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
