Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract). - Sang-il Oum (Electron. Notes Discret. Math., 2005)

Rank-width and vertex-minors. - Sang-il Oum (J. Comb. Theory B, 2005)

Certifying large branch-width. - Sang-il Oum; Paul D. Seymour (SODA, 2006)

Approximating clique-width and branch-width. - Sang-il Oum; Paul D. Seymour (J. Comb. Theory B, 2006)

Vertex-minors, monadic second-order logic, and a conjecture by Seese. - Bruno Courcelle; Sang-il Oum (J. Comb. Theory B, 2007)

Testing branch-width. - Sang-il Oum; Paul D. Seymour (J. Comb. Theory B, 2007)

Width Parameters Beyond Tree-width and their Applications. - Petr Hlinený; Sang-il Oum; Detlef Seese; Georg Gottlob (Comput. J., 2008)

Rank-width is less than or equal to branch-width. - Sang-il Oum (J. Graph Theory, 2008)

Finding Branch-Decompositions and Rank-Decompositions. - Petr Hlinený; Sang-il Oum (SIAM J. Comput., 2008)

Rank-Width and Well-Quasi-Ordering. - Sang-il Oum (SIAM J. Discret. Math., 2008)

Approximating rank-width and clique-width quickly. - Sang-il Oum (ACM Trans. Algorithms, 2008)

Computing rank-width exactly. - Sang-il Oum (Inf. Process. Lett., 2009)

Circle graph obstructions under pivoting. - Jim Geelen; Sang-il Oum (J. Graph Theory, 2009)

Excluding a bipartite circle graph from line graphs. - Sang-il Oum (J. Graph Theory, 2009)

Rank-width and tree-width of H-minor-free graphs. - Fedor V. Fomin; Sang-il Oum; Dimitrios M. Thilikos (Eur. J. Comb., 2010)

Perfect Matchings in Claw-free Cubic Graphs. - Sang-il Oum (Electron. J. Comb., 2011)

Deciding first order logic properties of matroids - Tomas Gavenciak; Daniel Král; Sang-il Oum (CoRR, 2011)

Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract). - Sang-il Oum (Electron. Notes Discret. Math., 2011)

Deciding First Order Properties of Matroids. - Tomas Gavenciak; Daniel Král; Sang-il Oum (ICALP (2), 2012)

Finding minimum clique capacity. - Maria Chudnovsky; Sang-il Oum; Paul D. Seymour (Comb., 2012)

Rank-width of random graphs. - Choongbum Lee; Joonkyung Lee; Sang-il Oum (J. Graph Theory, 2012)

Faster Algorithms Parameterized by Clique-width. - Sang-il Oum; Sigve Hortemo Sæther; Martin Vatshelle (CoRR, 2013)

Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract). - Reinhard Diestel; Sang-il Oum (WG, 2014)

Guest editors' foreword. - Pinar Heggernes; Jan Kratochvíl; Sang-il Oum (Discret. Appl. Math., 2014)

Graphs of small rank-width are pivot-minors of graphs of small tree-width. - O-joung Kwon; Sang-il Oum (Discret. Appl. Math., 2014)

Excluded vertex-minors for graphs of linear rank-width at most k. - Jisu Jeong; O-joung Kwon; Sang-il Oum (Eur. J. Comb., 2014)

Unavoidable vertex-minors in large prime graphs. - O-joung Kwon; Sang-il Oum (Eur. J. Comb., 2014)

Faster algorithms for vertex partitioning problems parameterized by clique-width. - Sang-il Oum; Sigve Hortemo Sæther; Martin Vatshelle (Theor. Comput. Sci., 2014)

Partitioning H-minor free graphs into three subgraphs with no large components. - Chun-Hung Liu; Sang-il Oum (Electron. Notes Discret. Math., 2015)

A Relative of Hadwiger's Conjecture. - Katherine Edwards; Dong Yeap Kang; Jaehoon Kim; Sang-il Oum; Paul D. Seymour (SIAM J. Discret. Math., 2015)

Number of Cliques in Graphs with a Forbidden Subdivision. - Choongbum Lee; Sang-il Oum (SIAM J. Discret. Math., 2015)

Constructive algorithm for path-width of matroids. - Jisu Jeong; Eun Jung Kim 002; Sang-il Oum (SODA, 2016)

