 | 2009 |
|---|
| 15 |       | Sang-il Oum:
Computing rank-width exactly.
Inf. Process. Lett. 109(13): 745-748 (2009) |
| 14 | | Sang-il Oum:
Excluding a bipartite circle graph from line graphs.
Journal of Graph Theory 60(3): 183-203 (2009) |
| 2008 |
|---|
| 13 | | Sang-il Oum:
Approximating rank-width and clique-width quickly.
ACM Transactions on Algorithms 5(1): (2008) |
| 12 | | Petr Hlinený,
Sang-il Oum,
Detlef Seese,
Georg Gottlob:
Width Parameters Beyond Tree-width and their Applications.
Comput. J. 51(3): 326-362 (2008) |
| 11 | | Sang-il Oum:
Rank-width is less than or equal to branch-width.
Journal of Graph Theory 57(3): 239-244 (2008) |
| 10 | | Petr Hlinený,
Sang-il Oum:
Finding Branch-Decompositions and Rank-Decompositions.
SIAM J. Comput. 38(3): 1012-1032 (2008) |
| 9 | | Sang-il Oum:
Rank-Width and Well-Quasi-Ordering.
SIAM J. Discrete Math. 22(2): 666-682 (2008) |
| 2007 |
|---|
| 8 | | Petr Hlinený,
Sang-il Oum:
Finding Branch-Decompositions and Rank-Decompositions.
ESA 2007: 163-174 |
| 7 | | Bruno Courcelle,
Sang-il Oum:
Vertex-minors, monadic second-order logic, and a conjecture by Seese.
J. Comb. Theory, Ser. B 97(1): 91-126 (2007) |
| 6 | | Sang-il Oum,
Paul D. Seymour:
Testing branch-width.
J. Comb. Theory, Ser. B 97(3): 385-393 (2007) |
| 2006 |
|---|
| 5 | | Sang-il Oum,
Paul D. Seymour:
Certifying large branch-width.
SODA 2006: 810-813 |
| 4 | | Sang-il Oum,
Paul D. Seymour:
Approximating clique-width and branch-width.
J. Comb. Theory, Ser. B 96(4): 514-528 (2006) |
| 2005 |
|---|
| 3 | | Sang-il Oum:
Approximating Rank-Width and Clique-Width Quickly.
WG 2005: 49-58 |
| 2 | | Sang-il Oum:
Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract).
Electronic Notes in Discrete Mathematics 22: 281-285 (2005) |
| 1 | | Sang-il Oum:
Rank-width and vertex-minors.
J. Comb. Theory, Ser. B 95(1): 79-100 (2005) |
