  We study the following problem: for given integers $d,k$ and graph $G$, can
we obtain a graph with diameter $d$ via at most $k$ edge deletions ? We
determine the computational complexity of this and related problems for
different values of $d$.
