21 citations · 31 across the 6 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013★ 21 cited
Faster Algorithms For Vertex Partitioning Problems Parameterized by Clique-width
Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width given with a -expression, Dominating Set can be solved in $4…
cs.DM2010★ 1 cited
On graph classes with logarithmic boolean-width
Rémy Belmonte, Martin Vatshelle
Boolean-width is a recently introduced graph parameter. Many problems are fixed parameter tractable when parametrized by boolean-width, for instance "Minimum Weighted Dominating Se…