O-joung Kwon

According to our database, O-joung Kwon authored at least 71 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On the Erdős-Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs.

Tony Huynh, O-joung Kwon

SIAM J. Discret. Math., March, 2024

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

CoRR, 2024

2023

A Polynomial Kernel for 3-Leaf Power Deletion.

Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum

Algorithmica, October, 2023

Obstructions for matroids of path-width at most <i>k</i> and graphs of linear rank-width at most <i>k</i>.

Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum

J. Comb. Theory B, May, 2023

The Grid Theorem for vertex-minors.

Jim Geelen, O-joung Kwon, Rose McCarty, Paul Wollan

J. Comb. Theory B, 2023

Computing pivot-minors.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

CoRR, 2023

A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width.

Yeonsu Chang, O-joung Kwon, Myounghwan Lee

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

A half-integral Erdős-Pósa theorem for directed odd cycles.

Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes.

Jungho Ahn, Jinha Kim, O-joung Kwon

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Well-partitioned chordal graphs.

Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima

Discret. Math., 2022

Rainbow independent sets on dense graph classes.

Jinha Kim, Minki Kim, O-joung Kwon

Discret. Appl. Math., 2022

Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond).

Édouard Bonnet, O-joung Kwon, David R. Wood

CoRR, 2022

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

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Classes of Intersection Digraphs with Good Algorithmic Properties.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Directed Tangle Tree-Decompositions and Applications.

Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Unifying Framework for Characterizing and Computing Width Measures.

Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Packing and Covering Induced Subdivisions.

O-joung Kwon, Jean-Florent Raymond

SIAM J. Discret. Math., 2021

Tree Pivot-Minors and Linear Rank-Width.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

SIAM J. Discret. Math., 2021

Graphs of bounded depth-2 rank-brittleness.

O-joung Kwon, Sang-il Oum

J. Graph Theory, 2021

Obstructions for bounded shrub-depth and rank-depth.

O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan

J. Comb. Theory B, 2021

A Menger-like property of tree-cut width.

Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos

J. Comb. Theory B, 2021

Measuring what matters: A hybrid approach to dynamic programming with treewidth.

Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon

J. Comput. Syst. Sci., 2021

A system of disjoint representatives of line segments with given <i>k</i> directions.

Jinha Kim, Minki Kim, O-joung Kwon

Discret. Math., 2021

On the Erdős-Pósa property for long holes in C₄-free graphs.

Tony Huynh, O-joung Kwon

CoRR, 2021

A Polynomial Kernel for Distance-Hereditary Vertex Deletion.

Eun Jung Kim, O-joung Kwon

Algorithmica, 2021

Three Problems on Well-Partitioned Chordal Graphs.

Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Scattered Classes of Graphs.

O-joung Kwon, Sang-il Oum

SIAM J. Discret. Math., 2020

Erdős-Pósa property of chordless cycles and its applications.

Eun Jung Kim, O-joung Kwon

J. Comb. Theory B, 2020

Classes of graphs with no long cycle as a vertex-minor are polynomially <i>χ</i>-bounded.

Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman

J. Comb. Theory, Ser. B, 2020

On low rank-width colorings.

O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz

Eur. J. Comb., 2020

Branch-depth: Generalizing tree-depth of graphs.

Matt DeVos, O-joung Kwon, Sang-il Oum

Eur. J. Comb., 2020

Graphs without two vertex-disjoint S-cycles.

Minjeong Kang, O-joung Kwon, Myounghwan Lee

Discret. Math., 2020

Mim-Width I. Induced path problems.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

Discret. Appl. Math., 2020

The canonical directed tree decomposition and its applications to the directed disjoint paths problem.

Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon

CoRR, 2020

Mim-Width II. The Feedback Vertex Set Problem.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

Algorithmica, 2020

An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.

Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon

Algorithmica, 2020

Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths.

Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

The Directed Flat Wall Theorem.

Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth.

Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

Mim-width III. Graph powers and generalized distance domination problems.

Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle

Theor. Comput. Sci., 2019

Chi-boundedness of graph classes excluding wheel vertex-minors.

Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan

J. Comb. Theory B, 2019

Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms.

Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx

Algorithmica, 2019

Lean Tree-Cut Decompositions: Obstructions and Algorithms.

Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion.

Eduard Eiben, Robert Ganian, O-joung Kwon

J. Comput. Syst. Sci., 2018

Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions.

Mamadou Moustapha Kanté, O-joung Kwon

Eur. J. Comb., 2018

Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded.

Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman

CoRR, 2018

Computing Small Pivot-Minors.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width.

Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Digraphs of Bounded Width.

Stephan Kreutzer, O-joung Kwon

Proceedings of the Classes of Directed Graphs., 2018

2017

A width parameter useful for chordal and co-comparability graphs.

Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle

Theor. Comput. Sci., 2017

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors.

Ilkyoo Choi, O-joung Kwon, Sang-il Oum

J. Comb. Theory B, 2017

Packing and covering immersion-expansions of planar sub-cubic graphs.

Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos

Eur. J. Comb., 2017

Characterizing width two for variants of treewidth.

Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok

Discret. Appl. Math., 2017

A note on the complexity of Feedback Vertex Set parameterized by mim-width.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

CoRR, 2017

A Polynomial Kernel for Block Graph Deletion.

Eun Jung Kim, O-joung Kwon

Algorithmica, 2017

An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion.

Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul

Algorithmica, 2017

Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm.

Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon

Algorithmica, 2017

Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width.

Lars Jaffke, O-joung Kwon, Jan Arne Telle

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

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

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Tree-depth and vertex-minors.

Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak

Eur. J. Comb., 2016

Sim-width and induced minors.

Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle

CoRR, 2016

Packing and Covering Immersion Models of Planar Subcubic Graphs.

Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property.

Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015

FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion.

Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul

CoRR, 2015

A polynomial kernel for Block Graph Vertex Deletion.

Eun Jung Kim, O-joung Kwon

CoRR, 2015

2014

Unavoidable vertex-minors in large prime graphs.

O-joung Kwon, Sang-il Oum

Eur. J. Comb., 2014

Excluded vertex-minors for graphs of linear rank-width at most k.

Jisu Jeong, O-joung Kwon, Sang-il Oum

Eur. J. Comb., 2014

Graphs of small rank-width are pivot-minors of graphs of small tree-width.

O-joung Kwon, Sang-il Oum

Discret. Appl. Math., 2014

An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width.

Mamadou Moustapha Kanté, O-joung Kwon

CoRR, 2014

Linear Rank-Width of Distance-Hereditary Graphs.

Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014