Hyeong-Seok Lim

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