1. P. K. Agarwal, M. Sharir, P. Shor, Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences, J. Comb. Theory, Ser. A 52, 1989, pp. 228–274.
2. A. V. Aho, J. E. Hopcraft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
3. H. Alt, B. Behrends, J. Blömer, Approximate Matching of Polygonal Shapes, Proceedings of the 7th ACM Symposium on Computational Geometry, 1991, pp. 186–193.
4. H. Alt, J. Blömer, M. Godau, H. Wagener Approximation of Convex Polygons, Proceedings ICALP, International Colloquium on Automata, Languages and Programming, Warwick, England, 1990, pp. 703–716.
5. E. M. Arkin, K. Kedem, J. S. B. Mitchell, J. Sprinzak, M. Werman Matching Points into Noise Regions: Combinatorial Bounds and Algorithms, in Proceedings SODA, 2nd Symposium on Discrete Algorithms, 1991.