Philip Wellnitz
Scholar

Philip Wellnitz

Google Scholar ID: jcJbxHsAAAAJ
National Institute of Informatics and The Graduate University for Advanced Studies, SOKENDAI
AlgorithmsLower Bounds
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
353
 
H-index
12
 
i10-index
13
 
Publications
20
 
Co-authors
20
list available
Contact
No contact links provided.
Publications
6 items
The Communication Complexity of Pattern Matching with Edits Revisited
2026
Cited
0
Pattern Matching under Weighted Edit Distance
2025
Cited
0
The Complexity of Finding and Counting Subtournaments
2025
Cited
0
The Complexity of Counting Small Sub-Hypergraphs
2025
Cited
0
Residue Domination in Bounded-Treewidth Graphs
Symposium on Theoretical Aspects of Computer Science · 2024
Cited
1
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
ACM-SIAM Symposium on Discrete Algorithms · 2022
Cited
11
Resume (English only)
Co-authors
20 total
Marc Roth
Marc Roth
School of Electronic Engineering and Computer Science, Queen Mary University of London
Tomasz Kociumaka
Tomasz Kociumaka
Max Planck Institute for Informatics, Saarland Informatics Campus
Karl Bringmann
Karl Bringmann
Professor in Computer Science, Saarland University
Dániel Marx
Dániel Marx
CISPA Helmholtz Center for Information Security
Johannes Schmitt
Johannes Schmitt
Postdoc in Mathematics, ETH Zurich
Panagiotis Charalampopoulos
Panagiotis Charalampopoulos
King's College London
Co-author 7
Co-author 7
Daniel Neuen
Daniel Neuen
Max-Planck-Institute for Informatics