-
Publication Date2022-03
Characterizing matroids whose bases form graphic delta-matroids
Duksang Lee; Sang-il Oum
-
Publication Date2021-12
A system of disjoint representatives of line segments with given k directions
JINHA KIM; MINKI KIM; O-JOUNG KWON
-
Publication Date2021-11
Measuring what matters: A hybrid approach to dynamic programming with treewidth
Eiben, Eduard; Ganian, Robert; Hamm, Thekla, et al
-
Publication Date2021-08
TREE PIVOT-MINORS AND LINEAR RANK-WIDTH
Dabrowski, Konrad K.; Dross, Francois; Jeong, Jisu, et al
-
Publication Date2021-07
Obstructions for bounded shrub-depth and rank-depth
O-joung Kwon; Rose McCarty; Sang-il Oum, et al
-
Publication Date2021-07
A Polynomial Kernel for Distance-Hereditary Vertex Deletion
Kim, Eun Jung; O‑joung Kwon
-
Publication Date2021-05
A Menger-like property of tree-cut width
Giannopoulou, Archontia C.; O-joung Kwon; Raymond, Jean-Florent, et al
-
Publication Date2021-04
Packing and covering induced subdivisions
O-JOUNG KWON; RAYMOND, JEAN-FLORENT
-
Publication Date2021-03
Graphs of bounded depth-2 rank-brittleness
O-joung Kwon; Sang-il Oum
-
Publication Date2020-12
Branch-depth: Generalizing tree-depth of graphs
Matt DeVos; O-joung Kwon; Sang-il Oum
-
Publication Date2020-10
Graphs without two vertex-disjoint S-cycles
Minjeong Kang; O-joung Kwon; Myounghwan Lee
-
Publication Date2020-06
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
Bergougnoux B.; Kante M.M.; O-joung Kwon
-
Publication Date2020-03
On 1-factors with prescribed lengths in tournaments
Dong Yeap, Kang; Kim J.
-
Publication Date2019-12
Mim-width III. Graph powers and generalized distance domination problems
Lars Jaffke; O-joung Kwon; Torstein J.F.Strømmea, et al