1. Abiteboul, S., Alstrup, S., Kaplan, H., Milo, T., Rauhe, T.: Compact labeling schemes for ancestor queries. SIAM Journal on Computing 35, 1295–1309 (2006)
2. Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: 12 th Symposium on Discrete Algorithms (SODA), pp. 547–556 (January 2001)
3. Abraham, I., Balakrishnan, M., Kuhn, F., Malkhi, D., Talwar, K., Ramasubramanian, V.: Reconstructing approximate tree metrics. In: 26 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 43–52. ACM Press, New York (2007)
4. Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. In: 14 th Symposium on Discrete Algorithms (SODA), ACM-SIAM, pp. 689–698 (2003)
5. Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. SIAM Journal on Discrete Mathematics 19, 448–462 (2005)