Seuraa
Jannik Theodor Schestag
Jannik Theodor Schestag
Muut nimetJannik Schestag
Ph.D. Student at Friedricht-Schiller-Universität Jena, Germany
Vahvistettu sähköpostiosoite verkkotunnuksessa uni-jena.de
Nimike
Viittaukset
Viittaukset
Vuosi
Destroying Bicolored s by Deleting Few Edges
N Grüttemeier, C Komusiewicz, JT Schestag, F Sommer
Discrete Mathematics & Theoretical Computer Science 23, 2021
42021
A Multivariate Complexity Analysis of the Generalized Noah’s Ark Problem
C Komusiewicz, JT Schestag
Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 109-121, 2023
22023
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem
C Komusiewicz, S Linz, N Morawietz, JT Schestag
34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), 2023
22023
On Critical Node Problems with Vulnerable Vertices
JT Schestag, N Grüttemeier, C Komusiewicz, F Sommer
Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier …, 2022
22022
Liechtenstein-P3s in two-colored graphs
JT Schestag
Bachelorarbeit, Philipps-Universität Marburg, 2019
22019
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
M Bentert, JT Schestag, F Sommer
arXiv preprint arXiv:2308.04575, 2023
12023
Finding Degree-Constrained Acyclic Orientations
J Garvardt, M Renken, JT Schestag, M Weller
18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 2023
12023
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks
M Jones, JT Schestag
18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 2023
12023
Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead
M Jones, JT Schestag
arXiv preprint arXiv:2403.14217, 2024
2024
Critical Node Problem with Vulnerable Nodes
JT Schestag
https://www.uni-marburg.de/de/fb12/arbeitsgruppen/algorith/forschung …, 2021
2021
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–10