According to our database
1,
Sang-il Oum
authored at least 86 papers
between 2005 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
Prime vertex-minors of a prime graph.
Eur. J. Comb., 2024
Vertex-minors of graphs: A survey.
Discret. Appl. Math., 2024
Colouring t-perfect graphs.
CoRR, 2024
2023
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors.
Eur. J. Comb., October, 2023
Γ-Graphic Delta-Matroids and Their Applications.
Comb., October, 2023
A Polynomial Kernel for 3-Leaf Power Deletion.
Algorithmica, October, 2023
Obstructions for matroids of path-width at most <i>k</i> and graphs of linear rank-width at most <i>k</i>.
J. Comb. Theory B, May, 2023
Intertwining Connectivities for Vertex-Minors and Pivot-Minors.
SIAM J. Discret. Math., March, 2023
Independent domination of graphs with bounded maximum degree.
J. Comb. Theory B, 2023
Rank connectivity and pivot-minors of graphs.
Eur. J. Comb., 2023
Reuniting χ-boundedness with polynomial χ-boundedness.
CoRR, 2023
Twin-width of subdivisions of multigraphs.
CoRR, 2023
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Bounds for the Twin-Width of Graphs.
SIAM J. Discret. Math., September, 2022
3-Degenerate induced subgraph of a planar graph.
J. Graph Theory, 2022
Characterizing matroids whose bases form graphic delta-matroids.
Eur. J. Comb., 2022
Obstructions for partitioning into forests and outerplanar graphs.
Discret. Appl. Math., 2022
Twin-width of random graphs.
CoRR, 2022
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs.
CoRR, 2022
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
2021
Finding Branch-Decompositions of Matroids, Hypergraphs, and More.
SIAM J. Discret. Math., 2021
Tree Pivot-Minors and Linear Rank-Width.
SIAM J. Discret. Math., 2021
Graphs of bounded depth-2 rank-brittleness.
J. Graph Theory, 2021
Obstructions for bounded shrub-depth and rank-depth.
J. Comb. Theory B, 2021
Equitable partition of planar graphs.
Discret. Math., 2021
The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor.
Electron. J. Comb., 2021
2020
Scattered Classes of Graphs.
SIAM J. Discret. Math., 2020
Classes of graphs with no long cycle as a vertex-minor are polynomially <i>χ</i>-bounded.
J. Comb. Theory, Ser. B, 2020
The average cut-rank of graphs.
Eur. J. Comb., 2020
Branch-depth: Generalizing tree-depth of graphs.
Eur. J. Comb., 2020
How to Decompose a Graph into a Tree-Like Structure (Invited Talk).
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
2019
Online Ramsey theory for a triangle on -free graphs.
J. Graph Theory, 2019
Chi-boundedness of graph classes excluding wheel vertex-minors.
J. Comb. Theory B, 2019
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs.
Discret. Appl. Math., 2019
Improper colouring of graphs with no odd clique minor.
Comb. Probab. Comput., 2019
Defective Colouring of Graphs Excluding A Subgraph or Minor.
Comb., 2019
Tangle-Tree Duality: In Graphs, Matroids and Beyond.
Comb., 2019
2018
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs.
SIAM J. Discret. Math., 2018
Partitioning <i>H</i>-minor free graphs into three subgraphs with no large components.
J. Comb. Theory B, 2018
Vertex-minors and the Erdős-Hajnal conjecture.
Discret. Math., 2018
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015.
Discret. Appl. Math., 2018
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded.
CoRR, 2018
A Remark on the Paper "Properties of Intersecting Families of Ordered Sets" by O. Einstein.
Comb., 2018
An FPT 2-Approximation for Tree-Cut Decomposition.
Algorithmica, 2018
Computing Small Pivot-Minors.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
2017
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable.
IEEE Trans. Inf. Theory, 2017
Strongly Even-Cycle Decomposable Graphs.
J. Graph Theory, 2017
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors.
J. Comb. Theory B, 2017
Even-cycle decompositions of graphs with no odd-K<sub>4</sub>-minor.
Eur. J. Comb., 2017
Rank-width: Algorithmic and structural results.
Discret. Appl. Math., 2017
Majority Colourings of Digraphs.
Electron. J. Comb., 2017
2016
Unavoidable induced subgraphs in large graphs with no homogeneous sets.
J. Comb. Theory B, 2016
Dynamic coloring of graphs having no K<sub>5</sub> minor.
Discret. Appl. Math., 2016
Constructive algorithm for path-width of matroids.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
Number of Cliques in Graphs with a Forbidden Subdivision.
SIAM J. Discret. Math., 2015
A Relative of Hadwiger's Conjecture.
SIAM J. Discret. Math., 2015
Partitioning H-minor free graphs into three subgraphs with no large components.
Electron. Notes Discret. Math., 2015
2014
Faster algorithms for vertex partitioning problems parameterized by clique-width.
Theor. Comput. Sci., 2014
Unavoidable vertex-minors in large prime graphs.
Eur. J. Comb., 2014
Excluded vertex-minors for graphs of linear rank-width at most k.
Eur. J. Comb., 2014
Graphs of small rank-width are pivot-minors of graphs of small tree-width.
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
2013
Faster Algorithms Parameterized by Clique-width.
CoRR, 2013
2012
Rank-width of random graphs.
J. Graph Theory, 2012
Finding minimum clique capacity.
Comb., 2012
Deciding First Order Properties of Matroids.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2011
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract).
Electron. Notes Discret. Math., 2011
Deciding first order logic properties of matroids
CoRR, 2011
Perfect Matchings in Claw-free Cubic Graphs.
Electron. J. Comb., 2011
2010
Rank-width and tree-width of H-minor-free graphs.
Eur. J. Comb., 2010
2009
Excluding a bipartite circle graph from line graphs.
J. Graph Theory, 2009
Circle graph obstructions under pivoting.
J. Graph Theory, 2009
Computing rank-width exactly.
Inf. Process. Lett., 2009
2008
Approximating rank-width and clique-width quickly.
ACM Trans. Algorithms, 2008
Rank-Width and Well-Quasi-Ordering.
SIAM J. Discret. Math., 2008
Finding Branch-Decompositions and Rank-Decompositions.
SIAM J. Comput., 2008
Rank-width is less than or equal to branch-width.
J. Graph Theory, 2008
Width Parameters Beyond Tree-width and their Applications.
Comput. J., 2008
2007
Vertex-minors, monadic second-order logic, and a conjecture by Seese.
J. Comb. Theory B, 2007
2006
Approximating clique-width and branch-width.
J. Comb. Theory B, 2006
Certifying large branch-width.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
2005
Rank-width and vertex-minors.
J. Comb. Theory B, 2005
Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract).
Electron. Notes Discret. Math., 2005
