Results 1-4 of 4 (Search time: 0.005 seconds).
NO | Title, Author(s) (Publication Title, Volume Issue, Page, Issue Date) |
---|---|
Faster algorithms for vertex partitioning problems parameterized by clique-width Oum, Sang-il; Saether, Sigve Hortemo; Vatshelle, Martin, THEORETICAL COMPUTER SCIENCE, v.535, pp.16 - 24, 2014-05 | |
Excluded vertex-minors for graphs of linear rank-width at most k Jeong, Jisu; Kwon, O-Joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.41, pp.242 - 257, 2014-10 | |
Unavoidable vertex-minors in large prime graphs Kwon, O-Joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.41, pp.100 - 127, 2014-10 | |
Rank-width: algorithmic and structural results Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.231, pp.15 - 24, 2017-11 |
Discover