Philip Wellnitz
Orcid: 0000-0002-6482-8478Affiliations:
- 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:
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 OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
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
SIAM J. Comput., 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
2023
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
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
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
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
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
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
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2017
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017