47 citations · 678 across the 85 of their papers we have counts for
4 papers · 1 filter
Multiway -Cut is fixed-parameter tractable
Tony Huynh, Eun Jung Kim, Sang-il Oum +2
A connectivity function on a finite set is a function that is submodular and symmetric, with . Given a connectivity function via…
Finding branch-decompositions of matroids, hypergraphs, and more
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Given subspaces of a finite-dimensional vector space over a fixed finite field , we wish to find a "branch-decomposition" of these subspaces of width at most tha…
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
Robert Brignall, Hojin Choi, Jisu Jeong +1
A homogeneous set of a graph is a set of vertices such that and no vertex in has both a neighbor and a non-neighbor in …
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…