30 citations · 100 across the 41 of their papers we have counts for
3 papers · 1 filter
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz +1
Motivated by the study of genome rearrangements, the NP-hard Minimum Common String Partition problems asks, given two strings, to split both strings into an identical set of blocks…
On Structural Parameterizations for the 2-Club Problem
Sepp Hartung, Christian Komusiewicz, André Nichterlein +1
The NP-hard 2-Club problem is, given an undirected graph G=(V,E) and l\in N, to decide whether there is a vertex set S\subseteq V of size at least l such that the induced subgraph…
Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable
Laurent Bulteau, Christian Komusiewicz
The NP-hard Minimum Common String Partition problem asks whether two strings and can each be partitioned into at most substrings, called blocks, such that both partitio…