max planck institut
informatik
mpii logo Minerva of the Max Planck Society

Homepage

Philip Wellnitz

Max Planck Institute for Informatics
Department 1: Algorithms and Complexity
Campus E1 4, Room 324
66123, Saarbrücken
Germany

Email: wellnitzmpi-inf.mpg.de

Currently, I'm a Ph.D. student at Max Planck Institute for Informatics, my advisor is Karl Bringmann. I'm interested in Fine-Grained Complexity Theory as well as Parametrized (Counting) Complexity Theory. Furthermore, I study algorithm design, especially for Strings and Grammar Formalisms.


Publications


[C2]

"Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts"

Karl Bringmann, Marvin Künnemann, Philip Wellnitz

SODA'19: Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms

Slides

[C1]

"Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars"

Karl Bringmann, Philip Wellnitz

CPM'17: Proc. of the 28th Annual Symposium on Combinatorial Pattern Matching

Slides

Manuscripts

[M3]

"Counting Answers to Existential Questions"

Holger Dell, Marc Roth, Philip Wellnitz


Code



Teaching



Short CV