4 citations · 5 across the 14 of their papers we have counts for
5 papers · 1 filter
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…
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…
Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study
Christian Komusiewicz, Jannik Schestag
In the NP-hard Optimizing PD with Dependencies (PDD) problem, the input consists of a phylogenetic tree over a set of taxa , a food-web that describes the prey-predator rela…
Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond
Leo van Iersel, Mark Jones, Jannik Schestag +2
Network Phylogenetic Diversity (Network-PD) is a measure for the diversity of a set of species based on a rooted phylogenetic network (with branch lengths and inheritance probabili…
Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead
Mark Jones, Jannik Schestag
Phylogenetic Diversity (PD) is a measure of the overall biodiversity of a set of present-day species (taxa) within a phylogenetic tree. In Maximize Phylogenetic Diversity (MPD) one…