Sang-il Oum

发表

Deciding First Order Properties of Matroids

Daniel Král, Tomas Gavenciak, Sang-il Oum, 2012, ICALP.

Tangle-Tree Duality: In Graphs, Matroids and Beyond

Reinhard Diestel, Sang-il Oum, R. Diestel, 2017, Combinatorica.

Chi-boundedness of graph classes excluding wheel vertex-minors

Paul Wollan, Ho-Jin Choi, O-joung Kwon, 2017, Electron. Notes Discret. Math..

Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs

Ho-Jin Choi, Robert Brignall, Sang-il Oum, 2019, Discret. Appl. Math..

Computing Small Pivot-Minors

Daniël Paulusma, Mamadou Moustapha Kanté, O-joung Kwon, 2018, WG.

Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded pdf

O-joung Kwon, Sang-il Oum, Vaidy Sivaraman, 2018, J. Comb. Theory, Ser. B.

Approximating rank-width and clique-width quickly

Sang-il Oum, Sang-il Oum, 2008, ACM Trans. Algorithms.

Rank-Width and Well-Quasi-Ordering

Sang-il Oum, Sang-il Oum, 2008, SIAM J. Discret. Math..

Vertex-minors, monadic second-order logic, and a conjecture by Seese

Bruno Courcelle, Sang-il Oum, B. Courcelle, 2007, J. Comb. Theory, Ser. B.

Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract)

Sang-il Oum, Sang-il Oum, 2011, Electron. Notes Discret. Math..

Majority Colourings of Digraphs

Stephan Kreutzer, Paul D. Seymour, David R. Wood, 2016, Electron. J. Comb..

Constructive algorithm for path-width of matroids pdf

Eun Jung Kim, Sang-il Oum, Jisu Jeong, 2015, SODA.

Computing rank-width exactly

Sang-il Oum, 2009, Inf. Process. Lett..

How to Decompose a Graph into a Tree-Like Structure (Invited Talk)

Sang-il Oum, 2020, ISAAC.

A Polynomial Kernel for 3-Leaf Power Deletion

O-joung Kwon, Eduard Eiben, Sang-il Oum, 2019, MFCS.

Rank-width and tree-width of H-minor-free graphs

Dimitrios M. Thilikos, Fedor V. Fomin, Sang-il Oum, 2009, Eur. J. Comb..

Approximating rank-width and clique-width quickly

Sang-il Oum, Sang-il Oum, 2005, TALG.

Testing branch-width

Paul D. Seymour, Sang-il Oum, P. Seymour, 2007, J. Comb. Theory, Ser. B.

Unavoidable induced subgraphs in large graphs with no homogeneous sets

Paul D. Seymour, Maria Chudnovsky, Sang-il Oum, 2015, J. Comb. Theory, Ser. B.

Excluded vertex-minors for graphs of linear rank-width at most k

O-joung Kwon, Sang-il Oum, Jisu Jeong, 2013, STACS.

Rank-width: Algorithmic and structural results

Sang-il Oum, Sang-il Oum, 2016, Discret. Appl. Math..

Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract)

Sang-il Oum, Sang-il Oum, 2005, Electron. Notes Discret. Math..

Rank-width and vertex-minors

Sang-il Oum, Sang-il Oum, 2005, J. Comb. Theory, Ser. B.

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors

O-joung Kwon, Sang-il Oum, Ilkyoo Choi, 2015, J. Comb. Theory, Ser. B.

Vertex-minors and the Erdős-Hajnal conjecture

Maria Chudnovsky, Sang-il Oum, 2018, Discret. Math..

Dynamic coloring of graphs having no K5 minor

Sangjune Lee, Sang-il Oum, Younjin Kim, 2012, Discret. Appl. Math..

A Relative of Hadwiger's Conjecture

Paul D. Seymour, Katherine Edwards, Jaehoon Kim, 2014, SIAM J. Discret. Math..

Circle graph obstructions under pivoting

James F. Geelen, Sang-il Oum, J. Geelen, 2009, J. Graph Theory.

