49 citations · 107 across the 12 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012★ 1 cited
A 9k kernel for nonseparating independent set in planar graphs
Lukasz Kowalik, Marcin Mucha
We study kernelization (a kind of efficient preprocessing) for NP-hard problems on planar graphs. Our main result is a kernel of size at most 9k vertices for the Planar Maximum Non…
cs.DS2012
Lyndon Words and Short Superstrings
Marcin Mucha
In the Shortest-Superstring problem, we are given a set of strings S and want to find a string that contains all strings in S as substrings and has minimum length. This is a classi…