Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes

Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza +1

An elimination tree of a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $v$ and recursing on the connected components of $G-v$ to obtain th…