13 citations · 59 across the 31 of their papers we have counts for
3 papers · 1 filter
On the Average-case Complexity of Parameterized Clique
Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin
The k-Clique problem is a fundamental combinatorial problem that plays a prominent role in classical as well as in parameterized complexity theory. It is among the most well-known…
Parameterized Complexity Dichotomy for Steiner Multicut
Karl Bringmann, Danny Hermelin, Matthias Mnich +1
The Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt V(G) of size at most p, and an integer k, whether there is a set S of at most k…
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths
Danny Hermelin, Gad M. Landau, Yuri Rabinovich +1
In binary jumbled pattern matching we wish to preprocess a binary string in order to answer queries which ask for a substring of that is of size and has exactly…