| 2026 | ESA | Moderately Beyond Clique-Width: Reduced Component Max-Leaf and Related Parameters. | douard Bonnet, Yeonsu Chang, Julien Duron, Colin Geniet, O-joung Kwon |
| 2026 | SODA | The Erdős-Psa property for circle graphs as vertex-minors. | Rutger Campbell, Jochen Pascal Gollin, Meike Hatzel, O-joung Kwon, Rose McCarty, Sang-il Oum, Sebastian Wiederrecht |
| 2025 | AAAI | Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs. | Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, Hyeonjun Shin |
| 2025 | SODA | A coarse Erdős-Psa theorem. | Jungho Ahn, Jochen Pascal Gollin, Tony Huynh, O-joung Kwon |
| 2023 | ISAAC | Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. | Jungho Ahn, Jinha Kim, O-joung Kwon |
| 2023 | SODA | A half-integral Erdős-Psa theorem for directed odd cycles. | Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie |
| 2023 | WG | A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. | Yeonsu Chang, O-joung Kwon, Myounghwan Lee |
| 2022 | SODA | Directed Tangle Tree-Decompositions and Applications. | Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon |
| 2022 | STACS | Classes of Intersection Digraphs with Good Algorithmic Properties. | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
| 2022 | STACS | Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. | Mamadou Moustapha Kant, Eun Jung Kim, O-joung Kwon, Sang-il Oum |
| 2021 | CIAC | Three Problems on Well-Partitioned Chordal Graphs. | Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima |
| 2020 | MFCS | A Polynomial Kernel for 3-Leaf Power Deletion. | Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum |
| 2020 | SODA | The Directed Flat Wall Theorem. | Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon |
| 2020 | WG | Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. | Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima |
| 2019 | MFCS | Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. | Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon |
| 2019 | STACS | Lean Tree-Cut Decompositions: Obstructions and Algorithms. | Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos |
| 2018 | SODA | Erdős-Psa property of chordless cycles and its applications. | Eun Jung Kim, O-joung Kwon |
| 2018 | STACS | A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
| 2018 | WG | Computing Small Pivot-Minors. | Konrad K. Dabrowski, Franois Dross, Jisu Jeong, Mamadou Moustapha Kant, O-joung Kwon, Sang-il Oum, Danil Paulusma |
| 2017 | ICALP | Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. | Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2017 | WADS | An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. | Benjamin Bergougnoux, Mamadou Moustapha Kant, O-joung Kwon |
| 2017 | WADS | A Polynomial Kernel for Distance-Hereditary Vertex Deletion. | Eun Jung Kim, O-joung Kwon |
| 2017 | WALCOM | A Width Parameter Useful for Chordal and Co-comparability Graphs. | Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strmme, Jan Arne Telle |
| 2017 | WG | On Low Rank-Width Colorings. | O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz |
| 2016 | MFCS | A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. | Eduard Eiben, Robert Ganian, O-joung Kwon |
| 2016 | WG | Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. | douard Bonnet, Nick Brettell, O-joung Kwon, Dniel Marx |
| 2016 | WG | Packing and Covering Immersion Models of Planar Subcubic Graphs. | Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos |
| 2014 | WG | Linear Rank-Width of Distance-Hereditary Graphs. | Isolde Adler, Mamadou Moustapha Kant, O-joung Kwon |
| 2013 | STACS | Excluded vertex-minors for graphs of linear rank-width at most k. | Jisu Jeong, O-joung Kwon, Sang-il Oum |