Browse "MA-Journal Papers(저널논문)" by Author Oum, Sang-il
Showing results 1 to 60 of 70
| 3-Degenerate induced subgraph of a planar graph Gu, Yangyan; Kierstead, H. A.; Oum, Sang-il; Qi, Hao; Zhu, Xuding, JOURNAL OF GRAPH THEORY, v.99, no.2, pp.251 - 277, 2022-02 |
| A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors Lee, Duksang; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.113, 2023-10 |
| A Polynomial Kernel for 3-Leaf Power Deletion Ahn, Jungho; Eiben, Eduard; Kwon, O-joung; Oum, Sang-il, ALGORITHMICA, v.85, no.10, pp.3058 - 3087, 2023-10 |
| A RELATIVE OF HADWIGER'S CONJECTURE Edwards, Katherine; Kang, Dong Yeap; Kim, Jaehoon; Oum, Sang-il; Seymour, Paul, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.29, no.4, pp.2385 - 2388, 2015-12 |
| A Remark on the Paper “Properties of Intersecting Families of Ordered Sets” by O. Einstein Oum, Sang-il; Wee, Sounggun, COMBINATORICA, v.38, no.5, pp.1279 - 1284, 2018-10 |
| A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups Gollin, J. Pascal; Hendrey, Kevin; Kawarabayashi, Ken-ichi; Kwon, O-joung; Oum, Sang-il, JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, v.109, no.1, 2024-01 |
| 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 |
| Approximating clique-width and branch-width Oum, Sang-il; Seymour, P, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.96, no.4, pp.514 - 528, 2006-07 |
| Approximating Rank-Width and Clique-Width Quickly Oum, Sang-il, ACM TRANSACTIONS ON ALGORITHMS , v.5, no.1, pp.1 - 20, 2008-11 |
| BOUNDS FOR THE TWIN-WIDTH OF GRAPHS Ahn, Jungho; Hendrey, Kevin; Kim, Donggyu; Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.36, no.3, pp.2352 - 2366, 2022 |
Branch-depth: Generalizing tree-depth of graphs DeVos, Matt; Kwon, O-joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.90, 2020-12 |
| CHARACTERIZATION OF CYCLE OBSTRUCTION SETS FOR IMPROPER COLORING PLANAR GRAPHS Choi, Ilkyoo; Liu, Chun-Hung; Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.32, no.2, pp.1209 - 1228, 2018-06 |
| Characterizing matroids whose bases form graphic delta-matroids Lee, Duksang; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.101, 2022-03 |
| Chi-boundedness of graph classes excluding wheel vertex-minors Choi, Hojin; Kwon, O-joung; Oum, Sang-il; Wollan, Paul, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.135, pp.319 - 348, 2019-03 |
| Chi-boundedness of graph classes excluding wheel vertex-minors Choi, Hojin; Kwon, O-joung; Oum, Sang-il; Wollan, Paul, Electronic Notes in Discrete Mathematics, v.61, pp.247 - 253, 2017-08 |
| Circle Graph Obstructions Under Pivoting Geelen, Jim; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.61, no.1, pp.1 - 11, 2009-05 |
| Classes of graphs with no long cycle as a vertex-minor are polynomially chi-bounded Kim, Ringi; Kwon, O-joung; Oum, Sang-il; Sivaraman, Vaidy, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.140, pp.372 - 386, 2020-01 |
| CLASSIFICATION OF REAL BOTT MANIFOLDS AND ACYCLIC DIGRAPHS Choi, Suyoung; Masuda, Mikiya; Oum, Sang-il, TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, v.369, no.4, pp.2987 - 3011, 2017-04 |
| 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 |
| Computing rank-width exactly Oum, Sang-il, INFORMATION PROCESSING LETTERS, v.109, no.13, pp.745 - 748, 2009-06 |
| Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs Brignall, Robert; Choi, Hojin; Jeong, Jisu; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.257, pp.60 - 66, 2019-03 |
| Dynamic coloring of graphs having no K-5 minor Kim, Younjin; Lee, Sang June; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.206, pp.81 - 89, 2016-06 |
| Equitable partition of planar graphs Kim, Ringi; Oum, Sang-il; Zhang, Xin, DISCRETE MATHEMATICS, v.344, no.6, 2021-06 |
| Even-cycle decompositions of graphs with no odd-K-4-minor Huynh, Tony; Oum, Sang-il; Verdian-Rizi, Maryam, EUROPEAN JOURNAL OF COMBINATORICS, v.65, pp.1 - 14, 2017-10 |
| Excluded vertex-minors for graphs of linear rank-width at most k Jeong, Jisu; Kwon, O-Joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.41, pp.242 - 257, 2014-10 |
| Excluding a Bipartite Circle Graph from Line Graphs Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.60, no.3, pp.183 - 203, 2009-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 |
| Finding branch-decompositions and rank-decompositions Hlineny, P; Oum, Sang-il, SIAM JOURNAL ON COMPUTING, v.38, no.3, pp.1012 - 1032, 2008 |
| 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 |
| Finding minimum clique capacity Chudnovsky, Maria; Oum, Sang-il; Seymour, Paul, COMBINATORICA, v.32, no.3, pp.283 - 287, 2012-04 |
| G-Graphic Delta-Matroids and Their Applications Kim, Donggyu; Lee, Duksang; Oum, Sang-il, COMBINATORICA, v.43, no.5, pp.963 - 983, 2023-10 |
| 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 |
| Graphs of small rank-width are pivot-minors of graphs of small tree-width Kwon, O-Joung; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.168, pp.108 - 118, 2014-05 |
| Guest editors' foreword Heggernes, Pinar; Kratochvil, Jan; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.168, pp.1 - 2, 2014-05 |
| Hyperbolic surface subgroups of one-ended doubles of free groups Kim, Sang-hyun; Oum, Sang-il, JOURNAL OF TOPOLOGY, v.7, no.4, pp.927 - 947, 2014-12 |
| Independent domination of graphs with bounded maximum degree Cho, Eun-Kyung; Kim, Jinha; Kim, Minki; Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.158, pp.341 - 352, 2023-01 |
| NUMBER OF CLIQUES IN GRAPHS WITH A FORBIDDEN SUBDIVISION Lee, Choongbum; Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.29, no.4, pp.1999 - 2005, 2015-10 |
| Obstructions for Bounded Branch-depth in Matroids Gollin, Jochen Pascal; Hendrey, Kevin; Mayhew, Dillon; Oum, Sang-il, Advances in Combinatorics, v.2021, no.1, pp.1 - 25, 2021-05 |
| 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 |
| 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 |
| Obstructions for partitioning into forests and outerplanar graphs Kim, Ringi; Norin, Sergey; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.312, pp.15 - 28, 2022-05 |
| Online Ramsey theory for a triangle on F-free graphs Choi, Hojin; Choi, Ilkyoo; Jeong, Jisu; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.92, no.2, pp.152 - 171, 2019-10 |
| Partitioning H-minor free graphs into three subgraphs with no large components Liu, Chunhung; Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.128, pp.114 - 133, 2018-01 |
| Partitioning H-minor free graphs into three subgraphs with no large components Liu, Chunhung; Oum, Sang-il, Electronic Notes in Discrete Mathematics, v.49, pp.133 - 138, 2015-11 |
| Perfect Matchings in Claw-free Cubic Graphs Oum, Sang-il, ELECTRONIC JOURNAL OF COMBINATORICS, v.18, no.1, 2011-03 |
| Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015 Corneil, Derek; Oum, Sang-il; Paul, Christophe, DISCRETE APPLIED MATHEMATICS, v.248, pp.1 - 2, 2018-10 |
| Prime vertex-minors of a prime graph Kim, Donggyu; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.118, 2024-05 |
| Rank connectivity and pivot-minors of graphs Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.108, 2023-02 |
| Rank-width and tree-width of H-minor-free graphs Fomin, FV; Oum, Sang-il; Thilikos, DM, EUROPEAN JOURNAL OF COMBINATORICS, v.31, no.7, pp.1617 - 1628, 2010-10 |
| Rank-width and vertex-minors Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.95, no.1, pp.79 - 100, 2005-09 |
| Rank-width and well-quasi-ordering Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.22, no.2, pp.666 - 682, 2008 |
| Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices Oum, Sang-il, LINEAR ALGEBRA AND ITS APPLICATIONS, v.436, no.7, pp.2008 - 2036, 2012-04 |
| Rank-width is less than or equal to branch-width Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.57, no.3, pp.239 - 244, 2008-03 |
| Rank-width of random graphs Lee, Choongbum; Lee, Joonkyung; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.70, no.3, pp.339 - 347, 2012-07 |
| Rank-width: algorithmic and structural results Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.231, pp.15 - 24, 2017-11 |
| Scattered Classes of Graphs Kwon, O-joung; Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.34, no.1, pp.972 - 999, 2020-01 |
| Strongly Even-Cycle Decomposable Graphs Huynh, Tony; King, Andrew D.; Oum, Sang-il; Verdian-Rizi, Maryam, JOURNAL OF GRAPH THEORY, v.84, no.2, pp.158 - 175, 2017-02 |
| Tangle-tree duality in abstract separation systems Diestel, Reinhard; Oum, Sang-il, ADVANCES IN MATHEMATICS, v.377, pp.107470, 2021-01 |
| Tangle-Tree Duality: In Graphs, Matroids and Beyond Diestel, Reinhard; Oum, Sang-il, COMBINATORICA, v.39, no.4, pp.879 - 910, 2019-08 |
| Testing branch-width Oum, Sang-il; Seymour, P, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.97, no.3, pp.385 - 393, 2007-05 |
Discover
Type
- 2,147 Article
Open Access
- 83 OA Article