  In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph $G$ and
an integer $k$, and the goal is to decide whether there is a set of edges of
size at most $k$ such that removing the edges of the set from $G$ results a
graph that does not contain an induced claw or diamond. In this paper we give
an algorithm for this problem whose running time is $O^*(3.562^k)$.
