Jannik Schestag

Orcid: 0000-0001-7767-2970

According to our database1, Jannik Schestag authored at least 11 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Critical Node Problems with Vulnerable Vertices.
J. Graph Algorithms Appl., 2024

Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study.
CoRR, 2024

Maximizing Network Phylogenetic Diversity.
CoRR, 2024

Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead.
CoRR, 2024

Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis.
Proceedings of the Algorithmic Decision Theory - 8th International Conference, 2024

2023
A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem.
CoRR, 2023

Finding Degree-Constrained Acyclic Orientations.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2021
Destroying Bicolored P<sub>3</sub>s by Deleting Few Edges.
Discret. Math. Theor. Comput. Sci., 2021


  Loading...