1. Lecture Notes in Computer Science;P. Angelini,2009
2. Dhandapani, R.: Greedy drawings of triangulations. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 102–111. SIAM, Philadelphia (2008)
3. Lecture Notes in Computer Science;D. Eppstein,2009
4. Knuth, D.E.: Optimum binary search trees. Acta Informatica 1, 14–25 (1971)
5. Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 337–346. IEEE Press, Los Alamitos (2008)