The edit distance of two strings is the minimum number of insertions,
de...
We revisit the classic 0-1-Knapsack problem, in which we are given n ite...
In this work we revisit the fundamental Single-Source Shortest Paths (SS...
We present new exact and approximation algorithms for 0-1-Knapsack and
U...
We study the problem of approximating the edit distance of two strings i...
We initiate the systematic study of a recently introduced polynomial-tim...
We revisit the task of computing the edit distance in sublinear time. In...
We initiate the study of fine-grained completeness theorems for exact an...