Version 5.0 The LEDA User Manual

Bibliography
[1] H. Alt, N. Blum, K. Mehlhorn, M. Paul: “Computing a maximum cardinality matching
in a bipartite graph in time O(n 1.5√ m/ log n)”. Information Processing Letters,
Vol. 37, No. 4, 237-240, 1991
[2] C. Aragon, R. Seidel: “Randomized Search Trees”. Proc. 30th IEEE Symposium on
Foundations of Computer Science, 540-545, 1989
[3] A.V. Aho, J.E. Hopcroft, J.D. Ullman: “Data Structures and Algorithms”. Addison-
Wesley Publishing Company, 1983
[4] R.K. Ahuja, T.L. Magnanti, J.B. Orlin: “Network Flows”, Section 10.2. Prentice
Hall, 1993
[5] G.M. Adelson-Veslkii, Y.M. Landis: “An Algorithm for the Organization of Information”.
Doklady Akademi Nauk, Vol. 146, 263-266, 1962
[6] I.J. Balaban: “An Optimal Algorithm for Finding Segment Intersections”. Proc. of
the 11th ACM Symposium on Computational Geometry, 211-219, 1995
[7] B. Balkenhol, Yu.M. Shtarkov: “One attempt of a compression algorithm using the
BWT”. Preprint 99-133, SFB343, Fac. of Mathematics, University of Bielefeld, 1999
[8] J.L. Bentley: “Decomposable Searching Problems”. Information Processing Letters,
Vol. 8, 244-252, 1979
[9] J.L. Bentley: “Multi-dimensional Divide and Conquer”. CACM Vol 23, 214-229, 1980
[10] R.E. Bellman: “On a Routing Problem”. Quart. Appl. Math. 16, 87-90, 1958
[11] J.L. Bentley, T. Ottmann: “Algorithms for Reporting and Counting Geometric Intersections”.
IEEE Trans. on Computers C 28, 643-647, 1979
[12] R. Bayer, E. McCreight: “Organization and Maintenance of Large Ordered Indizes”,
Acta Informatica, Vol. 1, 173-189, 1972
[13] N. Blum, K. Mehlhorn: “On the Average Number of Rebalancing Operations in
Weight-Balanced Trees”. Theoretical Computer Science 11, 303-320, 1980
[14] C. Burnikel, K. Mehlhorn, and S. Schirra: “How to compute the Voronoi diagram of
line segments: Theoretical and experimental results”. In LNCS, volume 855, pages
227–239. Springer-Verlag Berlin/New York, 1994. Proceedings of ESA’94.
757