Browse "MA-Journal Papers(저널논문)" by Subject Parameterized complexity

Showing results 1 to 2 of 2

1
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

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

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

rss_1.0 rss_2.0 atom_1.0