Search

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

Results 1-5 of 5 (Search time: 0.006 seconds).

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

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

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

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

3
Unavoidable vertex-minors in large prime graphs

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

4
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable

Jeong, Jisu; Kim, Eun Jung; Oum, Sang-ilresearcher, IEEE TRANSACTIONS ON INFORMATION THEORY, v.63, no.11, pp.7178 - 7205, 2017-11

5
Rank-width: algorithmic and structural results

Oum, Sang-ilresearcher, DISCRETE APPLIED MATHEMATICS, v.231, pp.15 - 24, 2017-11

rss_1.0 rss_2.0 atom_1.0