Seongmin Ok

Most-cited papers

A graph similarity for deep learning
Seongmin Ok
2020Neural Information Processing Systems16 citations
Semantic Scholar
On the Minimum Number of Spanning Trees in k‐Edge‐Connected Graphs
Seongmin Ok, C. Thomassen
2017Journal of Graph Theory11 citations Open access
Semantic Scholar
The minimum number of minimal codewords in an [n, k]-code and in graphic codes
Adel Alahmadi, R. Aldred, R. D. Cruz, Seongmin Ok +2 more
2015Discrete Applied Mathematics10 citations
Semantic Scholar
The minimum number of minimal codewords in an n , k -code and in graphic codes
Adel Alahmadi, R. Aldred, R. M. De La Cruz, Seongmin Ok +2 more
20156 citations Open access
Semantic Scholar
Characterizing width two for variants of treewidth
H. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon +1 more
2014Discrete Applied Mathematics6 citations Open access
Semantic Scholar
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity
Seongmin Ok, R. Richter, C. Thomassen
2016Graphs and Combinatorics5 citations
Semantic Scholar
Dynamic choosability of triangle‐free graphs and sparse random graphs
Jaehoon Kim, Seongmin Ok
2015Journal of Graph Theory3 citations Open access
Semantic Scholar
Characterizing graphs of maximum matching width at most 2
Jisu Jeong, Seongmin Ok, Geewon Suh
2016Discrete Applied Mathematics2 citations Open access
Semantic Scholar
Density of Real Zeros of the Tutte Polynomial
Seongmin Ok, Thomas J. Perrett
2017Combinatorics, probability & computing1 citations
Semantic Scholar
The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications
Seongmin Ok, Peter Tittmann
20171 citations
Semantic Scholar
Density of Zeros of the Tutte Polynomial
Seongmin Ok, Thomas J. Perrett
20161 citations
Semantic Scholar
Aspects of the Tutte polynomial
Seongmin Ok
20161 citations
Semantic Scholar
Character Grouping using 3-D Neighborhood Graph on Raster Map
Yang Gang, Seongmin Ok, Hwan-Gyu Jo
19990 citations
Semantic Scholar