The “Art of Trellis Decoding” Is Fixed-Parameter Tractable

Eun Jung Kim, Sang-il Oum, Jisu Jeong, 2015, IEEE Transactions on Information Theory.

Partitioning H-minor free graphs into three subgraphs with no large components

Chun-Hung Liu, Sang-il Oum, 2015, Electron. Notes Discret. Math..

Finding branch-decompositions of matroids, hypergraphs, and more

Eun Jung Kim, Sang-il Oum, Jisu Jeong, 2017, ICALP.

Faster algorithms for vertex partitioning problems parameterized by clique-width

Sigve Hortemo Sæther, Martin Vatshelle, Sang-il Oum, 2013, Theor. Comput. Sci..

Partitioning H-minor free graphs into three subgraphs with no large components

Chun-Hung Liu, Sang-il Oum, Sang-il Oum, 2015, Electron. Notes Discret. Math..

Unavoidable vertex-minors in large prime graphs

O-joung Kwon, Sang-il Oum, 2014, Eur. J. Comb..

An FPT 2-Approximation for Tree-cut Decomposition

Dimitrios M. Thilikos, Christophe Paul, Eun Jung Kim, 2015, WAOA.

Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width pdf

O-joung Kwon, Sang-il Oum, Sang-il Oum, 2012, Discret. Appl. Math..

Even-cycle decompositions of graphs with no odd-K4-minor

Tony Huynh, Sang-il Oum, Maryam Verdian-Rizi, 2012, Eur. J. Comb..

Excluding a bipartite circle graph from line graphs

Sang-il Oum, Sang-il Oum, 2009, J. Graph Theory.

Tree pivot-minors and linear rank-width pdf

Daniël Paulusma, Mamadou Moustapha Kanté, O-joung Kwon, 2019, SIAM J. Discret. Math..

Strongly Even-Cycle Decomposable Graphs

Tony Huynh, Andrew D. King, Sang-il Oum, 2017, J. Graph Theory.

Rank‐width is less than or equal to branch‐width

Sang-il Oum, Sang-il Oum, 2008, J. Graph Theory.

Finding Branch-Decompositions and Rank-Decompositions

Petr Hlinený, Sang-il Oum, 2007, ESA.

Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)

Reinhard Diestel, Sang-il Oum, R. Diestel, 2014, WG.

Scattered Classes of Graphs

O-joung Kwon, Sang-il Oum, 2020, SIAM J. Discret. Math..

Online Ramsey theory for a triangle on -free graphs

Sang-il Oum, Jisu Jeong, Hojin Choi, 2019, J. Graph Theory.

Rank‐width of random graphs

Sang-il Oum, Joonkyung Lee, Choongbum Lee, 2010, J. Graph Theory.

Width Parameters Beyond Tree-width and their Applications

Georg Gottlob, Detlef Seese, Petr Hlinený, 2008, Comput. J..

Defective Colouring of Graphs Excluding A Subgraph or Minor

Patrice Ossona de Mendez, David R. Wood, Sang-il Oum, 2016, Comb..

Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015

Christophe Paul, Derek G. Corneil, Sang-il Oum, 2018, Discret. Appl. Math..

Approximating clique-width and branch-width

Paul D. Seymour, Sang-il Oum, P. Seymour, 2006, J. Comb. Theory, Ser. B.

Excluded vertex-minors for graphs of linear rank-width at most k

O-joung Kwon, Sang-il Oum, Jisu Jeong, 2014, Eur. J. Comb..

Certifying large branch-width

Paul D. Seymour, Sang-il Oum, P. Seymour, 2006, SODA '06.

Improper colouring of graphs with no odd clique minor

Dong Yeap Kang, Sang-il Oum, Sang-il Oum, 2016, Combinatorics, Probability and Computing.

Faster Algorithms Parameterized by Clique-width pdf

Sigve Hortemo Sæther, Martin Vatshelle, Sang-il Oum, 2013, ArXiv.

Finding minimum clique capacity

Paul D. Seymour, Maria Chudnovsky, Sang-il Oum, 2012, Comb..

