1. Agarwal, P., Har-Peled, S.: Maintaining approximate extent measures of moving points. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 148–157 (2001)
2. Banderier, C., Mehlhorn, K., Beier, R.: Smoothed analysis of three combinatorial problems (2002) (manuscript)
3. Barequet, G., Har-Peled, S.: Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 82–91 (1999)
4. Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. Journal of Algorithms 31(1), 1–28 (1999)
5. Basch, J., Guibas, L.J., Zhang, L.: Proximity problems on moving points. In: Proceedings of the 13th Annual ACM Symposium on Computational Geometry, pp. 344–351 (1997)