Embedding Trees in Recursive Circulants. - Hyeong-Seok Lim; Jung-Heum Park; Kyung-Yong Chwa (Discret. Appl. Math., 1996)

A new interconnection network for parallel computer with low diameter. - Nak-Keun Joo; Hyeong-Seok Lim (ICPADS, 1997)

Minimizing Broadcast Costs Under Edge Reductions in Tree Networks. - Susanne E. Hambrusch; Hyeong-Seok Lim (Discret. Appl. Math., 1999)

Minimizing the Diameter in Tree Networks Under Edge Reductions. - Susanne E. Hambrusch; Hyeong-Seok Lim (Parallel Process. Lett., 1999)

Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees. - Susanne E. Hambrusch; Chuan-Ming Liu; Hyeong-Seok Lim (J. Graph Algorithms Appl., 2000)

Embedding Full Ternary Trees into Recursive Circulants. - Cheol Kim; Jung Choi; Hyeong-Seok Lim (EurAsia-ICT, 2002)

Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube. - Hyeong-Ok Lee; Jong-Seok Kim; Eunseuk Oh; Hyeong-Seok Lim (EurAsia-ICT, 2002)

A Distributed Low-Cost Dynamic Multicast Routing Algorithm with Delay Constraints. - Min-Woo Shin; Nak-Keun Joo; Hyeong-Seok Lim (EurAsia-ICT, 2002)

Fault Hamiltonicity of Meshes with Two Wraparound Edges. - Kyoung-Wook Park; Hyeong-Seok Lim; Jung-Heum Park; Hee-Chul Kim (COCOON, 2004)

Many-to-many Disjoint Path Covers in a Graph with Faulty Elements. - Jung-Heum Park; Hee-Chul Kim; Hyeong-Seok Lim (ISAAC, 2004)

Fault-Hamiltonicity of Hypercube-Like Interconnection Networks. - Jung-Heum Park; Hee-Chul Kim; Hyeong-Seok Lim (IPDPS, 2005)

Embedding Starlike Trees into Hypercube-Like Interconnection Networks. - Jung-Heum Park; Hyeong-Seok Lim; Hee-Chul Kim (ISPA Workshops, 2006)

Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements. - Jung-Heum Park; Hee-Chul Kim; Hyeong-Seok Lim (IEEE Trans. Parallel Distributed Syst., 2006)

A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays. - Seung-Ho Kang; In-Seon Jeong; Mun-Ho Choi; Hyeong-Seok Lim (FAW, 2007)

A Fast Heuristic Algorithm for Similarity Search in Large DNA Databases. - In-Seon Jeong; Kyoung-Wook Park; Hyeong-Seok Lim (FBIT, 2007)

An Efficient Two-Phase Algorithm to Find Gene-Specific Probes for Large Genomes. - Seung-Ho Kang; Mun-Ho Choi; In-Seon Jeong; Hyeong-Seok Lim (FBIT, 2007)

An Efficient Algorithm for Finding Gene-Specific Probes for DNA Microarrays. - Mun-Ho Choi; In-Seon Jeong; Seung-Ho Kang; Hyeong-Seok Lim (ISBRA, 2007)

Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements. - Jung-Heum Park; Hyeong-Seok Lim; Hee-Chul Kim (Theor. Comput. Sci., 2007)

Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information. - Seung-Ho Kang; In-Seon Jeong; Mun-Ho Choi; Hyeong-Seok Lim (FAW, 2008)

On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. - Jung-Heum Park; Hee-Chul Kim; Hyeong-Seok Lim (IPDPS, 2008)

Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements. - Jung-Heum Park; Hee-Chul Kim; Hyeong-Seok Lim (IEEE Trans. Computers, 2009)

An efficient similarity search based on indexing in large DNA databases. - In-Seon Jeong; Kyoung-Wook Park; Seung-Ho Kang; Hyeong-Seok Lim (Comput. Biol. Chem., 2010)

An improved preprocessing algorithm for haplotype inference by pure parsimony. - Mun-Ho Choi; Seung-Ho Kang; Hyeong-Seok Lim (J. Bioinform. Comput. Biol., 2014)

An approach to conditional diagnosability analysis under the PMC model and its application to torus networks. - Hee-Chul Kim; Hyeong-Seok Lim; Jung-Heum Park (Theor. Comput. Sci., 2014)

The bicube: an interconnection of two hypercubes. - Hyeong-Seok Lim; Jung-Heum Park; Hee-Chul Kim (Int. J. Comput. Math., 2015)

Algorithms for finding disjoint path covers in unit interval graphs. - Jung-Heum Park; Joonsoo Choi; Hyeong-Seok Lim (Discret. Appl. Math., 2016)

Ore-type degree conditions for disjoint path covers in simple graphs. - Hyeong-Seok Lim; Hee-Chul Kim; Jung-Heum Park (Discret. Math., 2016)

Disjoint path covers with path length constraints in restricted hypercube-like graphs. - Jung-Heum Park; Hee-Chul Kim; Hyeong-Seok Lim (J. Comput. Syst. Sci., 2017)

Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs. - Jung-Heum Park; Hyeong-Seok Lim; Hee-Chul Kim (J. Comput. Syst. Sci., 2019)

Disjoint path covers joining prescribed source and sink sets in interval graphs. - Jung-Heum Park; Jae-Hoon Kim 001; Hyeong-Seok Lim (Theor. Comput. Sci., 2019)

Characterization of interval graphs that are unpaired 2-disjoint path coverable. - Jung-Heum Park; Hyeong-Seok Lim (Theor. Comput. Sci., 2020)

Characterization of interval graphs that are paired 2-disjoint path coverable. - Jung-Heum Park; Hyeong-Seok Lim (J. Supercomput., 2023)

A deep learning-based biomonitoring system for detecting water pollution using Caenorhabditis elegans swimming behaviors. - Seung-Ho Kang; In-Seon Jeong; Hyeong-Seok Lim (Ecol. Informatics, 2024)