Seongmin Ok

Publication Activity (10 Years)

Years Active: 2015-2020
Publications (10 Years): 10

Top Topics

Graph Theoretic

Tree Decompositions

Maximum Matching

Top Venues

Discret. Appl. Math.

J. Graph Theory

Comb. Probab. Comput.

Publications

Seongmin Ok
A graph similarity for deep learning. NeurIPS (2020)
Jisu Jeong, Seongmin Ok, Geewon Suh
Characterizing graphs of maximum matching width at most 2. Discret. Appl. Math. 248 (2018)
Seongmin Ok, Thomas J. Perrett
Density of Real Zeros of the Tutte Polynomial. Comb. Probab. Comput. 27 (3) (2018)
Jaehoon Kim, Seongmin Ok
Dynamic choosability of triangle-free graphs and sparse random graphs. J. Graph Theory 87 (3) (2018)
Seongmin Ok, Thomas J. Perrett
Density of Real Zeros of the Tutte Polynomial. Electron. Notes Discret. Math. 61 (2017)
Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok
Characterizing width two for variants of treewidth. Discret. Appl. Math. 216 (2017)
Seongmin Ok, Carsten Thomassen
-Edge-Connected Graphs. J. Graph Theory 84 (3) (2017)
Seongmin Ok, R. Bruce Richter, Carsten Thomassen
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity. Graphs Comb. 32 (6) (2016)
Jisu Jeong, Seongmin Ok, Geewon Suh
Characterizing graphs of maximum matching width at most 2. CoRR (2016)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Seongmin Ok, Patrick Solé, Carsten Thomassen
The minimum number of minimal codewords in an [n, k]-code and in graphic codes. Discret. Appl. Math. 184 (2015)