Oum Sang-il
#155,954
Most Influential Person Now
Ph.D. Princeton University 2005
Why Is Oum Sang-il Influential?
(Suggest an Edit or Addition)According to Wikipedia, Oum Sang-il is a Korean mathematician working in graph theory and discrete mathematics. He is a tenured professor in the Department of Mathematical Sciences at KAIST and the chief investigator of the Discrete Mathematics Group in the Pioneer Research Center for Mathematical and Computational Sciences at the Institute for Basic Science. He is known for his work on structural graph theory and in particular for structures and algorithms relating to rank-width, clique-width, and branch-width. He published more than 45 journal papers.
Oum Sang-il's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Approximating clique-width and branch-width (2006) (468)
- Rank-width and vertex-minors (2005) (199)
- Width Parameters Beyond Tree-width and their Applications (2008) (170)
- Finding Branch-Decompositions and Rank-Decompositions (2007) (142)
- Approximating rank-width and clique-width quickly (2005) (125)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (2007) (109)
- Rank-Width and Well-Quasi-Ordering (2008) (57)
- Graphs of bounded rank-width (2005) (54)
- Approximating rank-width and clique-width quickly (2008) (50)
- Tangle-tree duality in abstract separation systems (2017) (45)
- Testing branch-width (2007) (42)
- Rank‐width is less than or equal to branch‐width (2008) (42)
- Rank-width: Algorithmic and structural results (2016) (39)
- Finding branch-decomposition and rank-decomposition (2008) (35)
- Rank‐width of random graphs (2010) (34)
- Circle graph obstructions under pivoting (2009) (33)
- A Relative of Hadwiger's Conjecture (2014) (31)
- Tangle-Tree Duality: In Graphs, Matroids and Beyond (2017) (30)
- Partitioning H-minor free graphs into three subgraphs with no large components (2015) (29)
- Rank-width and tree-width of H-minor-free graphs (2009) (28)
- Classification of real Bott manifolds and acyclic digraphs (2010) (28)
- Defective Colouring of Graphs Excluding A Subgraph or Minor (2016) (27)
- Excluding a bipartite circle graph from line graphs (2009) (26)
- An FPT 2-Approximation for Tree-Cut Decomposition (2015) (25)
- Constructive algorithm for path-width of matroids (2015) (19)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (2013) (18)
- Excluded vertex-minors for graphs of linear rank-width at most k (2013) (18)
- Rank-width is less than or equal to branch-width (2008) (15)
- Unavoidable induced subgraphs in large graphs with no homogeneous sets (2015) (14)
- Perfect Matchings in Claw-free Cubic Graphs (2009) (14)
- Improper colouring of graphs with no odd clique minor (2016) (14)
- Obstructions for bounded shrub-depth and rank-depth (2019) (14)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (2010) (13)
- The “Art of Trellis Decoding” Is Fixed-Parameter Tractable (2015) (13)
- Unifying duality theorems for width parameters in graphs and matroids II. General duality (2014) (12)
- Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded (2018) (12)
- Finding branch-decompositions of matroids, hypergraphs, and more (2017) (12)
- Computing rank-width exactly (2009) (11)
- Unifying duality theorems for width parameters in graphs and matroids. I. Weak and strong duality (2014) (11)
- Number of Cliques in Graphs with a Forbidden Subdivision (2014) (11)
- Majority Colourings of Digraphs (2016) (10)
- Branch-depth: Generalizing tree-depth of graphs (2019) (10)
- Hyperbolic surface subgroups of one‐ended doubles of free groups (2010) (10)
- Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width (2012) (9)
- Bounds for the Twin-width of Graphs (2021) (9)
- Unavoidable vertex-minors in large prime graphs (2013) (9)
- Even-cycle decompositions of graphs with no odd-K4-minor (2012) (8)
- Dynamic coloring of graphs having no K5 minor (2012) (8)
- Chi-boundedness of graph classes excluding wheel vertex-minors (2017) (7)
- Vertex-minors and the Erdős-Hajnal conjecture (2018) (7)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (2015) (6)
- Deciding First Order Properties of Matroids (2012) (6)
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract) (2014) (6)
- Certifying large branch-width (2006) (6)
- Computing Small Pivot-Minors (2018) (5)
- Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract) (2005) (4)
- Strongly Even‐Cycle Decomposable Graphs (2012) (4)
- Equitable partition of planar graphs (2019) (3)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (2018) (3)
- Deciding first order logic properties of matroids (2011) (3)
- A polynomial kernel for $3$-leaf power deletion (2019) (3)
- Scattered Classes of Graphs (2018) (3)
- Rank connectivity and pivot-minors of graphs (2020) (3)
- Branch‐Width and Tangles (2011) (3)
- Independent domination of graphs with bounded maximum degree (2022) (2)
- An upper bound on tricolored ordered sum-free sets (2017) (2)
- The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor (2020) (2)
- Γ-graphic delta-matroids and its applications (2021) (2)
- A unified half-integral Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups (2021) (2)
- Finding minimum clique capacity (2012) (2)
- Algorithm for recognizing rank-width at most k and the well-quasi-ordering of the vertex-minor relation (2004) (2)
- Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract) (2011) (1)
- An FPT 2-Approximation for Tree-Cut Decomposition (2016) (1)
- A Remark on the Paper “Properties of Intersecting Families of Ordered Sets” by O. Einstein (2017) (1)
- Real Bott manifolds and acyclic digraphs (2010) (1)
- The average cut-rank of graphs (2019) (1)
- The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs (2022) (1)
- Number of cliques in graphs with forbidden minor (2014) (1)
- Graphs of bounded depth‐2 rank‐brittleness (2019) (1)
- Obstructions for Bounded Branch-depth in Matroids (2020) (1)
- Faster Algorithms Parameterized by Clique-width (2013) (1)
- Fragile minor-monotone parameters under random edge perturbation (2020) (1)
- Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k (2021) (1)
- 3‐Degenerate induced subgraph of a planar graph (2020) (0)
- Doubles of free groups and hyperbolic surface subgroups (2012) (0)
- Rank-width and tree-width of <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://w (2010) (0)
- A Remark on the Paper “Properties of Intersecting Families of Ordered Sets” by O. Einstein (2018) (0)
- Defective coloring of graphs with excluded subgraphs (2016) (0)
- $\Gamma$-graphic delta-matroids and its applications (2021) (0)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (2016) (0)
- Γ-Graphic Delta-Matroids and Their Applications (2021) (0)
- How to Decompose a Graph into a Tree-Like Structure (Invited Talk) (2020) (0)
- Online Ramsey theory for a triangle on F ‐free graphs (2019) (0)
- Twin-width of random graphs (2022) (0)
- Guest editors' foreword (2014) (0)
- Obstructions for partitioning into forests (2019) (0)
- Intertwining Connectivities for Vertex-Minors and Pivot-Minors (2021) (0)
- A chain theorem for sequentially $3$-rank-connected graphs with respect to vertex-minors (2021) (0)
- $\Gamma$-graphic delta-matroids and their applications (2021) (0)
- Finding branch-decomposition and rank-decomposition (Extendedabstract) (2007) (0)
- Obstructions for partitioning into forests and outerplanar graphs (2020) (0)
- Prime vertex-minors of a prime graph (2022) (0)
- Tree pivot-minors and linear rank-width (2019) (0)
- Rank-width, Clique-width and Vertex-minors (2004) (0)
- A unified Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups (2022) (0)
- C O ] 2 0 N ov 2 01 7 A remark on the paper “ Properties of intersecting families of ordered sets ” by O . (2018) (0)
- Characterizing matroids whose bases form graphic delta-matroids (2020) (0)
- Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015 (2018) (0)
- Vertex-disjoint large induced forests in graphs (2019) (0)
- Replace Clique-width with Rank-width (2004) (0)
- Constructive algorithm for path-width and branch-width of matroids and rank-width of graphs (2015) (0)
- Finding minimum clique capacity (2012) (0)
- Defective Colouring of Graphs Excluding A Subgraph or Minor (2018) (0)
This paper list is powered by the following services:
Other Resources About Oum Sang-il
What Schools Are Affiliated With Oum Sang-il?
Oum Sang-il is affiliated with the following schools:
