2 papers
cs.DS2025
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 is a rooted tree on the vertices of obtained by choosing a root and recursing on the connected components of to obtain th…
cs.CC2024
Closing the complexity gap of the double distance problem
Luís Cunha, Thiago Lopes, Uéverton Souza +3
Genome rearrangement has been an active area of research in computational comparative genomics for the last three decades. While initially mostly an interesting algorithmic endeavo…