Scholar
Philip Wellnitz
Google Scholar ID: jcJbxHsAAAAJ
National Institute of Informatics and The Graduate University for Advanced Studies, SOKENDAI
Citations & Impact
Citations
345
H-index
12
i10-index
13
Publications
20
Co-authors
20
list available
Publications
Resume (English only)
Academic Achievements
- Selected publications: 'Optimal Algorithms for Bounded Weighted Edit Distance', 'Faster Pattern Matching under Edit Distance', 'Counting Small Induced Subgraphs with Edge-monotone Properties', 'Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory'. Editorial activities and program committee work, including being a member of the Editorial Board of Mathematics In Computer Science and serving on the Program Committees of ICALP (A) 2026, MFCS 2025, CPM 2025, ESA (A) 2022.
Research Experience
- Assistant Professor at the National Institute of Informatics, Tokyo, Japan since April 2024. Post-doctoral researcher at the Max Planck Institute for Informatics, Saarbruecken, Germany from October 2021 to March 2024. Taught courses at Saarland University, including Algorithms and Data Structures, Techniques for Counting Problems, and Randomized Algorithms and Probabilistic Analysis of Algorithms.
Background
- Research interests include obtaining (provably) best-possible algorithms by designing faster algorithms and matching (conditional) lower bounds; (approximate) string matching and in general algorithms on strings; counting problems, also in parameterized settings (especially problems related to graph homomorphisms). Supports DEI.
Miscellany
- Developed tikz-kneser library for drawing Kneser graphs; SOSML interpreter that runs SML code in your browser.