The average cut-rank of graphs

Sang-il Oum, Huy-Tung Nguyen, 2020, Eur. J. Comb..

Number of Cliques in Graphs with a Forbidden Subdivision

Sang-il Oum, Choongbum Lee, 2015, SIAM J. Discret. Math..

Chi-boundedness of graph classes excluding wheel vertex-minors

Paul Wollan, Ho-Jin Choi, O-joung Kwon, 2017, Electron. Notes Discret. Math..

Finding Branch-Decompositions and Rank-Decompositions

Petr Hlinený, Sang-il Oum, Sang-il Oum, 2007, SIAM J. Comput..

Deciding first order logic properties of matroids pdf

Daniel Král, Tomas Gavenciak, Sang-il Oum, 2011, ArXiv.

Branch-depth: Generalizing tree-depth of graphs

Matt DeVos, O-joung Kwon, Sang-il Oum, 2019, Eur. J. Comb..

Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs

Chun-Hung Liu, Sang-il Oum, Ilkyoo Choi, 2018, SIAM J. Discret. Math..

An FPT 2-Approximation for Tree-Cut Decomposition

Dimitrios M. Thilikos, Christophe Paul, Eun Jung Kim, 2015, Algorithmica.

Obstructions for bounded shrub-depth and rank-depth pdf

Paul Wollan, O-joung Kwon, Sang-il Oum, 2019, ArXiv.

Perfect Matchings in Claw-free Cubic Graphs

Sang-il Oum, 2011, Electron. J. Comb..

A Remark on the Paper “Properties of Intersecting Families of Ordered Sets” by O. Einstein

Sang-il Oum, Sounggun Wee, 2018, Comb..

Characterizing matroids whose bases form graphic delta-matroids

Sang-il Oum, Duksang Lee, 2022, Eur. J. Comb..

A chain theorem for sequentially $3$-rank-connected graphs with respect to vertex-minors

Sang-il Oum, Duksang Lee, 2021 .

3-Degenerate induced subgraph of a planar graph

Xuding Zhu, Hal A. Kierstead, Hao Qi, 2022, J. Graph Theory.

Intertwining connectivities for vertex-minors and pivot-minors

Sang-il Oum, Duksang Lee, 2021 .

Obstructions for bounded shrub-depth and rank-depth

Paul Wollan, O-joung Kwon, Sang-il Oum, 2021, J. Comb. Theory, Ser. B.

Equitable partition of planar graphs

Sang-il Oum, Xin Zhang, Ringi Kim, 2021, Discret. Math..

A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups

Ken-ichi Kawarabayashi, J. Pascal Gollin, O-joung Kwon, 2021, Journal of the London Mathematical Society.

Bounds for the Twin-width of Graphs pdf

Sang-il Oum, Donggyu Kim, Kevin Hendrey, 2021, ArXiv.

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k

O-joung Kwon, Sang-il Oum, Eun Jung Kim, 2021 .

Graphs of bounded depth-2 rank-brittleness

O-joung Kwon, Sang-il Oum, 2021, J. Graph Theory.

$\Gamma$-graphic delta-matroids and their applications

Sang-il Oum, Donggyu Kim, Duksang Lee, 2021 .

$\Gamma$-graphic delta-matroids and its applications

Sang-il Oum, Donggyu Kim, Duksang Lee, 2021 .

An upper bound on tricolored ordered sum-free sets

Sang-il Oum, Taegyun Kim, Sang-il Oum, 2017 .

Finding branch-decomposition and rank-decomposition

Petr Hliněný, Sang-il Oum, 2008 .

Unifying duality theorems for width parameters in graphs and matroids II. General duality

Reinhard Diestel, Sang-il Oum, R. Diestel, 2014, 1406.3798.

Tangle-tree duality in abstract separation systems

Reinhard Diestel, Sang-il Oum, R. Diestel, 2017, 1701.02509.

Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices

Sang-il Oum, Sang-il Oum, 2010, 1007.3807.

Circle graph obstructions under pivoting

Sang-il Oum, Jim Geelen, 2009 .