| Faster Approximate Pattern Matching: A Unified Approach P Charalampopoulos, T Kociumaka, P Wellnitz 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020 | 45 | 2020 |
| Counting Answers to Existential Questions H Dell, M Roth, P Wellnitz 46th International Colloquium on Automata, Languages and Programming, Track …, 2019 | 30 | 2019 |
| On Near-Linear-Time Algorithms for Dense Subset Sum K Bringmann, P Wellnitz Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021 | 27 | 2021 |
| Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness J Dörfler, M Roth, J Schmitt, P Wellnitz Algorithmica 84 (2), 379-404, 2022 | 20 | 2022 |
| Faster Minimization of Tardy Processing Time on a Single Machine K Bringmann, N Fischer, D Hermelin, D Shabtay, P Wellnitz Algorithmica 84 (5), 1341-1356, 2022 | 16 | 2022 |
| Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory M Roth, P Wellnitz Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2161-2180, 2020 | 16 | 2020 |
| Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars K Bringmann, P Wellnitz 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017 | 16 | 2017 |
| Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-treewidth Graphs J Focke, D Marx, F Mc Inerney, D Neuen, GS Sankar, P Schepper, ... Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 14 | 2023 |
| Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts K Bringmann, M Künnemann, P Wellnitz Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 14 | 2019 |
| Faster Pattern Matching under Edit Distance: a Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices P Charalampopoulos, T Kociumaka, P Wellnitz 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 13* | 2022 |
| Counting Small Induced Subgraphs Satisfying Monotone Properties M Roth, J Schmitt, P Wellnitz SIAM Journal on Computing, FOCS20-139-FOCS20-174, 2022 | 13 | 2022 |
| Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders M Roth, J Schmitt, P Wellnitz 48th International Colloquium on Automata, Languages and Programming, Track …, 2021 | 10 | 2021 |
| Counting Small Induced Subgraphs with Edge-monotone Properties S Döring, D Marx, P Wellnitz Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1517-1525, 2024 | 4 | 2024 |
| Optimal Algorithms for Bounded Weighted Edit Distance A Cassis, T Kociumaka, P Wellnitz 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 4 | 2023 |
| Parameterized counting and Cayley graph expanders N Peyerimhoff, M Roth, J Schmitt, J Stix, A Vdovina, P Wellnitz SIAM Journal on Discrete Mathematics 37 (2), 405-486, 2023 | 3 | 2023 |
| From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs S Döring, D Marx, P Wellnitz arXiv preprint arXiv:2407.06801, 2024 | 1 | 2024 |
| Counting Patterns in Strings and Graphs P Wellnitz Saarländische Universitäts-und Landesbibliothek, 2021 | 1 | 2021 |
| On the Communication Complexity of Approximate Pattern Matching T Kociumaka, J Nogler, P Wellnitz Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1758-1768, 2024 | | 2024 |
| Shining Light on Periodic Dominating Sets in Bounded-Treewidth Graphs J Greilhuber, P Schepper, P Wellnitz arXiv preprint arXiv:2403.07524, 2024 | | 2024 |
Marc RothSchool of Electronic Engineering and Computer Science, Queen Mary University of LondonVerified email at qmul.ac.uk
