1. , , Approximation algorithms for k-Source bottleneck routing cost spanning tree problems, Proceedings of the International Conference on Computer Science and its Applications ICCSA, San Diego, CA, 2004, pp. 355–366. [Lecture Notes in Computer Science, 3044 (2004), 355–366.].
2. The complexity of minimizing certain cost metrics for k-source spanning trees
3. MULTI-SOURCE SPANNING TREE PROBLEMS
4. , , Multi-source trees: Algorithms for minimizing eccentricity cost metrics, Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), pp. 1080–1089.
5. Optimum Communication Spanning Trees