Følg
O-joung Kwon
Tittel
Sitert av
Sitert av
År
Neighborhood complexity and kernelization for nowhere dense classes of graphs
K Eickmeyer, AC Giannopoulou, S Kreutzer, O Kwon, M Pilipczuk, ...
arXiv preprint arXiv:1612.08197, 2016
462016
Mim-width III. Graph powers and generalized distance domination problems
L Jaffke, O Kwon, TJF Strømme, JA Telle
Theoretical Computer Science 796, 216-236, 2019
302019
A width parameter useful for chordal and co-comparability graphs
DY Kang, O Kwon, TJF Strømme, JA Telle
Theoretical Computer Science 704, 1-17, 2017
292017
Excluded vertex-minors for graphs of linear rank-width at most k
J Jeong, O Kwon, S Oum
European Journal of Combinatorics 41, 242-257, 2014
242014
Mim-width II. The feedback vertex set problem
L Jaffke, O Kwon, JA Telle
Algorithmica 82 (1), 118-145, 2020
232020
Erdős-Pósa property of chordless cycles and its applications
EJ Kim, O Kwon
Journal of Combinatorial Theory, Series B 145, 65-112, 2020
222020
Mim-width I. Induced path problems
L Jaffke, O Kwon, JA Telle
Discrete Applied Mathematics 278, 153-168, 2020
222020
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm
I Adler, MM Kanté, O Kwon
Algorithmica 78 (1), 342-377, 2017
202017
Measuring what matters: A hybrid approach to dynamic programming with treewidth
E Eiben, R Ganian, T Hamm, O Kwon
Journal of Computer and System Sciences 121, 57-75, 2021
192021
On low rank-width colorings
O Kwon, M Pilipczuk, S Siebertz
European Journal of Combinatorics 83, 103002, 2020
192020
The directed flat wall theorem
AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
162020
The grid theorem for vertex-minors
J Geelen, O Kwon, R McCarty, P Wollan
Journal of Combinatorial Theory, Series B, 2020
152020
A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
L Jaffke, O Kwon, JA Telle
arXiv preprint arXiv:1710.07148, 2017
152017
Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width
L Jaffke, O Kwon, JA Telle
arXiv preprint arXiv:1708.04536, 2017
142017
Graphs of small rank-width are pivot-minors of graphs of small tree-width
O Kwon, S Oum
Discrete Applied Mathematics 168, 108-118, 2014
142014
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
É Bonnet, N Brettell, O Kwon, D Marx
Algorithmica 81 (10), 3890-3935, 2019
132019
A polynomial kernel for distance-hereditary vertex deletion
EJ Kim, O Kwon
Workshop on Algorithms and Data Structures, 509-520, 2017
132017
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded
R Kim, O Kwon, S Oum, V Sivaraman
Journal of Combinatorial Theory, Series B 140, 372-386, 2020
122020
Generalized distance domination problems and their complexity on graphs of bounded mim-width
L Jaffke, O Kwon, TJF Strømme, JA Telle
arXiv preprint arXiv:1803.03514, 2018
122018
Obstructions for bounded shrub-depth and rank-depth
O Kwon, R McCarty, S Oum, P Wollan
Journal of Combinatorial Theory, Series B 149, 76-91, 2021
112021
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20