Browse "Dept. of Mathematical Sciences(수리과학과)" by Author Oum, Sang-il
Showing results 28 to 87 of 97
| 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 |
| Parameterized algorithms for width parameters = Width parameters에 대한 매개변수 알고리즘link Jeong, Jisu; Oum, Sang-il; et al, 한국과학기술원, 2018 |
| 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 |
| Properties of intersecting families of ordered sets: revisited Oum, Sang-il, 2017 Korea-China International Conference on Matrix Theory with Applications, Sungkyunkwan University, 2017-12-16 |
| Properties of intersecting families of ordered sets: revisited Oum, Sang-il; Wee, Sounggun, 2018 International Workshop on Graph Theory, 이화여자대학교, 2018-01-05 |
| Rank and rank-width of random graphs = 무작위 그래프의 rank와 rank-widthlink Lee, Joon-Kyung; 이준경; et al, 한국과학기술원, 2010 |
| 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 |
| Recognition algorithm for vertex-minors = Vertex-minor를 찾는 알고리즘link Kang, Yeong-joon; Oum, Sang-il; et al, 한국과학기술원, 2019 |
| Scattered classes of graphs Kwon, O-joung; Oum, Sang-il, SIAM Conference on Discrete Mathematics, SIAM, 2018-06-04 |
| 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 |
| 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 |
| The average cut-rank of graphs Nguyen, Huy-Tung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.90, 2020-12 |
| 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 |
Discover
Type
- 2,105 Article
- 503 Conference
- 7 Patent
- 670 Thesis(Master)
- 347 Thesis(Ph.D)