1. Abeywickrama, T., Cheema, M.A., Taniar, D.: K-nearest neighbors on road networks: a journey in experimentation and in-memory implementation. PVLDB 9(6), 492–503 (2016)
2. Akiba, T., Iwata, Y.: Kawarabayashi, K.I., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: ALENEX, pp. 147–154 (2014)
3. Erwig, M., Hagen, F.: The graph voronoi diagram with applications. Networks 36, 156–163 (2000)
4. Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: SODA, pp. 156–165 (2005)
5. Goldberg, A.V., Werneck, R.F.F.: Computing point-to-point shortest paths from external memory. In: ALENEX, pp. 26–40 (2005)