Results 1-4 of 4 (Search time: 0.005 seconds).
NO | Title, Author(s) (Publication Title, Volume Issue, Page, Issue Date) |
---|---|
An FPT 2-Approximation for Tree-Cut Decomposition Kim, Eun Jung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M., ALGORITHMICA, v.80, no.1, pp.116 - 135, 2018-01 | |
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 | |
Finding Branch-Decompositions of Matroids, Hypergraphs, and More Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.35, no.4, pp.2544 - 2617, 2021-11 |
Discover