1. Bartal, Yair: Probabilistic approximations of metric spaces and its algorithmic applications. In: 37th Annual Symposium on Foundations of Computer Science, FOCS ’96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 184–193, (1996)
2. Charikar, Moses, Chekuri, Chandra, Cheung, To-Yat., Dai, Zuo, Goel, Ashish, Guha, Sudipto, Li, Ming: Approximation algorithms for directed steiner problems. J. Algorithms 33(1), 73–91 (1999)
3. Dehghani, Sina, Ehsani, Soheil, Hajiaghayi, Mohammad Taghi, Liaghat, Vahid, Räcke, Harald, Seddighin, Saeed: Online weighted degree-bounded steiner networks via novel online mixed packing/covering. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, pp. 42:1–42:14, (2016)
4. Dehghani, Sina, Ehsani, Soheil, Hajiaghayi, MohammadTaghi, Liaghat, Vahid: Online degree-bounded steiner network design. In: Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’16, pp. 164–175, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics. (2016)
5. Dehghani, Sina, Ehsani, Soheil, Hajiaghayi, MohammadTaghi, Liaghat, Vahid, Seddighin, Saeed: Greedy algorithms for online survivable network design. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pp. 152:1–152:14 (2018)