References:
1. Narasimhan, G. and Smid, M., Geometric Spanner Networks, Cambridge University Press (2007).
2. Bakhshesh, D. and Farshi, M. "A lower bound on the stretch factor of Yao graph Y4", Scientia Iranica, 29(6), pp. 3244-3248 (2022).
3. Abam, M.A. and Seraji, M.J.R. "Geodesic spanners for points in R3 amid axis-parallel boxes", Inform Process Lett., 166, 106063 (2021).
4. Abam, M.A. and Borouny, M.S. "Local geometric spanners", Algorithmica, 83, pp. 3629-3648 (2021).
5. Akitaya, H.A., Biniaz, A., and Bose, P. "On the spanning and routing ratios of the directed 6-graph", Comp. Geom-Theor. App., 105(106), 101881 (2022).
6. De Carufel, J.L., Bose, P., Paradis, F., et al. "Local routing in WSPD-based spanners", Journal of Computational Geometry, 12, pp. 1-34 (2021).
7. van Renssen, A. and Wong, G. "Bounded-degree spanners in the presence of polygonal obstacle", Theor. Comput. Sci., 854, pp. 159-173 (2021).
8. Bakhshesh, D. and Farshi, M. "(Weakly) selfapproaching geometric graphs and spanners", Comp. Geom-Theor. App., 78, pp. 20-36 (2019).
9. Bakhshesh, D. and Farshi, M. "A degree 3 plane 5:19-spanner for points in convex position", Scientia Iranica, 28, pp. 3324-3331 (2021).
10. Iranfar, B. and Farshi, M. "On the expected weight of the theta graph on uncertain points", Journal of Algorithms and Computation, 52(1), pp. 163-174 (2020).
11. Dehkordi, H.R., Frati, F., and Gudmundsson, J. "Increasing-chord graphs on point sets", Journal of Graph Algorithms and Applications, 19(2), pp. 761- 778 (2015).
12. Bonichon, N., Bose, P., Carmi, P., et al. "Gabriel triangulations and angle-monotone graphs: Local routing and recognition", In Proceedings of the 24th International Symposium on Graph drawing (GD 2016), pp. 519-531 (2016).
13. Lubiw, A. and Mondal, D. "Construction and local routing for angle-monotone graphs", Journal of Graph Algorithms and Applications, 23(2), pp. 345- 369 (2019).
14. Bakhshesh, D. and Farshi, M. "Angle-monotonicity of Delaunay triangulation", Comp. Geom-Theor. App., 94(10), 1711 (2021).
15. Bakhshesh, D. and Farshi, M. "On the plane angle-monotone graphs", Comp. Geom-Theor. App., 100(10), 1818 (2022).
16. Clarkson, K. "Approximation algorithms for shortest path motion planning", In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC'87, pp. 56-65, New York, NY, USA,. ACM (1987).
17. Keil, J.M., Approximating the Complete Euclidean Graph, R. Karlsson and A. Lingas, Editors, SWAT 88, pp. 208-213, Berlin, Heidelberg (1988).
18. Bose, P., D. Carufel, J.-L., Morin, P., et al. "Towards tight bounds on theta-graphs: More is not always better", Theor. Comput. Sci., 616, pp. 70-93 (2016).