Showing results 2 to 13 of 13
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 |
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 |
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k Kanté, Mamadou Moustapha; Kim, Eun Jung; Kwon, O-joung; Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.160, pp.15 - 35, 2023-05 |
Rank-width and tree-width of H-minor-free graphs Fomin, FV; Oum, Sang-il; Thilikos, DM, EUROPEAN JOURNAL OF COMBINATORICS, v.31, no.7, pp.1617 - 1628, 2010-10 |
Rank-width and vertex-minors Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.95, no.1, pp.79 - 100, 2005-09 |
Rank-width and well-quasi-ordering Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.22, no.2, pp.666 - 682, 2008 |
Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices Oum, Sang-il, LINEAR ALGEBRA AND ITS APPLICATIONS, v.436, no.7, pp.2008 - 2036, 2012-04 |
Rank-width of random graphs Lee, Choongbum; Lee, Joonkyung; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.70, no.3, pp.339 - 347, 2012-07 |
Rank-width: algorithmic and structural results Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.231, pp.15 - 24, 2017-11 |
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il, IEEE TRANSACTIONS ON INFORMATION THEORY, v.63, no.11, pp.7178 - 7205, 2017-11 |
Vertex-minors, monadic second-order logic, and a conjecture by Seese Courcelle, B; Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.97, no.1, pp.91 - 126, 2007-01 |
Width parameters beyond tree-width and their applications Hlineny, P; Oum, Sang-il; Seese, D; Gottlob, G, COMPUTER JOURNAL, v.51, no.3, pp.326 - 362, 2008-05 |
Discover