Browse "Dept. of Mathematical Sciences(수리과학과)" by Author Oum, Sang-il
Showing results 52 to 97 of 97
| 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 |
| Tree Pivot-Minors and Linear Rank-Width Dabrowski, Konrad K.; Dross, Francois; Jeong, Jisu; Kante, Mamadou M.; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniel, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.35, no.4, pp.2922 - 2945, 2021-12 |
| Unavoidable induced subgraphs in large graphs with no homogeneous sets Chudnovsky, Maria; Kim, Ringi; Oum, Sang-il; Seymour, Paul, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.118, pp.1 - 12, 2016-05 |
| Unavoidable vertex-minors in large prime graphs Kwon, O-Joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.41, pp.100 - 127, 2014-10 |
| Unifying duality theorems for width parameters in graphs and matroids (Extended abstract) Diestel, Reinhard; Oum, Sang-il, 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, pp.1 - 14, Springer Verlag, 2014-06 |
| Variants of Hadwiger's conjecture Oum, Sang-il, Workshop on Probabilistic and Extremal Combinatorics Downunder, Monash University, 2016-06-16 |
| Variants of HAdwiger's conjecture Oum, Sang-il, 2016 International Workshop on Graph Theory and Combinatorics, 이화여대, 2016-02-19 |
| Vertex-minors and the Erdos-Hajnal conjecture Chudnovsky, Maria; Oum, Sang-il, DISCRETE MATHEMATICS, v.341, no.12, pp.3498 - 3499, 2018-12 |
| Vertex-minors of graphs: A survey Kim, Donggyu; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.351, pp.54 - 73, 2024-07 |
| Vertex-minors, monadic second-order logic, and a conjecture by Seese Courcelle, B; Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.97, no.1, pp.91 - 126, 2007-01 |
| Width parameters beyond tree-width and their applications Hlineny, P; Oum, Sang-il; Seese, D; Gottlob, G, COMPUTER JOURNAL, v.51, no.3, pp.326 - 362, 2008-05 |
Discover
Type
- 2,105 Article
- 503 Conference
- 7 Patent
- 670 Thesis(Master)
- 347 Thesis(Ph.D)