# Suh-Ryung Kim

According to our database

Collaborative distances:

^{1}, Suh-Ryung Kim authored at least 52 papers between 1991 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Discret. Math., 2020

Discret. Appl. Math., 2020

Discret. Appl. Math., 2020

2019

Theor. Comput. Sci., 2019

Discret. Appl. Math., 2019

Discret. Appl. Math., 2019

2018

A new haplotype block detection method for dense genome sequencing data based on interval graph modeling of clusters of highly correlated SNPs.

Bioinform., 2018

On safe sets of the Cartesian product of two complete graphs.

Ars Comb., 2018

2017

J. Comb. Optim., 2017

Comparisons of linkage disequilibrium blocks of different populations for positive selection.

Int. J. Data Min. Bioinform., 2017

Analysis of triangular motifs in protein interaction networks and their implications to protein ages and cancer genes.

Int. J. Data Min. Bioinform., 2017

Discret. Appl. Math., 2017

Discret. Appl. Math., 2017

Discret. Appl. Math., 2017

Topological properties of protein interaction network and phylogenetic age of proteins.

Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

2016

Discret. Appl. Math., 2016

Discret. Appl. Math., 2016

Comparisons of linkage disequilibrium blocks of different populations at the sites of natural selection.

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

2015

Discret. Appl. Math., 2015

2014

Discret. Appl. Math., 2014

2013

J. Comb. Optim., 2013

Discret. Appl. Math., 2013

2012

Graphs Comb., 2012

Discret. Appl. Math., 2012

Discret. Appl. Math., 2012

Electron. J. Comb., 2012

Appl. Math. Lett., 2012

2011

Appl. Math. Lett., 2011

Appl. Math. Lett., 2011

2010

Discuss. Math. Graph Theory, 2010

Discret. Appl. Math., 2010

The competition number of a graph with exactly two holes.

Ars Comb., 2010

2009

The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares.

Discret. Math., 2009

Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p).

Ars Comb., 2009

2008

Discret. Appl. Math., 2008

2007

Discret. Appl. Math., 2007

2006

On the graph inequality <i>theta</i><sub><i>E</i></sub>(<i>G</i>) geq <i>theta</i><sub><i>E</i></sub>(<i>G</i><sup><i>m</i></sup>).

Discret. Math., 2006

On Super Edge-Magic Graphs.

Ars Comb., 2006

2005

Discret. Math., 2005

Discret. Appl. Math., 2005

On The Trees Whose 2-Step Competition Numbers Are Two.

Ars Comb., 2005

2002

Discret. Math., 2002

Discret. Math., 2002

Competition graphs of semiorders and the conditions C(p) and C*(p).

Ars Comb., 2002

2001

Two families of graphs that are not CCE-orientable.

Ars Comb., 2001

2000

Discret. Appl. Math., 2000

1999

On the Inequality dk(G) <= k(G) + 1.

Ars Comb., 1999

1998

The Elimination Procedure for the Competition Number.

Ars Comb., 1998

1997

Discret. Appl. Math., 1997

1993

Discret. Appl. Math., 1993

1992

SIAM J. Discret. Math., 1992

1991

Discret. Appl. Math., 1991