Showing results 1 to 5 of 5
Branch-depth: Generalizing tree-depth of graphs![]() DeVos, Matt; Kwon, O-joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.90, 2020-12 |
Finding branch-decompositions and rank-decompositions Hlineny, P; Oum, Sang-il, SIAM JOURNAL ON COMPUTING, v.38, no.3, pp.1012 - 1032, 2008 |
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 |
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 |
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