Dynamic coloring of graphs having no K5 minor. - Younjin Kim; Sangjune Lee; Sang-il Oum (Discret. Appl. Math., 2016)

Unavoidable induced subgraphs in large graphs with no homogeneous sets. - Maria Chudnovsky; Ringi Kim; Sang-il Oum; Paul D. Seymour (J. Comb. Theory B, 2016)

Majority Colourings of Digraphs. - Stephan Kreutzer; Sang-il Oum; Paul D. Seymour; Dominic van der Zypen; David R. Wood (Electron. J. Comb., 2017)

Rank-width: Algorithmic and structural results. - Sang-il Oum (Discret. Appl. Math., 2017)

Even-cycle decompositions of graphs with no odd-K4-minor. - Tony Huynh; Sang-il Oum; Maryam Verdian-Rizi (Eur. J. Comb., 2017)

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors. - Ilkyoo Choi; O-joung Kwon; Sang-il Oum (J. Comb. Theory B, 2017)

Strongly Even-Cycle Decomposable Graphs. - Tony Huynh; Andrew D. King; Sang-il Oum; Maryam Verdian-Rizi (J. Graph Theory, 2017)

The "Art of Trellis Decoding" Is Fixed-Parameter Tractable. - Jisu Jeong; Eun Jung Kim 002; Sang-il Oum (IEEE Trans. Inf. Theory, 2017)

Computing Small Pivot-Minors. - Konrad K. Dabrowski; François Dross; Jisu Jeong; Mamadou Moustapha Kanté; O-joung Kwon; Sang-il Oum; Daniël Paulusma (WG, 2018)

An FPT 2-Approximation for Tree-Cut Decomposition. - Eun Jung Kim 002; Sang-il Oum; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (Algorithmica, 2018)

A Remark on the Paper "Properties of Intersecting Families of Ordered Sets" by O. Einstein. - Sang-il Oum; Sounggun Wee (Comb., 2018)

Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. - Ringi Kim; O-joung Kwon; Sang-il Oum; Vaidy Sivaraman (CoRR, 2018)

Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. - Derek G. Corneil; Sang-il Oum; Christophe Paul (Discret. Appl. Math., 2018)

Vertex-minors and the Erdős-Hajnal conjecture. - Maria Chudnovsky; Sang-il Oum (Discret. Math., 2018)

Partitioning H-minor free graphs into three subgraphs with no large components. - Chun-Hung Liu; Sang-il Oum (J. Comb. Theory B, 2018)

Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs. - Ilkyoo Choi; Chun-Hung Liu; Sang-il Oum (SIAM J. Discret. Math., 2018)

Tangle-Tree Duality: In Graphs, Matroids and Beyond. - Reinhard Diestel; Sang-il Oum (Comb., 2019)

Defective Colouring of Graphs Excluding A Subgraph or Minor. - Patrice Ossona de Mendez; Sang-il Oum; David R. Wood (Comb., 2019)

Improper colouring of graphs with no odd clique minor. - Dong Yeap Kang; Sang-il Oum (Comb. Probab. Comput., 2019)

Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. - Robert Brignall; Ho-Jin Choi; Jisu Jeong; Sang-il Oum (Discret. Appl. Math., 2019)

Chi-boundedness of graph classes excluding wheel vertex-minors. - Ho-Jin Choi; O-joung Kwon; Sang-il Oum; Paul Wollan (J. Comb. Theory B, 2019)

Online Ramsey theory for a triangle on -free graphs. - Ho-Jin Choi; Ilkyoo Choi; Jisu Jeong; Sang-il Oum (J. Graph Theory, 2019)

How to Decompose a Graph into a Tree-Like Structure (Invited Talk). - Sang-il Oum (ISAAC, 2020)

Branch-depth: Generalizing tree-depth of graphs. - Matt DeVos; O-joung Kwon; Sang-il Oum (Eur. J. Comb., 2020)

The average cut-rank of graphs. - Huy-Trung Nguyen; Sang-il Oum (Eur. J. Comb., 2020)

Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. - Ringi Kim; O-joung Kwon; Sang-il Oum; Vaidy Sivaraman (J. Comb. Theory, Ser. B, 2020)

Scattered Classes of Graphs. - O-joung Kwon; Sang-il Oum (SIAM J. Discret. Math., 2020)

The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor. - Jaehoon Kim; Sang-il Oum (Electron. J. Comb., 2021)

