| 2009 |
|---|
| 23 | EE | 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): 528-540 (2009) |
| 2008 |
|---|
| 22 | EE | Seung-Ho Kang,
In-Seon Jeong,
Mun-Ho Choi,
Hyeong-Seok Lim:
Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information.
FAW 2008: 45-54 |
| 21 | EE | 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: 1-8 |
| 2007 |
|---|
| 20 | EE | 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: 14-25 |
| 19 | EE | 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: 205-210 |
| 18 | EE | In-Seon Jeong,
Kyoung-Wook Park,
Hyeong-Seok Lim:
A Fast Heuristic Algorithm for Similarity Search in Large DNA Databases.
FBIT 2007: 335-340 |
| 17 | EE | 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: 453-464 |
| 16 | EE | 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): 170-180 (2007) |
| 2006 |
|---|
| 15 | EE | Jung-Heum Park,
Hyeong-Seok Lim,
Hee-Chul Kim:
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements.
ISPA Workshops 2006: 291-300 |
| 14 | EE | Jung-Heum Park,
Hyeong-Seok Lim,
Hee-Chul Kim:
Embedding Starlike Trees into Hypercube-Like Interconnection Networks.
ISPA Workshops 2006: 301-310 |
| 13 | EE | 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 Distrib. Syst. 17(3): 227-240 (2006) |
| 2005 |
|---|
| 12 | EE | Jung-Heum Park,
Hee-Chul Kim,
Hyeong-Seok Lim:
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks.
IPDPS 2005 |
| 2004 |
|---|
| 11 | EE | Kyoung-Wook Park,
Hyeong-Seok Lim,
Jung-Heum Park,
Hee-Chul Kim:
Fault Hamiltonicity of Meshes with Two Wraparound Edges.
COCOON 2004: 412-421 |
| 10 | EE | Jung-Heum Park,
Hee-Chul Kim,
Hyeong-Seok Lim:
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements.
ISAAC 2004: 742-753 |
| 2002 |
|---|
| 9 | EE | Min-Woo Shin,
Nak-Keun Joo,
Hyeong-Seok Lim:
A Distributed Low-Cost Dynamic Multicast Routing Algorithm with Delay Constraints.
EurAsia-ICT 2002: 377-386 |
| 8 | EE | 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: 858-865 |
| 7 | EE | Cheol Kim,
Jung Choi,
Hyeong-Seok Lim:
Embedding Full Ternary Trees into Recursive Circulants.
EurAsia-ICT 2002: 874-882 |
| 2000 |
|---|
| 6 | EE | 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) |
| 1999 |
|---|
| 5 | EE | Susanne E. Hambrusch,
Hyeong-Seok Lim:
Minimizing Broadcast Costs Under Edge Reductions in Tree Networks.
Discrete Applied Mathematics 91(1-3): 93-117 (1999) |
| 4 | EE | Susanne E. Hambrusch,
Hyeong-Seok Lim:
Minimizing the Diameter in Tree Networks Under Edge Reductions.
Parallel Processing Letters 9(3): 361-371 (1999) |
| 1997 |
|---|
| 3 | EE | Susanne E. Hambrusch,
Hyeong-Seok Lim:
Minimizing Broadcast Costs under Edge Reductions in Tree Networks.
ICPADS 1997: 188-195 |
| 2 | EE | Nak-Keun Joo,
Hyeong-Seok Lim:
A new interconnection network for parallel computer with low diameter.
ICPADS 1997: 540-547 |
| 1996 |
|---|
| 1 | EE | Hyeong-Seok Lim,
Jung-Heum Park,
Kyung-Yong Chwa:
Embedding Trees in Recursive Circulants.
Discrete Applied Mathematics 69(1-2): 83-99 (1996) |
