Browse "Dept. of Mathematical Sciences(수리과학과)" by Author Oum, Sang-il
Showing results 1 to 60 of 97
| 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 |
| (A) polynomial kernel for 3-leaf power deletion = 3-leaf power 꼭짓점 제거 문제의 다항식 커널link Ahn, Jungho; Oum, Sang-il; et al, 한국과학기술원, 2020 |
| 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 |
| An FPT 2-approximation for tree-cut decomposition Kim, Eunjung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M., 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, pp.35 - 46, Springer Verlag, 2015-09 |
| 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 |
| Certifying Large Branch-width Paul Seymour; Oum, Sang-il, the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.810 - 813, 2006-01-22 |
| 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 graphs of maximum matching width at most 2 = 2 이하의 maximum matching width를 갖는 그래프에 대한 연구link Suh, Geewon; 서기원; et al, 한국과학기술원, 2016 |
| 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 Oum, Sang-il, Geometric and Structural Graph Theory, Banff International Research Station, 2017-08-21 |
| Chi-boundedness of graph classes excluding wheel vertex-minors Oum, Sang-il, Workshop on Graph Classes, Optimization, and Width Parameters (GROW2017), The Fields Institute, 2017-10-12 |
| 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 |
| Computing small pivot-minors Dabrowski, Konrad K; Dross, Francois; Jeong, Jisu; Kanté, Mamadou Moustapha; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniel, 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, pp.125 - 138, Springer Verlag, 2018-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 |
| Defective coloring of graphs with excluded subgraphs Oum, Sang-il, Southern Italian Workshop no Algorithms and Graphs, Sapienza Università di Roma, 2016-09-26 |
| Doubles of free groups and hyperbolic surface subgroups Kim, Sang-Hyun; Oum, Sang-il, Workshop on Immersed surfaces in 3-manifolds, a part of the IHP program "Geometry and analysis of surface group representations”, IHP, Paris, 2012-03-26 |
| Doubles of free groups and hyperbolic surface subgroups Kim, Sang-hyun; Oum, Sang-il, Hot Topics: Surface subgroups and cube complexes, Mathematical Sciences Research Institute, 2013-03-19 |
| 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 |
| Excluded vertex-minors for graphs of linear rank-width at most k Jeong, Jisu; Kwon, O-joung; Oum, Sang-il, The 30th Symposium on Theoretical Aspects of Computer Science (STACS’13), pp.221 - 232, University of Kiel, 2013-02-28 |
| 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 Petr Hlineny; Oum, Sang-il, 15th Annual European Symposium on Algorithms, v.4698, pp.163 - 174, 2007-10-08 |
| 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, 18th KIAS Combinatorics Workshop, KIAS, 2017-12-18 |
| 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 |
| Graph decompositions and related extremal problems = 그래프 분할과 관련된 극단 문제link Kang, Dong Yeap; Oum, Sang-il; et al, 한국과학기술원, 2020 |
| 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 |
| Hadwiger's conjecture and its variants = 하트비거의 추측과 그에 대한 변형link Kang, Dong Yeap; 강동엽; et al, 한국과학기술원, 2016 |
| 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 |
| Kernel bounds and the graph isomorphism problem = 커널 바운드와 Graph Isomorphism 문제link Bottesch, Ralph Christian; 보태시, 랄프; Oum, Sang-il; 엄상일; et al, 한국과학기술원, 2010 |
| 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, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022-03 |
| 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 |
| On online Ramsey theory = Online Ramsey theory에 대하여link Choi, Hojin; 최호진; et al, 한국과학기술원, 2016 |
| 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 |
Discover
Type
- 2,102 Article
- 503 Conference
- 7 Patent
- 670 Thesis(Master)
- 347 Thesis(Ph.D)