Jannik Schestag

26 papers B 6C 3Journal 14Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
A multivariate complexity analysis of the Generalized Noah's Ark Problem.
Discret. Appl. Math.
Christian Komusiewicz, Jannik Schestag
2026 J jnl
Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies.
CoRR
Niels Holtgrefe, Jannik Schestag, Norbert Zeh
2026 J jnl
The First Known Problem That Is FPT with Respect to Node Scanwidth but Not Treewidth.
CoRR
Jannik Schestag, Norbert Zeh
2026 B conf
Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder.
SOFSEM
Jannik Schestag
2025 C conf
Average-Tree Phylogenetic Diversity of Networks.
WABI
Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller
2025 B conf
Parameterized Algorithms for Diversity of Networks with Ecological Dependencies.
IPEC
Mark Jones, Jannik Schestag
2025 J jnl
Parameterized Algorithms for Diversity of Networks with Ecological Dependencies.
CoRR
Mark Jones, Jannik Schestag
2025 — conf
Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond.
RECOMB-CG
Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller
2025 J jnl
Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder.
CoRR
Jannik Schestag
2025 J jnl
Who Should Have a Place on the Ark? Parameterized Algorithms for the Maximization of Phylogenetic Diversity.
CoRR
Jannik Schestag
2024 J jnl
Maximizing Network Phylogenetic Diversity.
CoRR
Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller
2024 — conf
Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study.
FSTTCS
Christian Komusiewicz, Jannik Schestag
2024 J jnl
Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study.
CoRR
Christian Komusiewicz, Jannik Schestag
2024 J jnl
Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead.
CoRR
Mark Jones, Jannik Schestag
2024 J jnl
On Critical Node Problems with Vulnerable Vertices.
J. Graph Algorithms Appl.
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2024 — conf
Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis.
ADT
Jaroslav Garvardt, Christian Komusiewicz, Berthold Blatt Lorke, Jannik Schestag
2023 J jnl
A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem.
CoRR
Christian Komusiewicz, Jannik Schestag
2023 B conf
Finding Degree-Constrained Acyclic Orientations.
IPEC
Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller
2023 B conf
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks.
IPEC
Mark Jones, Jannik Schestag
2023 B conf
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model.
IPEC
Matthias Bentert, Jannik Schestag, Frank Sommer
2023 J jnl
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model.
CoRR
Matthias Bentert, Jannik Schestag, Frank Sommer
2023 B conf
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem.
CPM
Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag
2022 C conf
On Critical Node Problems with Vulnerable Vertices.
IWOCA
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2021 J jnl
Destroying Bicolored P
Discret. Math. Theor. Comput. Sci.
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
2019 C conf
Destroying Bicolored P
CiE
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
2019 J jnl
Destroying Bicolored P
CoRR
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer