| 2009 |
|---|
| 12 | 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 |
|---|
| 11 | 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 |
|---|
| 10 | 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 |
|---|
| 9 | 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 |
| 8 | EE | Jung-Heum Park,
Hyeong-Seok Lim,
Hee-Chul Kim:
Embedding Starlike Trees into Hypercube-Like Interconnection Networks.
ISPA Workshops 2006: 301-310 |
| 7 | 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 |
|---|
| 6 | EE | Jung-Heum Park,
Hee-Chul Kim,
Hyeong-Seok Lim:
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks.
IPDPS 2005 |
| 2004 |
|---|
| 5 | 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 |
| 4 | 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 |
| 3 | EE | Jung-Heum Park,
Hee-Chul Kim:
Longest paths and cycles in faulty star graphs.
J. Parallel Distrib. Comput. 64(11): 1286-1296 (2004) |
| 2003 |
|---|
| 2 | EE | Jung-Heum Park,
Hee-Chul Kim:
Fault-Hamiltonicity of Product Graph of Path and Cycle.
COCOON 2003: 319-328 |
| 1999 |
|---|
| 1 | EE | Jung-Heum Park,
Hee-Chul Kim:
Dihamiltonian Decomposition of Regular Graphs with Degree Three.
WG 1999: 240-249 |
