Philipp Schepper

According to our database, Philipp Schepper authored at least 13 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results.

Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz

ACM Trans. Algorithms, July, 2025

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results.

Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz

ACM Trans. Comput. Theory, June, 2025

Residue Domination in Bounded-Treewidth Graphs.

Jakob Greilhuber, Philipp Schepper, Philip Wellnitz

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

Hitting Meets Packing: How Hard Can It Be?

Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Parameterized complexity of multicut in weighted trees.

Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Theor. Comput. Sci., November, 2023

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

Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Subcubic certificates for CFL reachability.

Dmitry Chistikov, Rupak Majumdar, Philipp Schepper

Proc. ACM Program. Lang., 2022

Parameterized Complexity of Weighted Multicut in Trees.

Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard).

Dániel Marx, Govind S. Sankar, Philipp Schepper

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Domination and Cut Problems on Chordal Graphs with Bounded Leafage.

Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Computing Generalized Convolutions Faster Than Brute Force.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

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

Dániel Marx, Govind S. Sankar, Philipp Schepper

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Fine-Grained Complexity of Regular Expression Pattern Matching and Membership.

Philipp Schepper

Proceedings of the 28th Annual European Symposium on Algorithms, 2020