Simeon C. Ntafos
Loading Google Thumbnails...
| 2010 |
|---|
| 5 | Guarding a Terrain by Two Watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu. Algorithmica (58): 352-390 (2010). Web SearchBibTeXDownload |
| 2006 |
|---|
| 4 | 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, Chee-Keng Yap. Symposium on Computational Geometry 2006, 483-484. Web SearchBibTeXDownload |
| 3 | An Experimental Study of Weighted k-Link Shortest Path Algorithms. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. WAFR 2006, 187-202. Web SearchBibTeXDownload |
| 2005 |
|---|
| 2 | Guarding a terrain by two watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu. Symposium on Computational Geometry 2005, 346-355. Web SearchBibTeXDownload |
| 1 | k-Link Shortest Paths in Weighted Subdivisions. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. WADS 2005, 325-337. Web SearchBibTeXDownload |
from DBLP and Google Scholar
