Send email Copy Email Address
PhD Student

Philipp Schepper

Email

Address

Kaiserstraße 21
66386 St. Ingbert (Germany)

Member of Groups

Publications by Philipp Schepper

Year 2024

2024-01

Computing Generalized Convolutions Faster Than Brute Force

Article

Algorithmica: an international journal in computer science

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page

Year 2023

2023-12-29

Domination and Cut Problems on Chordal Graphs with Bounded Leafage

Article

Algorithmica

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2023-11

Parameterized complexity of multicut in weighted trees

Article

Theoretical Computer Science

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2023

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs

Conference / Medium

ACM-SIAM Symposium on Discrete Algorithms (SODA)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page

Year 2022

2022-12

Computing Generalized Convolutions Faster Than Brute Force

Conference / Medium

International Symposium on Parameterized and Exact Computation (IPEC)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2022-12

Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)

Conference / Medium

International Symposium on Parameterized and Exact Computation (IPEC)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2022-12

Domination and Cut Problems on Chordal Graphs with Bounded Leafage

Conference / Medium

International Symposium on Parameterized and Exact Computation (IPEC)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2022-10

Parameterized Complexity of Weighted Multicut in Trees

Conference / Medium

International Workshop on Graph-Theoretic Concepts in Computer Science (WG)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2022-01-22

Subcubic certificates for CFL reachability

Conference / Medium

Symposium on Principles of Programming Languages (POPL)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page

Year 2021

2021-07-02

Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth

Conference / Medium

International Colloquium on Automata, Languages and Programming (ICALP)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page