Seongmin Ok

Orcid: 0000-0002-5796-2011

According to our database1, Seongmin Ok authored at least 9 papers between 2015 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
A graph similarity for deep learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2018
Dynamic choosability of triangle-free graphs and sparse random graphs.
J. Graph Theory, 2018

Characterizing graphs of maximum matching width at most 2.
Discret. Appl. Math., 2018

2017
On the Minimum Number of Spanning Trees in <i>k</i>-Edge-Connected Graphs.
J. Graph Theory, 2017

Density of Real Zeros of the Tutte Polynomial.
Electron. Notes Discret. Math., 2017

Characterizing width two for variants of treewidth.
Discret. Appl. Math., 2017

2016
Aspects of the Tutte polynomial.
PhD thesis, 2016

Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity.
Graphs Comb., 2016

2015
The minimum number of minimal codewords in an [n, k]-code and in graphic codes.
Discret. Appl. Math., 2015


  Loading...