DSpace at KOASAS: Browsing DSpace

DSpace at KOASAS

Browsing DSpace

Browse "Dept. of Mathematical Sciences(수리과학과)" by Author Oum, Sang-il

Sort by:
In order:
Results/Page
Authors/Record:

Showing results 15 to 74 of 98

15	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
16	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
17	Characterizing graphs of maximum matching width at most 2 = 2 이하의 maximum matching width를 갖는 그래프에 대한 연구 link Suh, Geewon; 서기원; et al, 한국과학기술원, 2016
18	Characterizing matroids whose bases form graphic delta-matroids Lee, Duksang; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.101, 2022-03
19	Chi-boundedness of graph classes excluding wheel vertex-minors Oum, Sang-il, Geometric and Structural Graph Theory, Banff International Research Station, 2017-08-21
20	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
21	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
22	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
23	Circle Graph Obstructions Under Pivoting Geelen, Jim; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.61, no.1, pp.1 - 11, 2009-05
24	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
25	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
26	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
27	Computing rank-width exactly Oum, Sang-il, INFORMATION PROCESSING LETTERS, v.109, no.13, pp.745 - 748, 2009-06
28	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
29	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
30	Defective coloring of graphs with excluded subgraphs Oum, Sang-il, Southern Italian Workshop no Algorithms and Graphs, Sapienza Università di Roma, 2016-09-26
31	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
32	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
33	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
34	Equitable partition of planar graphs Kim, Ringi; Oum, Sang-il; Zhang, Xin, DISCRETE MATHEMATICS, v.344, no.6, 2021-06
35	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
36	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
37	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
38	Excluding a Bipartite Circle Graph from Line Graphs Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.60, no.3, pp.183 - 203, 2009-03
39	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
40	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
41	Finding branch-decompositions and rank-decompositions Hlineny, P; Oum, Sang-il, SIAM JOURNAL ON COMPUTING, v.38, no.3, pp.1012 - 1032, 2008
42	Finding branch-decompositions of matroids, hypergraphs, and more Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il, 18th KIAS Combinatorics Workshop, KIAS, 2017-12-18
43	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
44	Finding minimum clique capacity Chudnovsky, Maria; Oum, Sang-il; Seymour, Paul, COMBINATORICA, v.32, no.3, pp.283 - 287, 2012-04
45	G-Graphic Delta-Matroids and Their Applications Kim, Donggyu; Lee, Duksang; Oum, Sang-il, COMBINATORICA, v.43, no.5, pp.963 - 983, 2023-10
46	Graph decompositions and related extremal problems = 그래프 분할과 관련된 극단 문제 link Kang, Dong Yeap; Oum, Sang-il; et al, 한국과학기술원, 2020
47	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
48	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
49	Guest editors' foreword Heggernes, Pinar; Kratochvil, Jan; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.168, pp.1 - 2, 2014-05
50	Hadwiger's conjecture and its variants = 하트비거의 추측과 그에 대한 변형 link Kang, Dong Yeap; 강동엽; et al, 한국과학기술원, 2016
51	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
52	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
53	Kernel bounds and the graph isomorphism problem = 커널 바운드와 Graph Isomorphism 문제 link Bottesch, Ralph Christian; 보태시, 랄프; Oum, Sang-il; 엄상일; et al, 한국과학기술원, 2010
54	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
55	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
56	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
57	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
58	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
59	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
60	On online Ramsey theory = Online Ramsey theory에 대하여 link Choi, Hojin; 최호진; et al, 한국과학기술원, 2016
61	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
62	Parameterized algorithms for width parameters = Width parameters에 대한 매개변수 알고리즘 link Jeong, Jisu; Oum, Sang-il; et al, 한국과학기술원, 2018
63	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
64	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
65	Perfect Matchings in Claw-free Cubic Graphs Oum, Sang-il, ELECTRONIC JOURNAL OF COMBINATORICS, v.18, no.1, 2011-03
66	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
67	Prime vertex-minors of a prime graph Kim, Donggyu; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.118, 2024-05
68	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
69	Properties of intersecting families of ordered sets: revisited Oum, Sang-il; Wee, Sounggun, 2018 International Workshop on Graph Theory, 이화여자대학교, 2018-01-05
70	Rank and rank-width of random graphs = 무작위 그래프의 rank와 rank-width link Lee, Joon-Kyung; 이준경; et al, 한국과학기술원, 2010
71	Rank connectivity and pivot-minors of graphs Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.108, 2023-02
72	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
73	Rank-width and vertex-minors Oum, Sang-il, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.95, no.1, pp.79 - 100, 2005-09
74	Rank-width and well-quasi-ordering Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.22, no.2, pp.666 - 682, 2008

Discover

KOASAS

Knowledge Service Development Team, KAIST 291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of Korea. T. 82-42-350-4493 Email. koasas@kaist.ac.kr
Copyright © 2016. Korea Advanced Institute of Science and Technology. All Rights Reserved.

Communities & Collections

rss_1.0 rss_2.0 atom_1.0