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
642016
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
512019
Mim-width I. Induced path problems
L Jaffke, O Kwon, JA Telle
Discrete Applied Mathematics 278, 153-168, 2020
472020
Mim-width II. The feedback vertex set problem
L Jaffke, O Kwon, JA Telle
Algorithmica 82 (1), 118-145, 2020
452020
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
412017
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
402022
Branch-depth: Generalizing tree-depth of graphs
M DeVos, O Kwon, S Oum
European Journal of Combinatorics 90, 103186, 2020
332020
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
322021
The grid theorem for vertex-minors
J Geelen, O Kwon, R McCarty, P Wollan
Journal of Combinatorial Theory, Series B 158, 93-116, 2023
312023
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
282014
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
272020
On low rank-width colorings
O Kwon, M Pilipczuk, S Siebertz
European Journal of Combinatorics 83, 103002, 2020
262020
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm
I Adler, MM Kanté, O Kwon
Algorithmica 78, 342-377, 2017
252017
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
242021
The directed flat wall theorem
AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
242020
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
212014
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
182017
Directed tangle tree-decompositions and applications∗
AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
162022
A unifying framework for characterizing and computing width measures
E Eiben, R Ganian, T Hamm, L Jaffke, O Kwon
arXiv preprint arXiv:2109.14610, 2021
162021
An optimal XP algorithm for hamiltonian cycle on graphs of bounded clique-width
B Bergougnoux, MM Kanté, O Kwon
Algorithmica 82 (6), 1654-1674, 2020
162020
The system can't perform the operation now. Try again later.
Articles 1–20