Philip Wellnitz

activity

20182026

most citedClique-Based Lower Bounds for Parsing Tree-Adjoining Grammars

11 citations · 19 across the 15 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.CC2022★ 1 cited

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results

Jacob Focke, Dániel Marx, Fionn Mc Inerney +4

We investigate how efficiently a well-studied family of domination-type problems can be solved on bounded-treewidth graphs. For sets $σ, ρ$ of non-negative integers, a $(σ, ρ)$ -set o…

cs.DS2022★ 2 cited

Faster Pattern Matching under Edit Distance

Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz

We consider the approximate pattern matching problem under the edit distance. Given a text $T$ of length $n$ , a pattern $P$ of length $m$ , and a threshold $k$ , the task is to find…