Edge-disjoint embedding of large full binary trees into hypercubes. - Sook-Yeon Kim; Kyung-Yong Chwa (SPDP, 1995)

Optimal embeddings of multiple graphs into a hypermesh. - Sook-Yeon Kim; Kyung-Yong Chwa (ICPADS, 1997)

Multiple Graph Embeddings into a Processor Array with Spanning Buses. - Sook-Yeon Kim; Kyung-Yong Chwa (J. Parallel Distributed Comput., 1998)

Embeddings of Butterflies into Hypermeshes. - Sook-Yeon Kim; Oh-Heum Kwon; Kyung-Yong Chwa (Parallel Process. Lett., 1998)

An Approach for Torus Embedding. - Sook-Yeon Kim; Jeen Hur (ICPP Workshops, 1999)

Information Model for Policy-Based Network Security Management. - Sook-Yeon Kim; Myung-Eun Kim; Kiyoung Kim; Jongsoo Jang (ICOIN (1), 2002)

Effect of load distribution in path protection of MPLS. - Sook-Yeon Kim (Int. J. Commun. Syst., 2003)

Disjoint path covers in recursive circulants G(2m, 4) with faulty elements. - Sook-Yeon Kim; Jae-Ha Lee; Jung-Heum Park (Theor. Comput. Sci., 2011)

Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m, 4))$. - Sook-Yeon Kim; Jung-Heum Park (IEEE Trans. Computers, 2013)

Many-to-many two-disjoint path covers in restricted hypercube-like graphs. - Sook-Yeon Kim; Jung-Heum Park (Theor. Comput. Sci., 2014)