default search action
Philipp Schepper
Person information
- affiliation: CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j7]Dániel Marx
, Govind S. Sankar
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). Algorithmica 87(1): 22-88 (2025) - [j6]Jacob Focke
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. ACM Trans. Algorithms 21(3): 27:1-27:45 (2025) - [j5]Jacob Focke
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. ACM Trans. Comput. Theory 17(2): 10:1-10:101 (2025) - [c9]Jakob Greilhuber
Residue Domination in Bounded-Treewidth Graphs. STACS 2025: 41:1-41:20 - 2024
- [j4]Baris Can Esmer
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86(1): 334-366 (2024) - [j3]Esther Galby, Dániel Marx
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica 86(5): 1428-1474 (2024) - [c8]Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx
Hitting Meets Packing: How Hard Can It Be? ESA 2024: 55:1-55:21 - [i11]Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx
Hitting Meets Packing: How Hard Can it Be? CoRR abs/2402.14927 (2024) - [i10]Jakob Greilhuber, Philipp Schepper, Philip Wellnitz:
Residue Domination in Bounded-Treewidth Graphs. CoRR abs/2403.07524 (2024) - 2023
- [j2]Esther Galby, Dániel Marx
Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978: 114174 (2023) - [c7]Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA 2023: 3664-3683 - [i9]Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR abs/2306.03640 (2023) - 2022
- [j1]Dmitry Chistikov, Rupak Majumdar
Subcubic certificates for CFL reachability. Proc. ACM Program. Lang. 6(POPL): 1-29 (2022) - [c6]Baris Can Esmer, Ariel Kulik, Dániel Marx
Computing Generalized Convolutions Faster Than Brute Force. IPEC 2022: 12:1-12:22 - [c5]Esther Galby
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC 2022: 14:1-14:24 - [c4]Dániel Marx
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). IPEC 2022: 22:1-22:23 - [c3]Esther Galby
Parameterized Complexity of Weighted Multicut in Trees. WG 2022: 257-270 - [i8]Esther Galby
Parameterized Complexity of Weighted Multicut in Trees. CoRR abs/2205.10105 (2022) - [i7]Esther Galby
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR abs/2208.02850 (2022) - [i6]Baris Can Esmer, Ariel Kulik, Dániel Marx
Computing Generalized Convolutions Faster Than Brute Force. CoRR abs/2209.01623 (2022) - [i5]Jacob Focke, Dániel Marx
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results. CoRR abs/2211.04278 (2022) - 2021
- [c2]Dániel Marx
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. ICALP 2021: 95:1-95:20 - [i4]Dmitry Chistikov, Rupak Majumdar, Philipp Schepper
Subcubic Certificates for CFL Reachability. CoRR abs/2102.13095 (2021) - [i3]Dániel Marx, Govind S. Sankar, Philipp Schepper
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. CoRR abs/2105.08980 (2021) - [i2]Dániel Marx, Govind S. Sankar, Philipp Schepper
Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). CoRR abs/2110.09369 (2021) - 2020
- [c1]Philipp Schepper
Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. ESA 2020: 80:1-80:20 - [i1]Philipp Schepper
Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. CoRR abs/2008.02769 (2020)
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 2025-09-12 23:10 CEST 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: