| Year |
Citation |
Score |
| 2010 |
Agarwal PK, Bereg S, Daescu O, Kaplan H, Ntafos S, Sharir M, Zhu B. Guarding a terrain by two watchtowers Algorithmica (New York). 58: 352-390. DOI: 10.1007/S00453-008-9270-3 |
0.457 |
|
| 2008 |
Bao L, Bereg S, Daescu O, Ntafos S, Zhou J. On some city guarding problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5092: 600-610. DOI: 10.1007/978-3-540-69733-6_59 |
0.333 |
|
| 2008 |
Daescu O, Mitchell JSB, Ntafos S, Palmer JD, Yap CK. An experimental study of weighted k-link shortest path algorithms Springer Tracts in Advanced Robotics. 47: 187-202. DOI: 10.1007/978-3-540-68405-3_12 |
0.342 |
|
| 2005 |
Agarwal PK, Bereg S, Daescu O, Kaplan H, Ntafos S, Zhu B. Guarding a terrain by two watchtowers Proceedings of the Annual Symposium On Computational Geometry. 346-355. DOI: 10.1145/1064092.1064145 |
0.441 |
|
| 2005 |
Daescu O, Mitchell JSB, Ntafos S, Palmer JD, Yap CK. k-Link shortest paths in weighted subdivisions Lecture Notes in Computer Science. 3608: 325-337. |
0.348 |
|
| 2000 |
Gewali LP, Singh AK, Ntafos S. Computing Optimum Bayesian Confidence Interval with Applications Proceedings of the Joint Conference On Information Sciences. 5: 421-424. |
0.317 |
|
| 1998 |
Gewali LP, Ntafos S. Watchman routes in the presence of a pair of convex polygons Information Sciences. 105: 123-149. |
0.507 |
|
| 1994 |
Ntafos S, Tsoukalas M. Optimum placement of guards Information Sciences. 76: 141-150. DOI: 10.1016/0020-0255(94)90072-8 |
0.368 |
|
| 1994 |
Ntafos S, Gewali L. External watchman routes The Visual Computer. 10: 474-483. DOI: 10.1007/BF01910637 |
0.503 |
|
| 1993 |
Gewali LP, Ntafos S. Covering grids and orthogonal polygons with periscope guards Computational Geometry: Theory and Applications. 2: 309-334. DOI: 10.1016/0925-7721(93)90013-V |
0.512 |
|
| 1992 |
Ntafos S. Watchman routes under limited visibility Computational Geometry: Theory and Applications. 1: 149-170. DOI: 10.1016/0925-7721(92)90014-J |
0.434 |
|
| 1992 |
Gewali L, Keil M, Ntafos S. On covering orthogonal polygons with star-shaped polygons Information Sciences. 65: 45-63. DOI: 10.1016/0020-0255(92)90077-L |
0.478 |
|
| 1992 |
Wei-Pang C, Ntafos S. The zookeeper route problem Information Sciences. 63: 245-259. DOI: 10.1016/0020-0255(92)90072-G |
0.401 |
|
| 1991 |
Chin WP, Ntafos S. Shortest watchman routes in simple polygons Discrete &Amp; Computational Geometry. 6: 9-31. DOI: 10.1007/BF02574671 |
0.406 |
|
| 1991 |
Liu R, Ntafos S. On partitioning rectilinear polygons into star-shaped polygons Algorithmica. 6: 771-800. DOI: 10.1007/BF01759071 |
0.455 |
|
| 1990 |
Gewali LP, Meng AC, Mitchell JSB, Ntafos S. Path Planning in 0/1/∞ Weighted Regions with Applications Informs Journal On Computing. 2: 253-272. DOI: 10.1287/Ijoc.2.3.253 |
0.471 |
|
| 1990 |
Gewali LP, Ntafos S, Tollis IG. Path Planning in the Presence of Vertical Obstacles Ieee Transactions On Robotics and Automation. 6: 331-341. DOI: 10.1109/70.56665 |
0.471 |
|
| 1990 |
Ntafos S. The robber route problem Information Processing Letters. 34: 59-63. DOI: 10.1016/0020-0190(90)90137-M |
0.316 |
|
| 1988 |
Chin Wp, Ntafos S. Optimum watchman routes Information Processing Letters. 28: 39-44. DOI: 10.1016/0020-0190(88)90141-X |
0.532 |
|
| 1988 |
Liu R, Ntafos S. On decomposing polygons into uniformly monotone parts Information Processing Letters. 27: 85-89. DOI: 10.1016/0020-0190(88)90097-X |
0.466 |
|
| 1986 |
Ntafos S. On Gallery Watchmen in grids Information Processing Letters. 23: 99-102. DOI: 10.1016/0020-0190(86)90050-5 |
0.475 |
|
| 1984 |
Ntafos S, Gonzalez T. On the computational complexity of path cover problems Journal of Computer and System Sciences. 29: 225-242. DOI: 10.1016/0022-0000(84)90032-1 |
0.408 |
|
| 1984 |
Ihm HS, Ntafos SC. On legal path problems in digraphs Information Processing Letters. 18: 93-98. DOI: 10.1016/0020-0190(84)90030-9 |
0.417 |
|
| Show low-probability matches. |