| On the Inverse Beacon Attraction Region of a Point B Kouhestani, D Rappaport, K Salomaa 27th Canadian Conference on Computational Geometry, 205-212, 2015 | 10 | 2015 |
| An optimal algorithm to compute the inverse beacon attraction region I Kostitsyna, B Kouhestani, S Langerman, D Rappaport arXiv preprint arXiv:1803.05946, 2018 | 8 | 2018 |
| Routing in a polygonal terrain with the shortest beacon watchtower B Kouhestani, D Rappaport, K Salomaa Computational Geometry 68, 34-47, 2018 | 8 | 2018 |
| Visibility polygons in the presence of a mirror edge B Kouhestani, M Asgaripour, SS Mahdavi, A Nouri, A Mohades Proc. 26th European Workshop on Computational Geometry 26, 209-212, 2010 | 6 | 2010 |
| The Length of the Beacon Attraction Trajectory B Kouhestani, D Rappaport, K Salomaa http://www.cse.buffalo.edu/fwcg2015/assets/pdf/FWCG_2015_paper_1.pdf, 2015 | 5 | 2015 |
| Efficient algorithms for beacon routing in polygons B Kouhestani Queen's University (Canada), 2016 | 4 | 2016 |
| Matching regions in the plane using non-crossing segments G Aloupis, EM Arkin, D Bremner, ED Demaine, SP Fekete, B Kouhestani, ... on Computational Geometry, 29, 2015 | 4 | 2015 |
| Computing k-Link Visibility Polygons in Environments with a Reflective Edge. SS Mahdavi, A Mohades, B Kouhestani CCCG, 2011 | 1 | 2011 |
| Technical Report No. 2013-610 Mesh Partitioning B Kouhestani | | 2013 |
David RappaportQueen's UniversityVerified email at cs.queensu.ca
