max planck institut
mpii logo Minerva of the Max Planck Society


Philip Wellnitz

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


Currently, I'm a PhD student at the Max Planck Institute for Informatics, my advisor is Karl Bringmann. I am interested in designing (faster) algorithms and matching conditional lower bounds for problems that are solvable in polynomial time, and those that are (probably) not. In particular, I work on problems in the area of combinatorial pattern matching and on Knapsack-type problems. Further, I am interested in the (parametrized) counting complexity of problems such as counting how often a graph appears in another graph as an (induced) subgraph.



"Counting Answers to Existential Questions"

Holger Dell, Marc Roth, Philip Wellnitz

ICALP'19: Proc. of the 46th International Colloquium on Automata, Languages, and Programming

Full Version


"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



"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




"Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness"

Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz



Short CV