Philipp Schepper

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 22

Top Topics

Tight Complexity Bounds

Parameterized Complexity

Top Venues

Proc. ACM Program. Lang.

Publications

Jakob Greilhuber, Philipp Schepper, Philip Wellnitz
Shining Light on Periodic Dominating Sets in Bounded-Treewidth Graphs. CoRR (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86 (1) (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica 86 (5) (2024)
Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
Hitting Meets Packing: How Hard Can it Be? CoRR (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978 (2023)
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)
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 (2023)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR (2022)
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. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. WG (2022)
Dmitry Chistikov, Rupak Majumdar, Philipp Schepper
Subcubic certificates for CFL reachability. Proc. ACM Program. Lang. 6 (POPL) (2022)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). IPEC (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. IPEC (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC (2022)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. ICALP (2021)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. CoRR (2021)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). CoRR (2021)
Dmitry Chistikov, Rupak Majumdar, Philipp Schepper
Subcubic Certificates for CFL Reachability. CoRR (2021)
Philipp Schepper
Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. ESA (2020)
Philipp Schepper
Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. CoRR (2020)