Philipp Schepper

27 papers A* 2A 3B 4Journal 18

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). Algorithmica Dániel Marx, Govind S. Sankar, Philipp Schepper
2025	A	`conf`	Residue Domination in Bounded-Treewidth Graphs. STACS Jakob Greilhuber, Philipp Schepper, Philip Wellnitz
2025	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. ACM Trans. Algorithms Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2025	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. ACM Trans. Comput. Theory Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2024	J	`jnl`	Computing Generalized Convolutions Faster Than Brute Force. Algorithmica Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2024	J	`jnl`	Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2024	A	`conf`	Hitting Meets Packing: How Hard Can It Be? ESA Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
2024	J	`jnl`	Hitting Meets Packing: How Hard Can it Be? CoRR Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
2024	J	`jnl`	Residue Domination in Bounded-Treewidth Graphs. CoRR Jakob Greilhuber, Philipp Schepper, Philip Wellnitz
2023	J	`jnl`	Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2023	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2023	A*	`conf`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2022	B	`conf`	Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). IPEC Dániel Marx, Govind S. Sankar, Philipp Schepper
2022	B	`conf`	Computing Generalized Convolutions Faster Than Brute Force. IPEC Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022	J	`jnl`	Computing Generalized Convolutions Faster Than Brute Force. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022	B	`conf`	Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	B	`conf`	Parameterized Complexity of Weighted Multicut in Trees. WG Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Parameterized Complexity of Weighted Multicut in Trees. CoRR Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Subcubic certificates for CFL reachability. Proc. ACM Program. Lang. Dmitry Chistikov, Rupak Majumdar, Philipp Schepper
2022	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results. CoRR Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2021	J	`jnl`	Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). CoRR Dániel Marx, Govind S. Sankar, Philipp Schepper
2021	A*	`conf`	Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. ICALP Dániel Marx, Govind S. Sankar, Philipp Schepper
2021	J	`jnl`	Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. CoRR Dániel Marx, Govind S. Sankar, Philipp Schepper
2021	J	`jnl`	Subcubic Certificates for CFL Reachability. CoRR Dmitry Chistikov, Rupak Majumdar, Philipp Schepper
2020	A	`conf`	Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. ESA Philipp Schepper
2020	J	`jnl`	Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. CoRR Philipp Schepper