activity
20202023
most citedLongest Common Subsequence with Gap Constraints

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing cs.DSShow all

3 papers · 1 filter

cs.DS2023★ 1 cited

Longest Common Subsequence with Gap Constraints

Duncan Adamson, Maria Kosche, Tore Koß +2

We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the d…

cs.DS2021

Robust Online Algorithms for Dynamic Choosing Problems

Sebastian Berndt, Kilian Grage, Klaus Jansen +2

Semi-online algorithms that are allowed to perform a bounded amount of repacking achieve guaranteed good worst-case behaviour in a more realistic setting. Most of the previous work…

cs.DS2020

The Edit Distance to -Subsequence Universality

Pamela Fleischmann, Maria Kosche, Tore Koß +2

A word is a subsequence of another word if can be obtained from by deleting some of its letters. The word with alph is called -subsequence universal i…