Philipp Schepper

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Hitting meets packing: how hard can it be?	2026-05-26	Paper
Degrees and gaps: tight complexity results of general factor problems parameterized by treewidth and cutwidth	2026-05-12	Paper
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results ACM Transactions on Algorithms	2025-10-01	Paper
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results ACM Transactions on Computation Theory	2025-08-01	Paper
Anti-factor is FPT parameterized by treewidth and list size (but counting is hard)	2025-06-23	Paper
Domination and cut problems on chordal graphs with bounded leafage	2025-06-23	Paper
Computing generalized convolutions faster than brute force	2025-06-23	Paper
AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) Algorithmica	2025-01-24	Paper
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs	2024-05-14	Paper
Domination and Cut Problems on Chordal Graphs with Bounded Leafage Algorithmica	2024-04-24	Paper
Computing generalized convolutions faster than brute force Algorithmica	2024-01-09	Paper
Parameterized complexity of multicut in weighted trees Theoretical Computer Science	2023-10-12	Paper
Parameterized complexity of weighted multicut in trees Graph-Theoretic Concepts in Computer Science	2023-05-05	Paper
scientific article; zbMATH DE number 7651219 (Why is no real title available?) (available as arXiv preprint)	2023-02-07	Paper

Research outcomes over time

This page was built for person: Philipp Schepper