default search action
Jannik Schestag
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
On Critical Node Problems with Vulnerable Vertices. J. Graph Algorithms Appl. 28(1): 1-26 (2024) - [c8]Jaroslav Garvardt
, Christian Komusiewicz
Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis. ADT 2024: 82-97 - [c7]Christian Komusiewicz, Jannik Schestag:
Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study. FSTTCS 2024: 28:1-28:18 - [i6]Mark Jones, Jannik Schestag:
Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead. CoRR abs/2403.14217 (2024) - [i5]Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller:
Maximizing Network Phylogenetic Diversity. CoRR abs/2405.01091 (2024) - [i4]Christian Komusiewicz, Jannik Schestag:
Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study. CoRR abs/2405.17314 (2024) - 2023
- [c6]Christian Komusiewicz, Simone Linz
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM 2023: 18:1-18:18 - [c5]Matthias Bentert, Jannik Schestag, Frank Sommer:
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC 2023: 4:1-4:12 - [c4]Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller:
Finding Degree-Constrained Acyclic Orientations. IPEC 2023: 19:1-19:14 - [c3]Mark Jones, Jannik Schestag:
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks. IPEC 2023: 30:1-30:12 - [i3]Christian Komusiewicz, Jannik Schestag:
A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem. CoRR abs/2307.03518 (2023) - [i2]Matthias Bentert, Jannik Schestag, Frank Sommer:
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model. CoRR abs/2308.04575 (2023) - 2022
- [c2]Jannik Schestag, Niels Grüttemeier
On Critical Node Problems with Vulnerable Vertices. IWOCA 2022: 494-508 - 2021
- [j1]Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. Discret. Math. Theor. Comput. Sci. 23(1) (2021)
2010 – 2019
- 2019
- [c1]Niels Grüttemeier, Christian Komusiewicz
Destroying Bicolored P3s by Deleting Few Edges. CiE 2019: 193-204 - [i1]Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. CoRR abs/1901.03627 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: