O-joung Kwon - RankMe

123 papers A* 8A 6B 20C 1Journal 87

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A new width parameter of graphs based on edge cuts: α -edge-crossing width. Discret. Appl. Math. Yeonsu Chang, O-joung Kwon, Myounghwan Lee
2026	J	`jnl`	Erdős-Pósa property of A-paths in unoriented group-labelled graphs. Comb. O-joung Kwon, Youngho Yoo
2026	J	`jnl`	On a Variant of Dichromatic Number for Digraphs with Prescribed Sets of Arcs. Graphs Comb. O-joung Kwon, Xiaopan Lian
2026	J	`jnl`	Reduced bandwidth: A qualitative strengthening of twin-width in minor-closed classes (and beyond). J. Comb. Theory B Édouard Bonnet, O-joung Kwon, David R. Wood
2026	A*	`conf`	The Erdős-Pósa property for circle graphs as vertex-minors. SODA Rutger Campbell, Jochen Pascal Gollin, Meike Hatzel, O-joung Kwon, Rose McCarty, Sang-il Oum, Sebastian Wiederrecht
2026	J	`jnl`	Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes. J. Comput. Syst. Sci. Jungho Ahn, Jinha Kim, O-joung Kwon
2025	J	`jnl`	A characterization of graphs of radius-r flip-width at most 2. Discret. Math. Yeonsu Chang, Sejin Ko, O-joung Kwon, Myounghwan Lee
2025	A*	`conf`	A coarse Erdős-Pósa theorem. SODA Jungho Ahn, Jochen Pascal Gollin, Tony Huynh, O-joung Kwon
2025	J	`jnl`	A half-integral Erdős-Pósa theorem for directed odd cycles. J. Comb. Theory B Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie
2025	A*	`conf`	Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs. AAAI Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, Hyeonjun Shin
2025	J	`jnl`	Unavoidable butterfly minors in digraphs of large cycle rank. CoRR Meike Hatzel, O-joung Kwon, Myounghwan Lee, Sebastian Wiederrecht
2024	J	`jnl`	Classes of intersection digraphs with good algorithmic properties. J. Graph Theory Lars Jaffke, O-joung Kwon, Jan Arne Telle
2024	J	`jnl`	On the Erdős-Pósa Property for Long Holes in $\boldsymbol{C_4}$-Free Graphs. SIAM J. Discret. Math. Tony Huynh, O-joung Kwon
2024	J	`jnl`	Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs. CoRR Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, Hyeonjun Shin
2024	J	`jnl`	Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR Clément Dallard, Matjaz Krnc, O-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht
2023	B	`conf`	A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. WG Yeonsu Chang, O-joung Kwon, Myounghwan Lee
2023	J	`jnl`	A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
2023	A*	`conf`	A half-integral Erdős-Pósa theorem for directed odd cycles. SODA Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie
2023	J	`jnl`	A new width parameter of graphs based on edge cuts: $α$-edge-crossing width. CoRR Yeonsu Chang, O-joung Kwon, Myounghwan Lee
2023	J	`jnl`	Computing pivot-minors. CoRR Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2023	J	`jnl`	Obstructions for matroids of path-width at most J. Comb. Theory B Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
2023	J	`jnl`	The Grid Theorem for vertex-minors. J. Comb. Theory B Jim Geelen, O-joung Kwon, Rose McCarty, Paul Wollan
2023	B	`conf`	Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. ISAAC Jungho Ahn, Jinha Kim, O-joung Kwon
2022	A	`conf`	A Unifying Framework for Characterizing and Computing Width Measures. ITCS Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
2022	A	`conf`	Classes of Intersection Digraphs with Good Algorithmic Properties. STACS Lars Jaffke, O-joung Kwon, Jan Arne Telle
2022	A*	`conf`	Directed Tangle Tree-Decompositions and Applications. SODA Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2022	A	`conf`	Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. STACS Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
2022	J	`jnl`	Rainbow independent sets on dense graph classes. Discret. Appl. Math. Jinha Kim, Minki Kim, O-joung Kwon
2022	J	`jnl`	Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond). CoRR Édouard Bonnet, O-joung Kwon, David R. Wood
2022	J	`jnl`	Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes. CoRR Jungho Ahn, Jinha Kim, O-joung Kwon
2022	J	`jnl`	Well-partitioned chordal graphs. Discret. Math. Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
2021	J	`jnl`	A Menger-like property of tree-cut width. J. Comb. Theory B Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2021	J	`jnl`	A Polynomial Kernel for Distance-Hereditary Vertex Deletion. Algorithmica Eun Jung Kim, O-joung Kwon
2021	J	`jnl`	A Unifying Framework for Characterizing and Computing Width Measures. CoRR Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
2021	J	`jnl`	A system of disjoint representatives of line segments with given Discret. Math. Jinha Kim, Minki Kim, O-joung Kwon
2021	J	`jnl`	Classes of intersection digraphs with good algorithmic properties. CoRR Lars Jaffke, O-joung Kwon, Jan Arne Telle
2021	J	`jnl`	Graphs of bounded depth-2 rank-brittleness. J. Graph Theory O-joung Kwon, Sang-il Oum
2021	J	`jnl`	Measuring what matters: A hybrid approach to dynamic programming with treewidth. J. Comput. Syst. Sci. Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2021	J	`jnl`	Obstructions for bounded shrub-depth and rank-depth. J. Comb. Theory B O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
2021	J	`jnl`	On the Erdős-Pósa property for long holes in C CoRR Tony Huynh, O-joung Kwon
2021	J	`jnl`	Packing and Covering Induced Subdivisions. SIAM J. Discret. Math. O-joung Kwon, Jean-Florent Raymond
2021	C	`conf`	Three Problems on Well-Partitioned Chordal Graphs. CIAC Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
2021	J	`jnl`	Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2020	B	`conf`	A Polynomial Kernel for 3-Leaf Power Deletion. MFCS Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
2020	J	`jnl`	An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2020	J	`jnl`	Branch-depth: Generalizing tree-depth of graphs. Eur. J. Comb. Matt DeVos, O-joung Kwon, Sang-il Oum
2020	J	`jnl`	Classes of graphs with no long cycle as a vertex-minor are polynomially J. Comb. Theory, Ser. B Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman
2020	B	`conf`	Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. IPEC Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
2020	J	`jnl`	Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth. CoRR Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
2020	J	`jnl`	Erdős-Pósa property of chordless cycles and its applications. J. Comb. Theory B Eun Jung Kim, O-joung Kwon
2020	J	`jnl`	Graphs without two vertex-disjoint S-cycles. Discret. Math. Minjeong Kang, O-joung Kwon, Myounghwan Lee
2020	J	`jnl`	Mim-Width I. Induced path problems. Discret. Appl. Math. Lars Jaffke, O-joung Kwon, Jan Arne Telle
2020	J	`jnl`	Mim-Width II. The Feedback Vertex Set Problem. Algorithmica Lars Jaffke, O-joung Kwon, Jan Arne Telle
2020	J	`jnl`	On low rank-width colorings. Eur. J. Comb. O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
2020	J	`jnl`	Scattered Classes of Graphs. SIAM J. Discret. Math. O-joung Kwon, Sang-il Oum
2020	A*	`conf`	The Directed Flat Wall Theorem. SODA Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2020	J	`jnl`	The canonical directed tree decomposition and its applications to the directed disjoint paths problem. CoRR Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2020	J	`jnl`	Tree pivot-minors and linear rank-width. CoRR Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2020	B	`conf`	Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. WG Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
2020	J	`jnl`	Well-partitioned chordal graphs: obstruction set and disjoint paths. CoRR Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
2019	J	`jnl`	A polynomial kernel for $3$-leaf power deletion. CoRR Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
2019	J	`jnl`	Chi-boundedness of graph classes excluding wheel vertex-minors. J. Comb. Theory B Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
2019	J	`jnl`	Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. Algorithmica Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2019	A	`conf`	Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2019	B	`conf`	Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. MFCS Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2019	J	`jnl`	Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. CoRR Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2019	J	`jnl`	Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2019	J	`jnl`	Obstructions for bounded shrub-depth and rank-depth. CoRR O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan
2018	A	`conf`	A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. STACS Lars Jaffke, O-joung Kwon, Jan Arne Telle
2018	J	`jnl`	A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. J. Comput. Syst. Sci. Eduard Eiben, Robert Ganian, O-joung Kwon
2018	J	`jnl`	Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. CoRR Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman
2018	B	`conf`	Computing Small Pivot-Minors. WG Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2018	—	`ch.`	Digraphs of Bounded Width. Classes of Directed Graphs Stephan Kreutzer, O-joung Kwon
2018	A*	`conf`	Erdős-Pósa property of chordless cycles and its applications. SODA Eun Jung Kim, O-joung Kwon
2018	B	`conf`	Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. IPEC Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2018	J	`jnl`	Generalized distance domination problems and their complexity on graphs of bounded mim-width. CoRR Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2018	J	`jnl`	Lean tree-cut decompositions: obstructions and algorithms. CoRR Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2018	J	`jnl`	Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions. Eur. J. Comb. Mamadou Moustapha Kanté, O-joung Kwon
2018	J	`jnl`	Packing and covering induced subdivisions. CoRR O-joung Kwon, Jean-Florent Raymond
2017	J	`jnl`	A Polynomial Kernel for Block Graph Deletion. Algorithmica Eun Jung Kim, O-joung Kwon
2017	B	`conf`	A Polynomial Kernel for Distance-Hereditary Vertex Deletion. WADS Eun Jung Kim, O-joung Kwon
2017	B	`conf`	A Width Parameter Useful for Chordal and Co-comparability Graphs. WALCOM Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2017	J	`jnl`	A note on the complexity of Feedback Vertex Set parameterized by mim-width. CoRR Lars Jaffke, O-joung Kwon, Jan Arne Telle
2017	J	`jnl`	A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width. CoRR Lars Jaffke, O-joung Kwon, Jan Arne Telle
2017	J	`jnl`	A width parameter useful for chordal and co-comparability graphs. Theor. Comput. Sci. Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2017	J	`jnl`	An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Algorithmica Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2017	B	`conf`	An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2017	J	`jnl`	An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. CoRR Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
2017	J	`jnl`	Characterizing width two for variants of treewidth. Discret. Appl. Math. Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok
2017	J	`jnl`	Chi-boundedness of graph classes excluding wheel vertex-minors. Electron. Notes Discret. Math. Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
2017	J	`jnl`	Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors. J. Comb. Theory B Ilkyoo Choi, O-joung Kwon, Sang-il Oum
2017	J	`jnl`	Erdős-Pósa property of chordless cycles and its applications. CoRR Eun Jung Kim, O-joung Kwon
2017	B	`conf`	Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. IPEC Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2017	J	`jnl`	Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. CoRR Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2017	J	`jnl`	Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
2017	A*	`conf`	Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2017	B	`conf`	On Low Rank-Width Colorings. WG O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
2017	J	`jnl`	On low rank-width colorings. CoRR O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
2017	J	`jnl`	Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2017	B	`conf`	Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. IPEC Lars Jaffke, O-joung Kwon, Jan Arne Telle
2017	J	`jnl`	Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. CoRR Lars Jaffke, O-joung Kwon, Jan Arne Telle
2016	J	`jnl`	A Polynomial Kernel for Distance-Hereditary Vertex Deletion. CoRR Eun Jung Kim, O-joung Kwon
2016	B	`conf`	A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. MFCS Eduard Eiben, Robert Ganian, O-joung Kwon
2016	J	`jnl`	A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion. CoRR Eduard Eiben, Robert Ganian, O-joung Kwon
2016	J	`jnl`	Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2016	B	`conf`	Packing and Covering Immersion Models of Planar Subcubic Graphs. WG Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2016	B	`conf`	Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. WG Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2016	J	`jnl`	Parameterized vertex deletion problems for hereditary graph classes with a block property. CoRR Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2016	J	`jnl`	Sim-width and induced minors. CoRR Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
2016	J	`jnl`	Tree-depth and vertex-minors. Eur. J. Comb. Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
2015	B	`conf`	A Polynomial Kernel for Block Graph Deletion. IPEC Eun Jung Kim, O-joung Kwon
2015	J	`jnl`	A polynomial kernel for Block Graph Vertex Deletion. CoRR Eun Jung Kim, O-joung Kwon
2015	B	`conf`	An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2015	J	`jnl`	FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2014	J	`jnl`	An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width. CoRR Mamadou Moustapha Kanté, O-joung Kwon
2014	J	`jnl`	Excluded vertex-minors for graphs of linear rank-width at most k. Eur. J. Comb. Jisu Jeong, O-joung Kwon, Sang-il Oum
2014	J	`jnl`	Graphs of small rank-width are pivot-minors of graphs of small tree-width. Discret. Appl. Math. O-joung Kwon, Sang-il Oum
2014	B	`conf`	Linear Rank-Width of Distance-Hereditary Graphs. WG Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
2014	J	`jnl`	Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. CoRR Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
2014	J	`jnl`	Tree-depth and Vertex-minors. CoRR Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
2014	J	`jnl`	Unavoidable vertex-minors in large prime graphs. Eur. J. Comb. O-joung Kwon, Sang-il Oum
2013	A	`conf`	Excluded vertex-minors for graphs of linear rank-width at most k. STACS Jisu Jeong, O-joung Kwon, Sang-il Oum
2012	J	`jnl`	Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width CoRR O-joung Kwon, Sang-il Oum