Equitable partition of planar graphs. - Ringi Kim; Sang-il Oum; Xin Zhang 017 (Discret. Math., 2021)

Obstructions for bounded shrub-depth and rank-depth. - O-joung Kwon; Rose McCarty; Sang-il Oum; Paul Wollan (J. Comb. Theory B, 2021)

Graphs of bounded depth-2 rank-brittleness. - O-joung Kwon; Sang-il Oum (J. Graph Theory, 2021)

Tree Pivot-Minors and Linear Rank-Width. - Konrad K. Dabrowski; François Dross; Jisu Jeong; Mamadou Moustapha Kanté; O-joung Kwon; Sang-il Oum; Daniël Paulusma (SIAM J. Discret. Math., 2021)

Finding Branch-Decompositions of Matroids, Hypergraphs, and More. - Jisu Jeong; Eun Jung Kim 002; Sang-il Oum (SIAM J. Discret. Math., 2021)

Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. - Mamadou Moustapha Kanté; Eun Jung Kim 002; O-joung Kwon; Sang-il Oum (STACS, 2022)

Obstructions for partitioning into forests and outerplanar graphs. - Ringi Kim; Sergey Norin; Sang-il Oum (Discret. Appl. Math., 2022)

Characterizing matroids whose bases form graphic delta-matroids. - Duksang Lee; Sang-il Oum (Eur. J. Comb., 2022)

3-Degenerate induced subgraph of a planar graph. - Yangyan Gu; Hal A. Kierstead; Sang-il Oum; Hao Qi 001; Xuding Zhu (J. Graph Theory, 2022)

Bounds for the Twin-Width of Graphs. - Jungho Ahn; Kevin Hendrey; Donggyu Kim; Sang-il Oum (SIAM J. Discret. Math., 2022)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. - Benjamin Bergougnoux; Vera Chekan; Robert Ganian; Mamadou Moustapha Kanté; Matthias Mnich; Sang-il Oum; Michal Pilipczuk; Erik Jan van Leeuwen (ESA, 2023)

Computing pivot-minors. - Konrad K. Dabrowski; François Dross; Jisu Jeong; Mamadou Moustapha Kanté; O-joung Kwon; Sang-il Oum; Daniël Paulusma (CoRR, 2023)

Rank connectivity and pivot-minors of graphs. - Sang-il Oum (Eur. J. Comb., 2023)

Independent domination of graphs with bounded maximum degree. - Eun-Kyung Cho; Jinha Kim; Minki Kim; Sang-il Oum (J. Comb. Theory B, 2023)

Intertwining Connectivities for Vertex-Minors and Pivot-Minors. - Duksang Lee; Sang-il Oum (SIAM J. Discret. Math., 2023)

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k. - Mamadou Moustapha Kanté; Eun Jung Kim 002; O-joung Kwon; Sang-il Oum (J. Comb. Theory B, 2023)

A Polynomial Kernel for 3-Leaf Power Deletion. - Jungho Ahn; Eduard Eiben; O-joung Kwon; Sang-il Oum (Algorithmica, 2023)

Γ-Graphic Delta-Matroids and Their Applications. - Donggyu Kim; Duksang Lee; Sang-il Oum (Comb., 2023)

A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors. - Duksang Lee; Sang-il Oum (Eur. J. Comb., 2023)

Colouring t-perfect graphs. - Maria Chudnovsky; Linda Cook; James Davies; Sang-il Oum; Jane Tan (CoRR, 2024)

Vertex-minors of graphs: A survey. - Donggyu Kim; Sang-il Oum (Discret. Appl. Math., 2024)

Prime vertex-minors of a prime graph. - Donggyu Kim; Sang-il Oum (Eur. J. Comb., 2024)

Twin-width of random graphs. - Jungho Ahn; Debsoumya Chakraborti; Kevin Hendrey; Donggyu Kim; Sang-il Oum (Random Struct. Algorithms, 2024)

The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs. - Jungho Ahn; Seonghyuk Im; Sang-il Oum (Discret. Appl. Math., 2025)

Twin-Width of Subdivisions of Multigraphs. - Jungho Ahn; Debsoumya Chakraborti; Kevin Hendrey; Sang-il Oum (SIAM J. Discret. Math., 2025)

Reuniting χ-boundedness with polynomial χ-boundedness. - Maria Chudnovsky; Linda Cook; James Davies; Sang-il Oum (J. Comb. Theory B, 2026)