1. Abraham I, Neiman O (2012) Using petal-decompositions to build low-stretch spanning trees. In: Proceedings of the 44th annual ACM symposium on theory of computing, New York, June 2012, pp 395–406
2. Abraham I, Bartal Y, Neiman O (2007) Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In: Proceedings of the 18th ACM-SIAM symposium on discrete algorithms, New Orleans, Jan 2007
3. Alon N, Karp RM, Peleg D, West D (1995) A graph-theoretic game and its application to the k-server problem. SIAM J Comput 24(1):78–100. Also available technical report TR-91-066, ICSI, Berkeley (1991)
4. Bartal Y (1996) Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th annual symposium on foundations of computer science, Berlington, Oct 1996, pp 184–193
5. Bartal Y (1998) On approximating arbitrary metrices by tree metrics. In: Proceedings of the 30th annual ACM symposium on theory of computing, Dallas, 23–26 May 1998, pp 161–168