1. Augmenting graphs to minimize the radius;Gudmundsson,2021
2. A linear-time algorithm for radius-optimally augmenting paths in a metric space;Johnson,2019
3. A linear-time algorithm for discrete radius optimally augmenting paths in a metric space;Wang,2020
4. Improved approximability and non-approximability results for graph diameter decreasing problems;Bilò;Theor. Comput. Sci.,2012
5. Minimizing the diameter of a network using shortcut edges;Demaine,2010