  In the literature on parameterized graph problems, there has been an
increased effort in recent years aimed at exploring novel notions of graph
edit-distance that are more powerful than the size of a modulator to a specific
graph class. In this line of research, Bulian and Dawar [Algorithmica, 2016]
introduced the notion of elimination distance and showed that deciding whether
a given graph has elimination distance at most $k$ to any minor-closed class of
graphs is fixed-parameter tractable parameterized by $k$ [Algorithmica, 2017].
There has been a subsequent series of results on the fixed-parameter
tractability of elimination distance to various graph classes. However, one
class of graph classes to which the computation of elimination distance has
remained open is the class of graphs that are characterized by the exclusion of
a family ${\cal F}$ of finite graphs as topological minors.
  In this paper, we settle this question by showing that the problem of
determining elimination distance to such graphs is also fixed-parameter
tractable.
