| 2026 | CPM | The Communication Complexity of Pattern Matching with Edits Revisited. | Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz |
| 2026 | SODA | The Parameterised Complexity of Counting Small Sub-Hypergraphs. | Marco Bressan, Julian Christoph Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz |
| 2025 | FOCS | Pattern Matching under Weighted Edit Distance. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz |
| 2025 | SODA | From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. | Simon Dring, Dniel Marx, Philip Wellnitz |
| 2025 | SODA | Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. | Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz |
| 2025 | STACS | Residue Domination in Bounded-Treewidth Graphs. | Jakob Greilhuber, Philipp Schepper, Philip Wellnitz |
| 2024 | STOC | Counting Small Induced Subgraphs with Edge-Monotone Properties. | Simon Dring, Dniel Marx, Philip Wellnitz |
| 2024 | STOC | On the Communication Complexity of Approximate Pattern Matching. | Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz |
| 2023 | FOCS | Optimal Algorithms for Bounded Weighted Edit Distance. | Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz |
| 2023 | SODA | Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. | Jacob Focke, Dniel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz |
| 2022 | FOCS | 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 |
| 2021 | ICALP | 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 |
| 2021 | SODA | On Near-Linear-Time Algorithms for Dense Subset Sum. | Karl Bringmann, Philip Wellnitz |
| 2020 | FOCS | Faster Approximate Pattern Matching: A Unified Approach. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz |
| 2020 | FOCS | Counting Small Induced Subgraphs Satisfying Monotone Properties. | Marc Roth, Johannes Schmitt, Philip Wellnitz |
| 2020 | ICALP | Faster Minimization of Tardy Processing Time on a Single Machine. | Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz |
| 2020 | SODA | Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. | Marc Roth, Philip Wellnitz |
| 2019 | ICALP | Counting Answers to Existential Questions. | Holger Dell, Marc Roth, Philip Wellnitz |
| 2019 | MFCS | Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. | Julian Drfler, Marc Roth, Johannes Schmitt, Philip Wellnitz |
| 2019 | SODA | Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. | Karl Bringmann, Marvin Knnemann, Philip Wellnitz |
| 2017 | CPM | Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. | Karl Bringmann, Philip Wellnitz |