1. Afshani, P., Chan, T.M.: Optimal halfspace range reporting in three dimensions. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 180–186 (2009)
2. Ashur, S., Carmi, P.: t-spanners for transmission graphs using the path-greedy algorithm. In: 36th European Workshop on Computational Geometry (EuroCG 2020), Book of Abstracts, pp. 60:1–60:6 (2020)
3. Cabello, S., Jejčič, M.: Shortest paths in intersection graphs of unit disks. Comput Geom. 48(4), 360–367 (2015)
4. Chan, T.M.: Dynamic geometric data structures via shallow cuttings. In: Proceedings of the 35th International Symposium on Computational Geometry (SoCG 2019), pp. 24:1–24:13 (2019)
5. Chan, T.M., Skrepetos, D.: Approximate shortest paths and distance oracles in weighted unit-disk graphs. J. Comput. Geom. 10(2), 3–20 (2019)