Follow
O-joung Kwon
Title
Cited by
Cited by
Year
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
532016
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
352019
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
322017
Mim-width II. The feedback vertex set problem
L Jaffke, O Kwon, JA Telle
Algorithmica 82 (1), 118-145, 2020
312020
Mim-width I. Induced path problems
L Jaffke, O Kwon, JA Telle
Discrete Applied Mathematics 278, 153-168, 2020
292020
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
272021
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
252020
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
252014
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
╔ Bonnet, O Kwon, DR Wood
arXiv preprint arXiv:2202.11858, 2022
212022
The grid theorem for vertex-minors
J Geelen, O Kwon, R McCarty, P Wollan
Journal of Combinatorial Theory, Series B 158, 93-116, 2023
202023
On low rank-width colorings
O Kwon, M Pilipczuk, S Siebertz
European Journal of Combinatorics 83, 103002, 2020
192020
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm
I Adler, MM KantÚ, O Kwon
Algorithmica 78, 342-377, 2017
192017
Branch-depth: Generalizing tree-depth of graphs
M DeVos, O Kwon, S Oum
European Journal of Combinatorics 90, 103186, 2020
182020
The directed flat wall theorem
AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discreteá…, 2020
172020
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
162021
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
162017
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
162014
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, 3890-3935, 2019
152019
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
152017
A polynomial kernel for block graph deletion
EJ Kim, O Kwon
Algorithmica 79, 251-270, 2017
142017
The system can't perform the operation now. Try again later.
Articles 1–20