Showing results 1 to 7 of 7
Branch-depth: Generalizing tree-depth of graphs DeVos, Matt; Kwon, O-joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.90, 2020-12 |
Characterizing matroids whose bases form graphic delta-matroids Lee, Duksang; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.101, 2022-03 |
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors Choi, Ilkyoo; Kwon, O-Joung; Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.123, pp.126 - 147, 2017-03 |
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 |
Prime vertex-minors of a prime graph Kim, Donggyu; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.118, 2024-05 |
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 |
Discover