Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies
Niels Holtgrefe, Jannik Schestag, Norbert Zeh
In the Maximize Phylogenetic Diversity problem, we are given a phylogenetic tree that represents the genetic proximity of species, and we are asked to select a subset of species of…
cs.CC2026
The First Known Problem That Is FPT with Respect to Node Scanwidth but Not Treewidth
Jannik Schestag, Norbert Zeh
Structural parameters of graphs, such as treewidth, play a central role in the study of the parameterized complexity of graph problems. Motivated by the study of parametrized algor…