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 | 33 | 2016 |

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 | 22 | 2014 |

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 | 15 | 2017 |

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 | 14 | 2020 |

On low rank-width colorings O Kwon, M Pilipczuk, S Siebertz European Journal of Combinatorics 83, 103002, 2020 | 14 | 2020 |

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 | 14 | 2017 |

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 | 13 | 2017 |

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 | 12 | 2014 |

Mim-width II. The feedback vertex set problem L Jaffke, O Kwon, JA Telle Algorithmica 82 (1), 118-145, 2020 | 11 | 2020 |

Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm I Adler, MM Kanté, O Kwon Algorithmica 78 (1), 342-377, 2017 | 11 | 2017 |

A polynomial kernel for block graph deletion EJ Kim, O Kwon Algorithmica 79 (1), 251-270, 2017 | 10 | 2017 |

A polynomial kernel for distance-hereditary vertex deletion EJ Kim, O Kwon Workshop on Algorithms and Data Structures, 509-520, 2017 | 10 | 2017 |

Unavoidable vertex-minors in large prime graphs O Kwon, S Oum European Journal of Combinatorics 41, 100-127, 2014 | 10 | 2014 |

Linear rank-width of distance-hereditary graphs I Adler, MM Kanté, O Kwon International Workshop on Graph-Theoretic Concepts in Computer Science, 42-55, 2014 | 10 | 2014 |

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 | 9 | 2019 |

Mim-width I. Induced path problems L Jaffke, O Kwon, JA Telle Discrete Applied Mathematics 278, 153-168, 2020 | 8 | 2020 |

An optimal XP algorithm for hamiltonian cycle on graphs of bounded clique-width B Bergougnoux, MM Kanté, O Kwon Algorithmica, 1-21, 2019 | 8 | 2019 |

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 | 8 | 2019 |

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 | 8 | 2018 |

Branch-depth: Generalizing tree-depth of graphs M DeVos, O Kwon, S Oum European Journal of Combinatorics 90, 103186, 2020 | 7 | 2020 |