☰

Sang-Il Oum, Ph.D. - Publications

Affiliations: 
2005 Princeton University, Princeton, NJ 
Tree Info Similar researchers PubMed Report error

46 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Kwon O, Oum S. Scattered Classes of Graphs Siam Journal On Discrete Mathematics. 34: 972-999. DOI: 10.1137/19M1293776  0.514
2020 Kim R, Kwon O, Oum S, Sivaraman V. Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded Journal of Combinatorial Theory, Series B. 140: 372-386. DOI: 10.1016/J.Jctb.2019.06.001  0.585
2020 DeVos M, Kwon O, Oum S. Branch-depth: Generalizing tree-depth of graphs European Journal of Combinatorics. 90: 103186. DOI: 10.1016/J.Ejc.2020.103186  0.647
2020 Nguyen H, Oum S. The average cut-rank of graphs European Journal of Combinatorics. 90: 103183. DOI: 10.1016/J.Ejc.2020.103183  0.657
2020 Kwon O, Oum S. Graphs of bounded depth‐2 rank‐brittleness Journal of Graph Theory. DOI: 10.1002/Jgt.22619  0.66
2019 Kang DY, Oum S. Improper colouring of graphs with no odd clique minor Combinatorics, Probability & Computing. 28: 740-754. DOI: 10.1017/S0963548318000548  0.56
2019 Choi H, Kwon O, Oum S, Wollan P. Chi-boundedness of graph classes excluding wheel vertex-minors Journal of Combinatorial Theory, Series B. 135: 319-348. DOI: 10.1016/J.Jctb.2018.08.009  0.668
2019 Brignall R, Choi H, Jeong J, Oum S. Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs Discrete Applied Mathematics. 257: 60-66. DOI: 10.1016/J.Dam.2018.10.030  0.65
2019 Diestel R, Oum S. Tangle-Tree Duality: In Graphs, Matroids and Beyond Combinatorica. 39: 879-910. DOI: 10.1007/S00493-019-3798-5  0.592
2019 Choi H, Choi I, Jeong J, Oum S. Online Ramsey theory for a triangle on ‐free graphs Journal of Graph Theory. 92: 152-171. DOI: 10.1002/Jgt.22445  0.609
2018 Liu C, Oum S. Partitioning H -minor free graphs into three subgraphs with no large components Journal of Combinatorial Theory, Series B. 128: 114-133. DOI: 10.1016/J.Jctb.2017.08.003  0.578
2018 Corneil DG, Oum S, Paul C. Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015 Discrete Applied Mathematics. 248: 1-2. DOI: 10.1016/J.Dam.2018.08.003  0.519
2018 Oum S, Wee S. A Remark on the Paper “Properties of Intersecting Families of Ordered Sets” by O. Einstein Combinatorica. 38: 1279-1284. DOI: 10.1007/S00493-018-3812-3  0.327
2018 Kim EJ, Oum S, Paul C, Sau I, Thilikos DM. An FPT 2-Approximation for Tree-Cut Decomposition Algorithmica. 80: 116-135. DOI: 10.1007/S00453-016-0245-5  0.59
2017 Kreutzer S, Oum S, Seymour PD, Zypen Dvd, Wood DR. Majority Colourings of Digraphs Electronic Journal of Combinatorics. 24: 2-25. DOI: 10.37236/6410  0.576
2017 Jeong J, Kim EJ, Oum S. The “Art of Trellis Decoding” Is Fixed-Parameter Tractable Ieee Transactions On Information Theory. 63: 7178-7205. DOI: 10.1109/Tit.2017.2740283  0.499
2017 Choi I, Kwon O, Oum S. Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors Journal of Combinatorial Theory, Series B. 123: 126-147. DOI: 10.1016/J.Jctb.2016.11.007  0.628
2017 Choi H, Kwon O, Oum S, Wollan P. Chi-boundedness of graph classes excluding wheel vertex-minors Electronic Notes in Discrete Mathematics. 61: 247-253. DOI: 10.1016/J.Endm.2017.06.045  0.672
2017 Oum S. Rank-width: Algorithmic and structural results Discrete Applied Mathematics. 231: 15-24. DOI: 10.1016/J.Dam.2016.08.006  0.59
2016 Choi S, Masuda M, Oum S. Classification of real Bott manifolds and acyclic digraphs Transactions of the American Mathematical Society. 369: 2987-2987. DOI: 10.1090/Tran/6896  0.523
2016 Chudnovsky M, Kim R, Oum SI, Seymour P. Unavoidable induced subgraphs in large graphs with no homogeneous sets Journal of Combinatorial Theory. Series B. 118: 1-12. DOI: 10.1016/J.Jctb.2016.01.008  0.738
2016 Kim Y, Lee SJ, Oum S. Dynamic coloring of graphs having no K 5 minor Discrete Applied Mathematics. 206: 81-89. DOI: 10.1016/J.Dam.2016.01.022  0.674
2015 Lee C, Oum S. Number of Cliques in Graphs with a Forbidden Subdivision Siam Journal On Discrete Mathematics. 29: 1999-2005. DOI: 10.1137/140979988  0.551
2014 Kim S, Oum S. Hyperbolic surface subgroups of one-ended doubles of free groups Journal of Topology. 7: 927-947. DOI: 10.1112/Jtopol/Jtu004  0.354
2014 Jeong J, Kwon Oj, Oum Si. Excluded vertex-minors for graphs of linear rank-width at most k European Journal of Combinatorics. 41: 242-257. DOI: 10.1016/J.Ejc.2014.04.010  0.691
2014 Kwon Oj, Oum Si. Unavoidable vertex-minors in large prime graphs European Journal of Combinatorics. 41: 100-127. DOI: 10.1016/J.Ejc.2014.03.013  0.642
2014 Kwon OJ, Oum SI. Graphs of small rank-width are pivot-minors of graphs of small tree-width Discrete Applied Mathematics. 168: 108-118. DOI: 10.1016/J.Dam.2013.01.007  0.69
2013 Oum Si, Sæther SH, Vatshelle M. Faster algorithms for vertex partitioning problems parameterized by clique-width Theoretical Computer Science. DOI: 10.1016/J.Tcs.2014.03.024  0.471
2012 Oum S. Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices Linear Algebra and Its Applications. 436: 2008-2036. DOI: 10.1016/J.Laa.2011.09.027  0.518
2012 Lee C, Lee J, Oum S. Rank-width of random graphs Journal of Graph Theory. 70: 339-347. DOI: 10.1002/Jgt.20620  0.497
2011 Oum S. Perfect Matchings in Claw-free Cubic Graphs Electronic Journal of Combinatorics. 18: 62. DOI: 10.37236/549  0.669
2011 Oum S. Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract) Electronic Notes in Discrete Mathematics. 38: 693-698. DOI: 10.1016/J.Endm.2011.10.016  0.517
2010 Fomin FV, Oum S, Thilikos DM. Rank-width and tree-width of H-minor-free graphs European Journal of Combinatorics. 31: 1617-1628. DOI: 10.1016/J.Ejc.2010.05.003  0.647
2009 Oum S. Computing rank-width exactly Information Processing Letters. 109: 745-748. DOI: 10.1016/J.Ipl.2009.03.018  0.528
2009 Geelen J, Oum S. Circle graph obstructions under pivoting Journal of Graph Theory. 61: 1-11. DOI: 10.1002/Jgt.V61:1  0.663
2009 Oum S. Excluding a bipartite circle graph from line graphs Journal of Graph Theory. 60: 183-203. DOI: 10.1002/Jgt.V60:3  0.635
2008 Oum S. Approximating rank-width and clique-width quickly Acm Transactions On Algorithms. 5: 10. DOI: 10.1145/1435375.1435385  0.442
2008 Hliněný P, Oum S. Finding Branch-Decompositions and Rank-Decompositions Siam Journal On Computing. 38: 1012-1032. DOI: 10.1137/070685920  0.442
2008 Oum S. Rank-Width and Well-Quasi-Ordering Siam Journal On Discrete Mathematics. 22: 666-682. DOI: 10.1137/050629616  0.669
2008 Hliněný P, Oum S, Seese D, Gottlob G. Width Parameters Beyond Tree-width and their Applications The Computer Journal. 51: 326-362. DOI: 10.1093/Comjnl/Bxm052  0.443
2008 Oum S. Rank-width is less than or equal to branch-width Journal of Graph Theory. 57: 239-244. DOI: 10.1002/Jgt.V57:3  0.546
2007 Oum S, Seymour P. Testing branch-width Journal of Combinatorial Theory, Series B. 97: 385-393. DOI: 10.1016/J.Jctb.2006.06.006  0.582
2007 Courcelle B, Oum S. Vertex-minors, monadic second-order logic, and a conjecture by Seese Journal of Combinatorial Theory, Series B. 97: 91-126. DOI: 10.1016/J.Jctb.2006.04.003  0.642
2006 Oum S, Seymour P. Approximating clique-width and branch-width Journal of Combinatorial Theory, Series B. 96: 514-528. DOI: 10.1016/J.Jctb.2005.10.006  0.711
2005 Oum S. Rank-width and vertex-minors Journal of Combinatorial Theory, Series B. 95: 79-100. DOI: 10.1016/J.Jctb.2005.03.003  0.699
2005 Oum S. Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract) Electronic Notes in Discrete Mathematics. 22: 281-285. DOI: 10.1016/J.Endm.2005.06.051  0.629
Show low-probability matches.