Quantifier elimination on nowhere dense classes

Develop an analogue of the bounded-expansion quantifier-elimination theorem for nowhere dense graph classes.

Background

For bounded-expansion classes, quantifier elimination can preprocess a graph into a pointer structure supporting constant-time query evaluation. The nowhere-dense model-checking algorithm uses a different game-tree method and does not provide such quantifier elimination. Extending the preprocessing paradigm to nowhere dense classes is explicitly left unresolved.