3 citations · 9 across the 9 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2021
Polynomial Turing Kernels for Clique with an Optimal Number of Queries
Till Fluschnik, Klaus Heeger, Danny Hermelin
A polynomial Turing kernel for some parameterized problem is a polynomial-time algorithm that solves using queries to an oracle of whose sizes are upper-bounded by some…
cs.CC2018
On Computing Centroids According to the -Norms of Hamming Distance Vectors
Jiehua Chen, Danny Hermelin, Manuel Sorge
In this paper we consider the -Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the -norm of its Hammin…
cs.CC2009★ 3 cited
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
Danny Hermelin, Gad M. Landau, Shir Landau +1
We present a unified framework for accelerating edit-distance computation between two compressible strings using straight-line programs. For two strings of total length having…