Sang-il Oum

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 66

Top Venues

CoRR

Eur. J. Comb.

SIAM J. Discret. Math.

Discret. Appl. Math.

Publications

Donggyu Kim, Sang-il Oum
Prime vertex-minors of a prime graph. Eur. J. Comb. 118 (2024)
Donggyu Kim, Sang-il Oum
Vertex-minors of graphs: A survey. Discret. Appl. Math. 351 (2024)
Sang-il Oum
Rank connectivity and pivot-minors of graphs. Eur. J. Comb. 108 (2023)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
. J. Comb. Theory, Ser. B 160 (2023)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing pivot-minors. CoRR (2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR (2023)
Duksang Lee, Sang-il Oum
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors. Eur. J. Comb. 113 (2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA (2023)
Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Sang-il Oum
Twin-width of subdivisions of multigraphs. CoRR (2023)
Duksang Lee, Sang-il Oum
Intertwining Connectivities for Vertex-Minors and Pivot-Minors. SIAM J. Discret. Math. 37 (1) (2023)
Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum
Reuniting χ-boundedness with polynomial χ-boundedness. CoRR (2023)
Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica 85 (10) (2023)
Donggyu Kim, Duksang Lee, Sang-il Oum
Γ-Graphic Delta-Matroids and Their Applications. Comb. 43 (5) (2023)
Eun-Kyung Cho, Jinha Kim, Minki Kim, Sang-il Oum
Independent domination of graphs with bounded maximum degree. J. Comb. Theory, Ser. B 158 (Part) (2023)
Duksang Lee, Sang-il Oum
Characterizing matroids whose bases form graphic delta-matroids. Eur. J. Comb. 101 (2022)
Yangyan Gu, Hal A. Kierstead, Sang-il Oum, Hao Qi, Xuding Zhu
3-Degenerate induced subgraph of a planar graph. J. Graph Theory 99 (2) (2022)
Ringi Kim, Sergey Norin, Sang-il Oum
Obstructions for partitioning into forests and outerplanar graphs. Discret. Appl. Math. 312 (2022)
Jungho Ahn, Seonghyuk Im, Sang-il Oum
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs. CoRR (2022)
Jungho Ahn, Kevin Hendrey, Donggyu Kim, Sang-il Oum
Bounds for the Twin-Width of Graphs. SIAM J. Discret. Math. 36 (3) (2022)
Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, Sang-il Oum
Twin-width of random graphs. CoRR (2022)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. STACS (2022)
Jungho Ahn, Kevin Hendrey, Donggyu Kim, Sang-il Oum
Bounds for the Twin-width of Graphs. CoRR (2021)
Ringi Kim, Sang-il Oum, Xin Zhang
Equitable partition of planar graphs. Discret. Math. 344 (6) (2021)
Donggyu Kim, Duksang Lee, Sang-il Oum
Γ-Graphic Delta-Matroids and Their Applications. ISAAC (2021)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Finding Branch-Decompositions of Matroids, Hypergraphs, and More. SIAM J. Discret. Math. 35 (4) (2021)
O-joung Kwon, Sang-il Oum
Graphs of bounded depth-2 rank-brittleness. J. Graph Theory 96 (3) (2021)
O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
Obstructions for bounded shrub-depth and rank-depth. J. Comb. Theory, Ser. B 149 (2021)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. 35 (4) (2021)
Jaehoon Kim, Sang-il Oum
The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor. Electron. J. Comb. 28 (2) (2021)
Matt DeVos, O-joung Kwon, Sang-il Oum
Branch-depth: Generalizing tree-depth of graphs. Eur. J. Comb. 90 (2020)
Huy-Trung Nguyen, Sang-il Oum
The average cut-rank of graphs. Eur. J. Comb. 90 (2020)
Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman
-bounded. J. Comb. Theory, Ser. B 140 (2020)
O-joung Kwon, Sang-il Oum
Scattered Classes of Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
A Polynomial Kernel for 3-Leaf Power Deletion. MFCS (2020)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree pivot-minors and linear rank-width. CoRR (2020)
Sang-il Oum
How to Decompose a Graph into a Tree-Like Structure (Invited Talk). ISAAC (2020)
Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. Discret. Appl. Math. 257 (2019)
O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
Obstructions for bounded shrub-depth and rank-depth. CoRR (2019)
Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
Chi-boundedness of graph classes excluding wheel vertex-minors. J. Comb. Theory, Ser. B 135 (2019)
Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
A polynomial kernel for $3$-leaf power deletion. CoRR (2019)
Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Sang-il Oum
Online Ramsey theory for a triangle on -free graphs. J. Graph Theory 92 (2) (2019)
Dong Yeap Kang, Sang-il Oum
Improper colouring of graphs with no odd clique minor. Comb. Probab. Comput. 28 (5) (2019)
Patrice Ossona de Mendez, Sang-il Oum, David R. Wood
Defective Colouring of Graphs Excluding A Subgraph or Minor. Comb. 39 (2) (2019)
Reinhard Diestel, Sang-il Oum
Tangle-Tree Duality: In Graphs, Matroids and Beyond. Comb. 39 (4) (2019)
Chun-Hung Liu, Sang-il Oum
-minor free graphs into three subgraphs with no large components. J. Comb. Theory, Ser. B 128 (2018)
Derek G. Corneil, Sang-il Oum, Christophe Paul
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. Discret. Appl. Math. 248 (2018)
Sang-il Oum, Sounggun Wee
A Remark on the Paper "Properties of Intersecting Families of Ordered Sets" by O. Einstein. Comb. 38 (5) (2018)
Ilkyoo Choi, Chun-Hung Liu, Sang-il Oum
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs. SIAM J. Discret. Math. 32 (2) (2018)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing Small Pivot-Minors. WG (2018)
Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80 (1) (2018)
Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. CoRR (2018)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Finding Branch-Decompositions of Matroids, Hypergraphs, and More. ICALP (2018)
Maria Chudnovsky, Sang-il Oum
Vertex-minors and the Erdős-Hajnal conjecture. Discret. Math. 341 (12) (2018)
Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi
Strongly Even-Cycle Decomposable Graphs. J. Graph Theory 84 (2) (2017)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable. IEEE Trans. Inf. Theory 63 (11) (2017)
Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
Chi-boundedness of graph classes excluding wheel vertex-minors. Electron. Notes Discret. Math. 61 (2017)
Ilkyoo Choi, O-joung Kwon, Sang-il Oum
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors. J. Comb. Theory, Ser. B 123 (2017)
Tony Huynh, Sang-il Oum, Maryam Verdian-Rizi
-minor. Eur. J. Comb. 65 (2017)
Sang-il Oum
Rank-width: Algorithmic and structural results. Discret. Appl. Math. 231 (2017)
Stephan Kreutzer, Sang-il Oum, Paul D. Seymour, Dominic van der Zypen, David R. Wood
Majority Colourings of Digraphs. Electron. J. Comb. 24 (2) (2017)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Finding branch-decompositions of matroids, hypergraphs, and more. CoRR (2017)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Constructive algorithm for path-width of matroids. SODA (2016)
Maria Chudnovsky, Ringi Kim, Sang-il Oum, Paul D. Seymour
Unavoidable induced subgraphs in large graphs with no homogeneous sets. J. Comb. Theory, Ser. B 118 (2016)
Younjin Kim, Sangjune Lee, Sang-il Oum
minor. Discret. Appl. Math. 206 (2016)
Sang-il Oum
Rank-width: Algorithmic and structural results. CoRR (2016)
Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. CoRR (2016)
Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
An FPT 2-Approximation for Tree-cut Decomposition. WAOA (2015)
Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
An FPT 2-Approximation for Tree-Cut Decomposition. CoRR (2015)
Chun-Hung Liu, Sang-il Oum
Partitioning H-minor free graphs into three subgraphs with no large components. Electron. Notes Discret. Math. 49 (2015)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Constructive algorithm for path-width of matroids. CoRR (2015)
Choongbum Lee, Sang-il Oum
Number of Cliques in Graphs with a Forbidden Subdivision. SIAM J. Discret. Math. 29 (4) (2015)
Katherine Edwards, Dong Yeap Kang, Jaehoon Kim, Sang-il Oum, Paul D. Seymour
A Relative of Hadwiger's Conjecture. SIAM J. Discret. Math. 29 (4) (2015)
O-joung Kwon, Sang-il Oum
Unavoidable vertex-minors in large prime graphs. Eur. J. Comb. 41 (2014)
Jisu Jeong, O-joung Kwon, Sang-il Oum
Excluded vertex-minors for graphs of linear rank-width at most k. Eur. J. Comb. 41 (2014)
O-joung Kwon, Sang-il Oum
Graphs of small rank-width are pivot-minors of graphs of small tree-width. Discret. Appl. Math. 168 (2014)
Pinar Heggernes, Jan Kratochvíl, Sang-il Oum
Guest editors' foreword. Discret. Appl. Math. 168 (2014)
Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
Faster algorithms for vertex partitioning problems parameterized by clique-width. Theor. Comput. Sci. 535 (2014)
Reinhard Diestel, Sang-il Oum
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract). WG (2014)
Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
Faster Algorithms Parameterized by Clique-width. CoRR (2013)
Jisu Jeong, O-joung Kwon, Sang-il Oum
Excluded vertex-minors for graphs of linear rank-width at most k. STACS (2013)
Tomas Gavenciak, Daniel Král, Sang-il Oum
Deciding First Order Properties of Matroids. ICALP (2) (2012)
O-joung Kwon, Sang-il Oum
Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width CoRR (2012)
Maria Chudnovsky, Sang-il Oum, Paul D. Seymour
Finding minimum clique capacity. Comb. 32 (3) (2012)
Choongbum Lee, Joonkyung Lee, Sang-il Oum
Rank-width of random graphs. J. Graph Theory 70 (3) (2012)
Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi
Strongly even cycle decomposable graphs CoRR (2012)
Sang-il Oum
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract). Electron. Notes Discret. Math. 38 (2011)
Tomas Gavenciak, Daniel Král, Sang-il Oum
Deciding first order logic properties of matroids CoRR (2011)
Sang-il Oum
Perfect Matchings in Claw-free Cubic Graphs. Electron. J. Comb. 18 (1) (2011)
Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos
Rank-width and tree-width of H-minor-free graphs. Eur. J. Comb. 31 (7) (2010)
Jim Geelen, Sang-il Oum
Circle graph obstructions under pivoting. J. Graph Theory 61 (1) (2009)
Sang-il Oum
Computing rank-width exactly. Inf. Process. Lett. 109 (13) (2009)
Sang-il Oum
Excluding a bipartite circle graph from line graphs. J. Graph Theory 60 (3) (2009)
Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob
Width Parameters Beyond Tree-width and their Applications. Comput. J. 51 (3) (2008)
Petr Hlinený, Sang-il Oum
Finding Branch-Decompositions and Rank-Decompositions. SIAM J. Comput. 38 (3) (2008)
Sang-il Oum
Rank-width is less than or equal to branch-width. J. Graph Theory 57 (3) (2008)
Sang-il Oum
Approximating rank-width and clique-width quickly. ACM Trans. Algorithms 5 (1) (2008)
Sang-il Oum
Rank-Width and Well-Quasi-Ordering. SIAM J. Discret. Math. 22 (2) (2008)
Sang-il Oum, Paul D. Seymour
Testing branch-width. J. Comb. Theory, Ser. B 97 (3) (2007)
Bruno Courcelle, Sang-il Oum
Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory, Ser. B 97 (1) (2007)
Petr Hlinený, Sang-il Oum
Finding Branch-Decompositions and Rank-Decompositions. ESA (2007)

Sang-il Oum.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sang-il Oum