Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Sang-il Oum is active.

Publication


Featured researches published by Sang-il Oum.


The Computer Journal | 2008

Width Parameters Beyond Tree-width and their Applications

Petr Hliněný; Sang-il Oum; Detlef Seese; Georg Gottlob

Besides the very successful concept of tree-width (see [Bodlaender, H. and Koster, A. (2007) Combinatorial optimisation on graphs of bounded treewidth. These are special issues on Parameterized Complexity]), many concepts and parameters measuring the similarity or dissimilarity of structures compared to trees have been born and studied over the past years. These concepts and parameters have proved to be useful tools in many applications, especially in the design of efficient algorithms. Our presented novel look at the contemporary developments of these ‘width’ parameters in combinatorial structures delivers—besides traditional tree-width and derived dynamic programming schemes—also a number of other useful parameters like branch-width, rank-width (clique-width) or hypertree-width. In this contribution, we demonstrate how ‘width’ parameters of graphs and generalized structures (such as matroids or hypergraphs), can be used to improve the design of parameterized algorithms and the structural analysis in other applications on an abstract level.


SIAM Journal on Computing | 2008

Finding Branch-Decompositions and Rank-Decompositions

Petr Hliněný; Sang-il Oum

We present a new algorithm that can output the rank-decomposition of width at most


Journal of Combinatorial Theory | 2007

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

Bruno Courcelle; Sang-il Oum

k


SIAM Journal on Discrete Mathematics | 2008

Rank-Width and Well-Quasi-Ordering

Sang-il Oum

of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most


workshop on graph theoretic concepts in computer science | 2005

Approximating rank-width and clique-width quickly

Sang-il Oum

k


Journal of Combinatorial Theory | 2007

Testing branch-width

Sang-il Oum; Paul D. Seymour

if such exists. This algorithm works also for partitioned matroids. Both of these algorithms are fixed-parameter tractable, that is, they run in time


Journal of Graph Theory | 2012

Rank-width of random graphs

Choongbum Lee; Joonkyung Lee; Sang-il Oum

O(n^3)


Transactions of the American Mathematical Society | 2016

CLASSIFICATION OF REAL BOTT MANIFOLDS AND ACYCLIC DIGRAPHS

Suyoung Choi; Mikiya Masuda; Sang-il Oum

where


european symposium on algorithms | 2007

Finding branch-decompositions and rank-decompositions

Petr Hliněný; Sang-il Oum

n


SIAM Journal on Discrete Mathematics | 2015

A Relative of Hadwiger's Conjecture

Katherine Edwards; Dong Yeap Kang; Jaehoon Kim; Sang-il Oum; Paul D. Seymour

is the number of vertices / elements of the input, for each constant value of

Collaboration


Dive into the Sang-il Oum's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

O-joung Kwon

Technical University of Berlin

View shared research outputs
Top Co-Authors

Avatar

Eun Jung Kim

Paris Dauphine University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Christophe Paul

University of Montpellier

View shared research outputs
Top Co-Authors

Avatar

Choongbum Lee

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge