Browse by Subject VERTEX-MINORS

Showing results 1 to 10 of 10

1
Approximating Rank-Width and Clique-Width Quickly

Oum, Sang-il, ACM TRANSACTIONS ON ALGORITHMS , v.5, no.1, pp.1 - 20, 2008-11

2
Finding branch-decompositions and rank-decompositions

Hlineny, P; Oum, Sang-il, SIAM JOURNAL ON COMPUTING, v.38, no.3, pp.1012 - 1032, 2008

3
Graphs of bounded depth-2 rank-brittleness

Kwon, O-joung; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.96, no.3, pp.361 - 378, 2021-03

4
Obstructions for bounded shrub-depth and rank-depth

Kwon, O-joung; McCarty, Rose; Oum, Sang-il; Wollan, Paul, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.149, pp.76 - 91, 2021-07

5
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

6
Rank-width and well-quasi-ordering

Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.22, no.2, pp.666 - 682, 2008

7
Rank-width: algorithmic and structural results

Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.231, pp.15 - 24, 2017-11

8
Scattered Classes of Graphs

Kwon, O-joung; Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.34, no.1, pp.972 - 999, 2020-01

9
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

10
The Erdos-Hajnal property for graphs with no fixed cycle as a pivot-minor

Kim, Jaehoon; Oum, Sang-il, ELECTRONIC JOURNAL OF COMBINATORICS, v.28, no.2, pp.1 - 16, 2021-04

rss_1.0 rss_2.0 atom_1.0