Parameterized Complexity Analysis for the Closest String with Wildcards Problem

Dan Hermelin, Liat Rozenberg

Research output: Chapter in Book/Report/Conference proceedingEntry for encyclopedia/dictionarypeer-review

3 Scopus citations

Fingerprint

Dive into the research topics of 'Parameterized Complexity Analysis for the Closest String with Wildcards Problem'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science