11 citations · 19 across the 15 of their papers we have counts for
4 papers · 1 filter
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
Approximate Pattern Matching is among the most fundamental string-processing tasks. Given a text of length , a pattern of length , and a threshold , the task is to…
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
Simon Döring, Dániel Marx, Philip Wellnitz
A graph property is a function that maps every graph to {0, 1} and is invariant under isomorphism. In the problem, given a graph and an integer , the task…
On the Communication Complexity of Approximate Pattern Matching
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
The decades-old Pattern Matching with Edits problem, given a length- string (the text), a length- string (the pattern), and a positive integer (the threshold), as…
Residue Domination in Bounded-Treewidth Graphs
Jakob Greilhuber, Philipp Schepper, Philip Wellnitz
For the vertex selection problem -DomSet one is given two fixed sets and of integers and the task is to decide whether we can select vertices of the input graph such…