Philip Wellnitz

According to our database, Philip Wellnitz authored at least 21 papers between 2017 and 2024.

Collaborative distances:

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

2024

On the Communication Complexity of Approximate Pattern Matching.

Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz

CoRR, 2024

Shining Light on Periodic Dominating Sets in Bounded-Treewidth Graphs.

Jakob Greilhuber, Philipp Schepper, Philip Wellnitz

CoRR, 2024

2023

Parameterized Counting and Cayley Graph Expanders.

Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina, Philip Wellnitz

SIAM J. Discret. Math., June, 2023

Counting Small Induced Subgraphs with Edge-monotone Properties.

Simon Döring, Dániel Marx, Philip Wellnitz

CoRR, 2023

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

CoRR, 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

Optimal Algorithms for Bounded Weighted Edit Distance.

Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

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

CoRR, 2022

Faster Pattern Matching under Edit Distance.

Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz

CoRR, 2022

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness.

Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz

Algorithmica, 2022

Faster Minimization of Tardy Processing Time on a Single Machine.

Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz

Algorithmica, 2022

Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices.

Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Counting Patterns in Strings and Graphs.

Philip Wellnitz

PhD thesis, 2021

On Near-Linear-Time Algorithms for Dense Subset Sum.

Karl Bringmann, Philip Wellnitz

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

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders.

Marc Roth, Johannes Schmitt, Philip Wellnitz

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

2020

Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory.

Marc Roth, Philip Wellnitz

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

Counting Small Induced Subgraphs Satisfying Monotone Properties.

Marc Roth, Johannes Schmitt, Philip Wellnitz

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Faster Approximate Pattern Matching: A Unified Approach.

Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts.

Karl Bringmann, Marvin Künnemann, Philip Wellnitz

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Counting Answers to Existential Questions.

Holger Dell, Marc Roth, Philip Wellnitz

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2017

Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars.

Karl Bringmann, Philip Wellnitz

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017