We survey algorithms for locating eigenvalues of symmetric matrices taking advantage of the underlying graph. We present applications in spectral graph theory.