Hyeong-Seok Lim

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 9

Top Topics

Top Venues

Theor. Comput. Sci.

J. Comput. Syst. Sci.

Discret. Appl. Math.

Int. J. Comput. Math.

Publications

Seung-Ho Kang, In-Seon Jeong, Hyeong-Seok Lim
A deep learning-based biomonitoring system for detecting water pollution using Caenorhabditis elegans swimming behaviors. Ecol. Informatics 80 (2024)
Jung-Heum Park, Hyeong-Seok Lim
Characterization of interval graphs that are paired 2-disjoint path coverable. J. Supercomput. 79 (3) (2023)
Jung-Heum Park, Hyeong-Seok Lim
Characterization of interval graphs that are unpaired 2-disjoint path coverable. Theor. Comput. Sci. 821 (2020)
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs. J. Comput. Syst. Sci. 105 (2019)
Jung-Heum Park, Jae-Hoon Kim, Hyeong-Seok Lim
Disjoint path covers joining prescribed source and sink sets in interval graphs. Theor. Comput. Sci. 776 (2019)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Disjoint path covers with path length constraints in restricted hypercube-like graphs. J. Comput. Syst. Sci. 89 (2017)
Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park
Ore-type degree conditions for disjoint path covers in simple graphs. Discret. Math. 339 (2) (2016)
Jung-Heum Park, Joonsoo Choi, Hyeong-Seok Lim
Algorithms for finding disjoint path covers in unit interval graphs. Discret. Appl. Math. 205 (2016)
Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim
The bicube: an interconnection of two hypercubes. Int. J. Comput. Math. 92 (1) (2015)
Mun-Ho Choi, Seung-Ho Kang, Hyeong-Seok Lim
An improved preprocessing algorithm for haplotype inference by pure parsimony. J. Bioinform. Comput. Biol. 12 (4) (2014)
Hee-Chul Kim, Hyeong-Seok Lim, Jung-Heum Park
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks. Theor. Comput. Sci. 548 (2014)
In-Seon Jeong, Kyoung-Wook Park, Seung-Ho Kang, Hyeong-Seok Lim
An efficient similarity search based on indexing in large DNA databases. Comput. Biol. Chem. 34 (2) (2010)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements. IEEE Trans. Computers 58 (4) (2009)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. IPDPS (2008)
Seung-Ho Kang, In-Seon Jeong, Mun-Ho Choi, Hyeong-Seok Lim
Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information. FAW (2008)
Mun-Ho Choi, In-Seon Jeong, Seung-Ho Kang, Hyeong-Seok Lim
An Efficient Algorithm for Finding Gene-Specific Probes for DNA Microarrays. ISBRA (2007)
Seung-Ho Kang, Mun-Ho Choi, In-Seon Jeong, Hyeong-Seok Lim
An Efficient Two-Phase Algorithm to Find Gene-Specific Probes for Large Genomes. FBIT (2007)
Seung-Ho Kang, In-Seon Jeong, Mun-Ho Choi, Hyeong-Seok Lim
A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays. FAW (2007)
In-Seon Jeong, Kyoung-Wook Park, Hyeong-Seok Lim
A Fast Heuristic Algorithm for Similarity Search in Large DNA Databases. FBIT (2007)
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements. Theor. Comput. Sci. 377 (1-3) (2007)
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements. ISPA Workshops (2006)
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Embedding Starlike Trees into Hypercube-Like Interconnection Networks. ISPA Workshops (2006)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements. IEEE Trans. Parallel Distributed Syst. 17 (3) (2006)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks. IPDPS (2005)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements. ISAAC (2004)
Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim
Fault Hamiltonicity of Meshes with Two Wraparound Edges. COCOON (2004)
Cheol Kim, Jung Choi, Hyeong-Seok Lim
Embedding Full Ternary Trees into Recursive Circulants. EurAsia-ICT (2002)
Min-Woo Shin, Nak-Keun Joo, Hyeong-Seok Lim
A Distributed Low-Cost Dynamic Multicast Routing Algorithm with Delay Constraints. EurAsia-ICT (2002)
Hyeong-Ok Lee, Jong-Seok Kim, Eunseuk Oh, Hyeong-Seok Lim
Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube. EurAsia-ICT (2002)
Susanne E. Hambrusch, Chuan-Ming Liu, Hyeong-Seok Lim
Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees. J. Graph Algorithms Appl. 4 (4) (2000)
Susanne E. Hambrusch, Hyeong-Seok Lim
Minimizing Broadcast Costs Under Edge Reductions in Tree Networks. Discret. Appl. Math. 91 (1-3) (1999)
Susanne E. Hambrusch, Hyeong-Seok Lim
Minimizing the Diameter in Tree Networks Under Edge Reductions. Parallel Process. Lett. 9 (3) (1999)
Nak-Keun Joo, Hyeong-Seok Lim
A new interconnection network for parallel computer with low diameter. ICPADS (1997)
Susanne E. Hambrusch, Hyeong-Seok Lim
Minimizing Broadcast Costs under Edge Reductions in Tree Networks. ICPADS (1997)
Hyeong-Seok Lim, Jung-Heum Park, Kyung-Yong Chwa
Embedding Trees in Recursive Circulants. Discret. Appl. Math. 69 (1-2) (1996)