DSpace at KOASAS
Search

Search

Start a new search
Current filters:
Add filters:
  • Results/Page
  • Sort items by
  • In order
  • Authors/record

Results 11-20 of 68 (Search time: 0.01 seconds).

NO Title, Author(s) (Publication Title, Volume Issue, Page, Issue Date)
11
Faster algorithms for vertex partitioning problems parameterized by clique-width

Oum, Sang-il; Saether, Sigve Hortemo; Vatshelle, Martin, THEORETICAL COMPUTER SCIENCE, v.535, pp.16 - 24, 2014-05

12
Graphs of small rank-width are pivot-minors of graphs of small tree-width

Kwon, O-Joung; Oum, Sang-il, DISCRETE APPLIED MATHEMATICS, v.168, pp.108 - 118, 2014-05

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

Jeong, Jisu; Kwon, O-Joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.41, pp.242 - 257, 2014-10

14
Unavoidable vertex-minors in large prime graphs

Kwon, O-Joung; Oum, Sang-il, EUROPEAN JOURNAL OF COMBINATORICS, v.41, pp.100 - 127, 2014-10

15
Approximating Rank-Width and Clique-Width Quickly

Oum, Sang-il, ACM TRANSACTIONS ON ALGORITHMS , v.5, no.1, pp.1 - 20, 2008-11

16
Rank-width and well-quasi-ordering

Oum, Sang-il, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.22, no.2, pp.666 - 682, 2008

17
Finding branch-decompositions and rank-decompositions

Hlineny, P; Oum, Sang-il, SIAM JOURNAL ON COMPUTING, v.38, no.3, pp.1012 - 1032, 2008

18
Circle Graph Obstructions Under Pivoting

Geelen, Jim; Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.61, no.1, pp.1 - 11, 2009-05

19
Computing rank-width exactly

Oum, Sang-il, INFORMATION PROCESSING LETTERS, v.109, no.13, pp.745 - 748, 2009-06

20
Excluding a Bipartite Circle Graph from Line Graphs

Oum, Sang-il, JOURNAL OF GRAPH THEORY, v.60, no.3, pp.183 - 203, 2009-03

Discover

rss_1.0 rss_2.0 atom_1.0