Følg
Philip Wellnitz
Philip Wellnitz
National Institute of Informatics and The Graduate University for Advanced Studies, SOKENDAI
Verifisert e-postadresse på nii.ac.jp - Startside
Tittel
Sitert av
Sitert av
År
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
522020
On Near-Linear-Time Algorithms for Dense Subset Sum
K Bringmann, P Wellnitz
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
332021
Counting Answers to Existential Questions
H Dell, M Roth, P Wellnitz
46th International Colloquium on Automata, Languages and Programming, Track …, 2019
332019
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
212022
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
202020
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
18*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
182019
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
162022
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
152022
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars
K Bringmann, P Wellnitz
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
152017
Counting Small Induced Subgraphs Satisfying Monotone Properties
M Roth, J Schmitt, P Wellnitz
SIAM Journal on Computing, FOCS20-139-FOCS20-174, 2022
142022
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
14*2021
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
62023
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
52024
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
32024
Residue Domination in Bounded-Treewidth Graphs
J Greilhuber, P Schepper, P Wellnitz
42nd International Symposium on Theoretical Aspects of Computer Science …, 2025
1*2025
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
S Döring, D Marx, P Wellnitz
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
12025
Counting Patterns in Strings and Graphs
P Wellnitz
Saarländische Universitäts-und Landesbibliothek, 2021
12021
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching
T Kociumaka, J Nogler, P Wellnitz
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
2025
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–19