Sang-il Oum

From MaRDI portal
Revision as of 22:39, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Sang-il Oum to Sang-il Oum: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:256976

Available identifiers

zbMath Open oum.sang-ilDBLP23/6820WikidataQ95719643 ScholiaQ95719643MaRDI QIDQ256976

List of research outcomes





PublicationDate of PublicationType
Space-efficient parameterized algorithms on graphs of low shrubdepth2025-01-06Paper
Twin-width of random graphs2024-11-20Paper
Tree pivot-minors and linear rank-width2024-10-18Paper
Vertex-minors of graphs: a survey2024-04-30Paper
Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)2024-04-23Paper
Prime vertex-minors of a prime graph2024-03-26Paper
A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q61878392024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60653882023-11-14Paper
Computing pivot-minors2023-11-08Paper
Reuniting $\chi$-boundedness with polynomial $\chi$-boundedness2023-10-17Paper
A polynomial kernel for 3-leaf power deletion2023-10-06Paper
3‐Degenerate induced subgraph of a planar graph2023-10-04Paper
\(\Gamma\)-graphic delta-matroids and their applications2023-10-04Paper
Graphs of bounded depth‐2 rank‐brittleness2023-09-29Paper
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors2023-08-10Paper
Note on Hamiltonicity of basis graphs of even delta-matroids2023-08-10Paper
Twin-width of subdivisions of multigraphs2023-06-08Paper
Intertwining Connectivities for Vertex-Minors and Pivot-Minors2023-03-30Paper
Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)2023-03-23Paper
Rank connectivity and pivot-minors of graphs2022-12-01Paper
Independent domination of graphs with bounded maximum degree2022-11-28Paper
Bounds for the Twin-Width of Graphs2022-10-06Paper
A unified Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups2022-09-20Paper
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs2022-08-17Paper
https://portal.mardi4nfdi.de/entity/Q50891632022-07-18Paper
Obstructions for partitioning into forests and outerplanar graphs2022-03-24Paper
Characterizing matroids whose bases form graphic delta-matroids2022-01-13Paper
Tree Pivot-Minors and Linear Rank-Width2022-01-07Paper
Finding Branch-Decompositions of Matroids, Hypergraphs, and More2021-12-01Paper
Obstructions for Bounded Branch-depth in Matroids2021-11-05Paper
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k2021-09-25Paper
Finding branch-decompositions of matroids, hypergraphs, and more2021-07-28Paper
Obstructions for bounded shrub-depth and rank-depth2021-06-18Paper
Intertwining connectivities for vertex-minors and pivot-minors2021-06-07Paper
Equitable partition of planar graphs2021-04-28Paper
The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor2021-04-12Paper
The average cut-rank of graphs2021-02-08Paper
Branch-depth: generalizing tree-depth of graphs2021-02-08Paper
Tangle-tree duality in abstract separation systems2020-12-30Paper
Fragile minor-monotone parameters under random edge perturbation2020-05-20Paper
Scattered Classes of Graphs2020-04-07Paper
Improper colouring of graphs with no odd clique minor2020-04-06Paper
Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded2020-01-15Paper
Tangle-tree duality: in graphs, matroids and beyond2019-11-21Paper
A polynomial kernel for $3$-leaf power deletion2019-11-11Paper
Online Ramsey theory for a triangle on ‐free graphs2019-10-31Paper
Defective colouring of graphs excluding a subgraph or minor2019-09-04Paper
Graphs of bounded depth-$2$ rank-brittleness2019-06-13Paper
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs2019-03-11Paper
Chi-boundedness of graph classes excluding wheel vertex-minors2019-02-08Paper
A remark on the paper ``Properties of intersecting families of ordered sets by O. Einstein2019-02-01Paper
Computing small pivot-minors2018-11-22Paper
Approximating rank-width and clique-width quickly2018-11-05Paper
Vertex-minors and the Erdős-Hajnal conjecture2018-10-23Paper
Constructive algorithm for path-width of matroids2018-07-16Paper
The “Art of Trellis Decoding” Is Fixed-Parameter Tractable2018-06-27Paper
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs2018-06-07Paper
An FPT 2-approximation for tree-cut decomposition2018-02-28Paper
Chi-boundedness of graph classes excluding wheel vertex-minors2018-01-18Paper
Partitioning \(H\)-minor free graphs into three subgraphs with no large components2017-11-28Paper
Rank-width: algorithmic and structural results2017-09-12Paper
Even-cycle decompositions of graphs with no odd-\(K_4\)-minor2017-08-31Paper
An upper bound on tricolored ordered sum-free sets2017-08-23Paper
Majority colourings of digraphs2017-06-13Paper
Strongly Even-Cycle Decomposable Graphs2017-02-01Paper
Excluded vertex-minors for graphs of linear rank-width at most k.2017-01-30Paper
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors2017-01-26Paper
Classification of real Bott manifolds and acyclic digraphs2017-01-10Paper
Partitioning \(H\)-minor free graphs into three subgraphs with no large components2016-10-14Paper
Dynamic coloring of graphs having no \(K_5\) minor2016-05-02Paper
Unavoidable induced subgraphs in large graphs with no homogeneous sets2016-03-14Paper
An FPT 2-approximation for tree-cut decomposition2016-02-26Paper
A Relative of Hadwiger's Conjecture2016-01-04Paper
Number of Cliques in Graphs with a Forbidden Subdivision2015-10-30Paper
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)2015-09-09Paper
Hyperbolic surface subgroups of one-ended doubles of free groups2014-12-22Paper
Unavoidable vertex-minors in large prime graphs2014-09-02Paper
Excluded vertex-minors for graphs of linear rank-width at most \(k\)2014-09-02Paper
Faster algorithms for vertex partitioning problems parameterized by clique-width2014-04-29Paper
Graphs of small rank-width are pivot-minors of graphs of small tree-width2014-04-02Paper
Guest editors' foreword2014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q28574292013-11-01Paper
Finding minimum clique capacity2013-08-06Paper
Deciding First Order Properties of Matroids2012-11-01Paper
Rank-width of random graphs2012-07-10Paper
Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices2012-04-19Paper
Perfect matchings in claw-free cubic graphs2011-06-01Paper
Rank-width and tree-width of \(H\)-minor-free graphs2010-10-18Paper
Computing rank-width exactly2010-08-20Paper
Certifying large branch-width2010-08-16Paper
Real Bott manifolds and acyclic digraphs2010-02-25Paper
Finding Branch-Decompositions and Rank-Decompositions2009-06-22Paper
Circle graph obstructions under pivoting2009-06-16Paper
Rank-Width and Well-Quasi-Ordering2009-05-27Paper
Excluding a bipartite circle graph from line graphs2009-03-04Paper
Finding Branch-Decompositions and Rank-Decompositions2008-09-25Paper
Rank‐width is less than or equal to branch‐width2008-03-20Paper
Rank-width and Well-quasi-ordering of Skew-symmetric Matrices2007-05-29Paper
Testing branch-width2007-04-16Paper
Vertex-minors, monadic second-order logic, and a conjecture by Seese2007-01-11Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
Approximating clique-width and branch-width2006-07-12Paper
Rank-width and vertex-minors2005-09-28Paper
Linear bounds on treewidth in terms of excluded planar minorsN/APaper
Twin-width of random graphsN/APaper

Research outcomes over time

This page was built for person: Sang-il Oum