1. Chung, F. (1986). Diameters of communication networks. In Mathematics of information processing. Proceedings of Symposia in Applied Mathematics, 34, pp. 1–18.
2. Contreras, I., & Fernández, P. (2012). General network design: A unified view of combined location and network design problems. European Journal of Operational Research, 219(3), 680–697.
3. Demaine, E. & Zadimoghaddam, M. (2010). Minmizing the diameter of a network using shortcut edges. In: Algorithm theory: SWAT 2010, Lecture Notes in Computer Science (Vol. 6139, pp. 420–431), New York: Springer.
4. Eggemann, N., & Noble, S. (2009). Minimizing the oriented diameter of a planar graph. Electronic Notes in Discrete Mathematics, 34, 267–271.
5. Engelhardt-Funke, O., & Kolonko, M. (2001). Cost-benefit analysis of investments into railway networks with randomly pertubed operations. In S. Voß & J. Daduna (Eds.), Computer-aided transit scheduling, Lecture Notes in Economics and Mathematical Systems (Vol. 505, pp. 442–459). New York: Springer.