1. Lecture Notes in Computer Science;M.A. Abam,2012
2. Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: FOCS, pp. 596–605. IEEE Computer Society (1998)
3. Agarwal, P.K., Kaplan, H., Sharir, M.: Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Trans. Algorithms 5, 4:1–4:37 (2008)
4. Basch, J.: Kinetic data structures. PhD Thesis, Stanford University (1999)
5. Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1997, pp. 747–756. Society for Industrial and Applied Mathematics (1997)