Version 5.0 The LEDA User Manual

[49] T. Iwata, K. Kurosawa: “OMAC: One-Key CBC MAC”. Proc. Fast Software Encryption
(FSE), LNCS 2887, 129-153, 2003
[50] A.B. Kahn: “Topological Sorting of Large Networks”. Communications of the ACM,
Vol. 5, 558-562, 1962
[51] D. Knuth and S. Levy: The CWEB System of Structured Documentation, Version
3.0. Addison-Wesley, 1993.
[52] J.B. Kruskal: “On the Shortest Spanning Subtree of a Graph and the Travelling
Salesman Problem”. Proc. American Math. Society 7, 48-50, 1956
[53] D. Kühl, M. Nissen, K. Weihe: “Efficient, adaptable implementations of graph algorithms”.
Workshop on Algorithm Engineering, Venice, Italy, September 15-17, 1997.
http://www.dsi.unive.it/~wae97/proceedings/ONLY PAPERS/pap4.ps.gz
[54] D. Kühl and K. Weihe: “Data access templates”. C++ Report, 9/7, 15 and 18-21,
1997
[55] E.L. Lawler: “Combinatorial Optimization: Networks and Matroids”. Holt, Rinehart
and Winston, New York, 1976
[56] S.B. Lippman: “C++Primer”. Addison-Wesley, Publishing Company, 1989
[57] G.S. Luecker: “A Data Structure for Orthogonal Range Queries”. Proc. 19th IEEE
Symposium on Foundations of Computer Science, 28-34, 1978
[58] K. Mehlhorn: “Data Structures and Algorithms”. Vol. 1–3, Springer Publishing Company,
1984
[59] D.M. McCreight: “Efficient Algorithms for Enumerating Intersecting Intervals”. Xerox
Parc Report, CSL-80-09, 1980
[60] D.M. McCreight: “Priority Search Trees”. Xerox Parc Report, CSL-81-05, 1981
[61] M. Mignotte: “Mathematics for Computer Algebra”. Springer Verlag, 1992.
[62] K. Mehlhorn, S. Näher: “LEDA, a Library of Efficient Data Types and Algorithms”.
TR A 04/89, FB10, Universität des Saarlandes, Saarbrücken, 1989
[63] K. Mehlhorn, S. Näher: “ LEDA, a Platform for Combinatorial and Geometric Computing”.
Communications of the ACM, Vol. 38, No. 1, 96-102, 1995
[64] K. Mehlhorn, S. Näher: “LEDA, a Platform for Combinatorial and Geometric Computing”.
book, in preparation. For sample chapters see the LEDA www-pages.
[65] K. Mehlhorn and S. Näher: “Implementation of a sweep line algorithm for the straight
line segment intersection problem”. Technical Report MPI-I-94-160, Max-Planck-
Institut für Informatik, Saarbrücken, 1994.
[66] K. Mehlhorn and S. Näher: “The implementation of geometric algorithms”. In 13th
World Computer Congress IFIP94, volume 1, pages 223–231. Elsevier Science B.V.
North-Holland, Amsterdam, 1994.