On the mean square displacement of a random walk on a graph. - Seonghyuk Im; Hwidong Kim; Jiho Maeng; Jihwan Yu; Yongwook Cha; Seong-Hun Paeng (Eur. J. Comb., 2016)

Complexity of Partitioning Hypergraphs. - Seonghyuk Im (CoRR, 2018)

The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs. - Jungho Ahn; Seonghyuk Im; Sang-il Oum (Discret. Appl. Math., 2025)

Crux, space constraints and subdivisions. - Seonghyuk Im; Jaehoon Kim; Younjin Kim; Hong Liu 010 (J. Comb. Theory B, 2025)

On Rainbow Turán Densities of Trees. - Seonghyuk Im; Jaehoon Kim; Hyunwoo Lee; Haesong Seo (Random Struct. Algorithms, 2025)

Dirac's Theorem for Linear Hypergraphs. - Seonghyuk Im; Hyunwoo Lee (SIAM J. Discret. Math., 2025)