O-joung Kwon

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 95

Top Venues

CoRR

Algorithmica

J. Comb. Theory, Ser. B

Publications

Tony Huynh, O-joung Kwon
On the Erdős-Pósa Property for Long Holes in $\boldsymbol{C_4}$-Free Graphs. SIAM J. Discret. Math. 38 (1) (2024)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
. J. Comb. Theory, Ser. B 160 (2023)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing pivot-minors. CoRR (2023)
Yeonsu Chang, O-joung Kwon, Myounghwan Lee
A new width parameter of graphs based on edge cuts: $α$-edge-crossing width. CoRR (2023)
Jungho Ahn, Jinha Kim, O-joung Kwon
Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. ISAAC (2023)
Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie
A half-integral Erdős-Pósa theorem for directed odd cycles. SODA (2023)
Jim Geelen, O-joung Kwon, Rose McCarty, Paul Wollan
The Grid Theorem for vertex-minors. J. Comb. Theory, Ser. B 158 (Part) (2023)
Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica 85 (10) (2023)
Yeonsu Chang, O-joung Kwon, Myounghwan Lee
A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. WG (2023)
Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
Directed Tangle Tree-Decompositions and Applications. SODA (2022)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Classes of Intersection Digraphs with Good Algorithmic Properties. STACS (2022)
Jinha Kim, Minki Kim, O-joung Kwon
Rainbow independent sets on dense graph classes. Discret. Appl. Math. 312 (2022)
Jungho Ahn, Jinha Kim, O-joung Kwon
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes. CoRR (2022)
Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
Well-partitioned chordal graphs. Discret. Math. 345 (10) (2022)
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
A Unifying Framework for Characterizing and Computing Width Measures. ITCS (2022)
Édouard Bonnet, O-joung Kwon, David R. Wood
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond). CoRR (2022)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. STACS (2022)
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
Measuring what matters: A hybrid approach to dynamic programming with treewidth. J. Comput. Syst. Sci. 121 (2021)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Classes of intersection digraphs with good algorithmic properties. CoRR (2021)
O-joung Kwon, Jean-Florent Raymond
Packing and Covering Induced Subdivisions. SIAM J. Discret. Math. 35 (2) (2021)
O-joung Kwon, Sang-il Oum
Graphs of bounded depth-2 rank-brittleness. J. Graph Theory 96 (3) (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
A Unifying Framework for Characterizing and Computing Width Measures. CoRR (2021)
O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
Obstructions for bounded shrub-depth and rank-depth. J. Comb. Theory, Ser. B 149 (2021)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. Algorithmica 83 (7) (2021)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. 35 (4) (2021)
Tony Huynh, O-joung Kwon
-free graphs. CoRR (2021)
Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
Three Problems on Well-Partitioned Chordal Graphs. CIAC (2021)
Jinha Kim, Minki Kim, O-joung Kwon
directions. Discret. Math. 344 (12) (2021)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
A Menger-like property of tree-cut width. J. Comb. Theory, Ser. B 148 (2021)
Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. WG (2020)
Matt DeVos, O-joung Kwon, Sang-il Oum
Branch-depth: Generalizing tree-depth of graphs. Eur. J. Comb. 90 (2020)
Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman
-bounded. J. Comb. Theory, Ser. B 140 (2020)
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. IPEC (2020)
O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
On low rank-width colorings. Eur. J. Comb. 83 (2020)
Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
The canonical directed tree decomposition and its applications to the directed disjoint paths problem. CoRR (2020)
O-joung Kwon, Sang-il Oum
Scattered Classes of Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
A Polynomial Kernel for 3-Leaf Power Deletion. MFCS (2020)
Minjeong Kang, O-joung Kwon, Myounghwan Lee
Graphs without two vertex-disjoint S-cycles. Discret. Math. 343 (10) (2020)
Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
Well-partitioned chordal graphs: obstruction set and disjoint paths. CoRR (2020)
Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
The Directed Flat Wall Theorem. SODA (2020)
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth. CoRR (2020)
Eun Jung Kim, O-joung Kwon
Erdős-Pósa property of chordless cycles and its applications. J. Comb. Theory, Ser. B 145 (2020)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree pivot-minors and linear rank-width. CoRR (2020)
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica 82 (6) (2020)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Mim-Width II. The Feedback Vertex Set Problem. Algorithmica 82 (1) (2020)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Mim-Width I. Induced path problems. Discret. Appl. Math. 278 (2020)
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796 (2019)
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. CoRR (2019)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. Algorithmica 81 (10) (2019)
O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
Obstructions for bounded shrub-depth and rank-depth. CoRR (2019)
Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
Chi-boundedness of graph classes excluding wheel vertex-minors. J. Comb. Theory, Ser. B 135 (2019)
Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
A polynomial kernel for $3$-leaf power deletion. CoRR (2019)
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. MFCS (2019)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS (2019)
Eun Jung Kim, O-joung Kwon
Erdős-Pósa property of chordless cycles and its applications. SODA (2018)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Lean tree-cut decompositions: obstructions and algorithms. CoRR (2018)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. STACS (2018)
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
Generalized distance domination problems and their complexity on graphs of bounded mim-width. CoRR (2018)
O-joung Kwon, Jean-Florent Raymond
Packing and covering induced subdivisions. CoRR (2018)
Mamadou Moustapha Kanté, O-joung Kwon
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions. Eur. J. Comb. 74 (2018)
Eduard Eiben, Robert Ganian, O-joung Kwon
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. J. Comput. Syst. Sci. 97 (2018)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing Small Pivot-Minors. WG (2018)
Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. CoRR (2018)
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. IPEC (2018)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. CoRR (2017)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. IPEC (2017)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
A note on the complexity of Feedback Vertex Set parameterized by mim-width. CoRR (2017)
Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
Chi-boundedness of graph classes excluding wheel vertex-minors. Electron. Notes Discret. Math. 61 (2017)
Ilkyoo Choi, O-joung Kwon, Sang-il Oum
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors. J. Comb. Theory, Ser. B 123 (2017)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Algorithmica 79 (1) (2017)
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica 78 (1) (2017)
Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
A width parameter useful for chordal and co-comparability graphs. Theor. Comput. Sci. 704 (2017)
Eun Jung Kim, O-joung Kwon
Erdős-Pósa property of chordless cycles and its applications. CoRR (2017)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. CoRR (2017)
Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok
Characterizing width two for variants of treewidth. Discret. Appl. Math. 216 (2017)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. WADS (2017)
O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
On Low Rank-Width Colorings. WG (2017)
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS (2017)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. 65 (2017)
Lars Jaffke, O-joung Kwon, Jan Arne Telle
A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width. CoRR (2017)
O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
On low rank-width colorings. CoRR (2017)
Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
A Width Parameter Useful for Chordal and Co-comparability Graphs. WALCOM (2017)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Block Graph Deletion. Algorithmica 79 (1) (2017)
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP (2017)
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. CoRR (2017)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. IPEC (2017)
Eduard Eiben, Robert Ganian, O-joung Kwon
A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion. CoRR (2016)
Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
Sim-width and induced minors. CoRR (2016)
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR (2016)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Packing and Covering Immersion Models of Planar Subcubic Graphs. WG (2016)
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
Tree-depth and vertex-minors. Eur. J. Comb. 56 (2016)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Parameterized vertex deletion problems for hereditary graph classes with a block property. CoRR (2016)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. CoRR (2016)
Eduard Eiben, Robert Ganian, O-joung Kwon
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. MFCS (2016)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. WG (2016)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR (2015)
Eun Jung Kim, O-joung Kwon
A polynomial kernel for Block Graph Vertex Deletion. CoRR (2015)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC (2015)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Block Graph Deletion. IPEC (2015)
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
Tree-depth and Vertex-minors. CoRR (2014)

O-joung Kwon.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

O-joung Kwon