Philip Wellnitz

Orcid: 0000-0002-6482-8478

Affiliations:
  • National Institute of Informatics, Japan
  • Max Planck Institute for Informatics, Germany (former)


According to our database1, Philip Wellnitz authored at least 23 papers between 2017 and 2025.

Collaborative distances:

Timeline

2017
2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
2
2
4
2
2
2
1
2
2
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Counting Small Induced Subgraphs Satisfying Monotone Properties.
SIAM J. Comput., 2024

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

On the Communication Complexity of Approximate Pattern Matching.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Counting Small Induced Subgraphs with Edge-Monotone Properties.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Parameterized Counting and Cayley Graph Expanders.
SIAM J. Discret. Math., June, 2023

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results.
CoRR, 2023

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Optimal Algorithms for Bounded Weighted Edit Distance.
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.
CoRR, 2022

Faster Pattern Matching under Edit Distance.
CoRR, 2022

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

Faster Minimization of Tardy Processing Time on a Single Machine.
Algorithmica, 2022

Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Counting Patterns in Strings and Graphs.
PhD thesis, 2021

On Near-Linear-Time Algorithms for Dense Subset Sum.
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.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Faster Approximate Pattern Matching: A Unified Approach.
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.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Counting Answers to Existential Questions.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2017
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017


  Loading...