47 citations · 678 across the 85 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013★ 19 cited
Excluded vertex-minors for graphs of linear rank-width at most k
Jisu Jeong, O-joung Kwon, Sang-il Oum
Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each , there is…
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…
math.CO2013★ 10 cited
Unavoidable vertex-minors in large prime graphs
O-joung Kwon, Sang-il Oum
A graph is prime (with respect to the split decomposition) if its vertex set does not admit a partition (A,B) (called a split) with |A|, |B| >= 2 such that the set of edges joining…