Yeonsu Chang

According to our database, Yeonsu Chang authored at least 3 papers between 2023 and 2025.

Collaborative distances:

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

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

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

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

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