Hyeong-Seok Lim

According to our database1, Hyeong-Seok Lim authored at least 33 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A deep learning-based biomonitoring system for detecting water pollution using Caenorhabditis elegans swimming behaviors.
Ecol. Informatics, 2024

2023
Characterization of interval graphs that are paired 2-disjoint path coverable.
J. Supercomput., 2023

2020
Characterization of interval graphs that are unpaired 2-disjoint path coverable.
Theor. Comput. Sci., 2020

2019
Disjoint path covers joining prescribed source and sink sets in interval graphs.
Theor. Comput. Sci., 2019

Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs.
J. Comput. Syst. Sci., 2019

2017
Disjoint path covers with path length constraints in restricted hypercube-like graphs.
J. Comput. Syst. Sci., 2017

2016
Ore-type degree conditions for disjoint path covers in simple graphs.
Discret. Math., 2016

Algorithms for finding disjoint path covers in unit interval graphs.
Discret. Appl. Math., 2016

2015
The bicube: an interconnection of two hypercubes.
Int. J. Comput. Math., 2015

2014
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks.
Theor. Comput. Sci., 2014

An improved preprocessing algorithm for haplotype inference by pure parsimony.
J. Bioinform. Comput. Biol., 2014

2010
An efficient similarity search based on indexing in large DNA databases.
Comput. Biol. Chem., 2010

2009
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements.
IEEE Trans. Computers, 2009

2008
On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements.
Theor. Comput. Sci., 2007

An Efficient Algorithm for Finding Gene-Specific Probes for DNA Microarrays.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

An Efficient Two-Phase Algorithm to Find Gene-Specific Probes for Large Genomes.
Proceedings of the Frontiers in the Convergence of Bioscience and Information Technologies 2007, 2007

A Fast Heuristic Algorithm for Similarity Search in Large DNA Databases.
Proceedings of the Frontiers in the Convergence of Bioscience and Information Technologies 2007, 2007

A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

2006
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements.
IEEE Trans. Parallel Distributed Syst., 2006

Embedding Starlike Trees into Hypercube-Like Interconnection Networks.
Proceedings of the Frontiers of High Performance Computing and Networking, 2006

2005
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Fault Hamiltonicity of Meshes with Two Wraparound Edges.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2002
A Distributed Low-Cost Dynamic Multicast Routing Algorithm with Delay Constraints.
Proceedings of the EurAsia-ICT 2002: Information and Communication Technology, 2002

Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube.
Proceedings of the EurAsia-ICT 2002: Information and Communication Technology, 2002

Embedding Full Ternary Trees into Recursive Circulants.
Proceedings of the EurAsia-ICT 2002: Information and Communication Technology, 2002

2000
Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees.
J. Graph Algorithms Appl., 2000

1999
Minimizing the Diameter in Tree Networks Under Edge Reductions.
Parallel Process. Lett., 1999

Minimizing Broadcast Costs Under Edge Reductions in Tree Networks.
Discret. Appl. Math., 1999

1997
A new interconnection network for parallel computer with low diameter.
Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

1996
Embedding Trees in Recursive Circulants.
Discret. Appl. Math., 1996


  Loading...