Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. - Karl Bringmann; Philip Wellnitz (CPM, 2017)

Counting Answers to Existential Questions. - Holger Dell; Marc Roth; Philip Wellnitz (ICALP, 2019)

Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. - Karl Bringmann; Marvin Künnemann; Philip Wellnitz (SODA, 2019)

Faster Approximate Pattern Matching: A Unified Approach. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Philip Wellnitz (FOCS, 2020)

Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. - Marc Roth; Philip Wellnitz (SODA, 2020)

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. - Marc Roth; Johannes Schmitt 002; Philip Wellnitz (ICALP, 2021)

On Near-Linear-Time Algorithms for Dense Subset Sum. - Karl Bringmann; Philip Wellnitz (SODA, 2021)

Counting Patterns in Strings and Graphs. - Philip Wellnitz (2021)

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 (FOCS, 2022)

Faster Minimization of Tardy Processing Time on a Single Machine. - Karl Bringmann; Nick Fischer; Danny Hermelin; Dvir Shabtay; Philip Wellnitz (Algorithmica, 2022)

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. - Julian Dörfler; Marc Roth; Johannes Schmitt 002; Philip Wellnitz (Algorithmica, 2022)

Faster Pattern Matching under Edit Distance. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Philip Wellnitz (CoRR, 2022)

Optimal Algorithms for Bounded Weighted Edit Distance. - Alejandro Cassis; Tomasz Kociumaka; Philip Wellnitz (FOCS, 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 (SODA, 2023)

Parameterized Counting and Cayley Graph Expanders. - Norbert Peyerimhoff; Marc Roth; Johannes Schmitt 002; Jakob Stix; Alina Vdovina; Philip Wellnitz (SIAM J. Discret. Math., 2023)

Counting Small Induced Subgraphs with Edge-Monotone Properties. - Simon Döring; Dániel Marx; Philip Wellnitz (STOC, 2024)

On the Communication Complexity of Approximate Pattern Matching. - Tomasz Kociumaka; Jakob Nogler; Philip Wellnitz (STOC, 2024)

Counting Small Induced Subgraphs Satisfying Monotone Properties. - Marc Roth; Johannes Schmitt 002; Philip Wellnitz (SIAM J. Comput., 2024)

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. - Simon Döring; Dániel Marx; Philip Wellnitz (SODA, 2025)

Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. - Tomasz Kociumaka; Jakob Nogler; Philip Wellnitz (SODA, 2025)

Residue Domination in Bounded-Treewidth Graphs. - Jakob Greilhuber; Philipp Schepper; Philip Wellnitz (STACS, 2025)

The Complexity of Counting Small Sub-Hypergraphs. - Marco Bressan 002; Julian Brinkmann; Holger Dell; Marc Roth; Philip Wellnitz (CoRR, 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, 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, 2025)