A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. - Yeonsu Chang; O-joung Kwon; Myounghwan Lee (WG, 2023)

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 001; Hyeonjun Shin (AAAI, 2025)

A characterization of graphs of radius-r flip-width at most 2. - Yeonsu Chang; Sejin Ko; O-joung Kwon; Myounghwan Lee (Discret. Math., 2025)