The minimum number of minimal codewords in an [n, k]-code and in graphic codes. - Adel Alahmadi; Robert E. L. Aldred; Romar dela Cruz; Seongmin Ok; Patrick Solé; Carsten Thomassen (Discret. Appl. Math., 2015)

Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity. - Seongmin Ok; R. Bruce Richter; Carsten Thomassen (Graphs Comb., 2016)

Aspects of the Tutte polynomial. - Seongmin Ok (2016)

Characterizing width two for variants of treewidth. - Hans L. Bodlaender; Stefan Kratsch; Vincent J. C. Kreuzen; O-joung Kwon; Seongmin Ok (Discret. Appl. Math., 2017)

Density of Real Zeros of the Tutte Polynomial. - Seongmin Ok; Thomas J. Perrett (Electron. Notes Discret. Math., 2017)

On the Minimum Number of Spanning Trees in k-Edge-Connected Graphs. - Seongmin Ok; Carsten Thomassen (J. Graph Theory, 2017)

Characterizing graphs of maximum matching width at most 2. - Jisu Jeong; Seongmin Ok; Geewon Suh (Discret. Appl. Math., 2018)

Dynamic choosability of triangle-free graphs and sparse random graphs. - Jaehoon Kim; Seongmin Ok (J. Graph Theory, 2018)

A graph similarity for deep learning. - Seongmin Ok (NeurIPS, 2020)