  A 2-club is a graph of diameter at most two. In the decision version of the
parametrized {\sc 2-Club Cluster Edge Deletion} problem, an undirected graph
$G$ is given along with an integer $k\geq 0$ as parameter, and the question is
whether $G$ can be transformed into a disjoint union of 2-clubs by deleting at
most $k$ edges. A simple fixed-parameter algorithm solves the problem in
$\mathcal{O}^*(3^k)$, and a decade-old algorithm was claimed to have an
improved running time of $\mathcal{O}^*(2.74^k)$ via a sophisticated case
analysis. Unfortunately, this latter algorithm suffers from a flawed branching
scenario. In this paper, an improved fixed-parameter algorithm is presented
with a running time in $\mathcal{O}^*(2.695^k)$.
