scientific article; zbMATH DE number 7075874

zbMath1409.68350MaRDI QIDQ4967170

Falk Hüffner, Christian Komusiewicz, Laurent Bulteau, Rolf Niedermeier

Publication date: 3 July 2019

Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/310/292

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (18)

Computing equality-free and repetitive string factorisations ⋮ Computing Equality-Free String Factorisations ⋮ Parameterized complexity of superstring problems ⋮ Finding Consensus Strings with Small Length Difference Between Input and Solution Strings ⋮ The complexity of binary matrix completion under diameter constraints ⋮ Exact algorithms for the repetition-bounded longest common subsequence problem ⋮ Unnamed Item ⋮ Combinatorial \(n\)-fold integer programming and applications ⋮ Tight Hardness Results for Consensus Problems on Circular Strings and Time Series ⋮ The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps ⋮ Separating sets of strings by finding matching patterns is almost always hard ⋮ On the kernelization complexity of string problems ⋮ String factorisations with maximum or minimum dimension ⋮ Closest substring problems for regular languages ⋮ Unnamed Item ⋮ Consensus strings with small maximum distance and small distance sum ⋮ Kernelization of Whitney Switches ⋮ Kernelization of Whitney Switches

This page was built for publication: