2009 |
20 | 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 |
19 | 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 |
18 | EE | Jung-Heum Park:
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m, 4).
Theor. Comput. Sci. 390(1): 70-80 (2008) |
2007 |
17 | 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 |
16 | 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 |
15 | EE | Jung-Heum Park,
Hyeong-Seok Lim,
Hee-Chul Kim:
Embedding Starlike Trees into Hypercube-Like Interconnection Networks.
ISPA Workshops 2006: 301-310 |
14 | 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 |
13 | EE | Jung-Heum Park,
Hee-Chul Kim,
Hyeong-Seok Lim:
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks.
IPDPS 2005 |
2004 |
12 | EE | Jung-Heum Park:
One-to-Many Disjoint Path Covers in a Graph with Faulty Elements.
COCOON 2004: 392-401 |
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 |
9 | 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 |
8 | EE | Jung-Heum Park,
Hee-Chul Kim:
Fault-Hamiltonicity of Product Graph of Path and Cycle.
COCOON 2003: 319-328 |
2000 |
7 | EE | Jung-Heum Park,
Kyung-Yong Chwa:
Recursive circulants and their embeddings among hypercubes.
Theor. Comput. Sci. 244(1-2): 35-62 (2000) |
1999 |
6 | EE | Jung-Heum Park,
Hee-Chul Kim:
Dihamiltonian Decomposition of Regular Graphs with Degree Three.
WG 1999: 240-249 |
1998 |
5 | EE | Jung-Heum Park:
Hamiltonian Decomposition of Recursive Circulants.
ISAAC 1998: 297-306 |
1996 |
4 | EE | Hyeong-Seok Lim,
Jung-Heum Park,
Kyung-Yong Chwa:
Embedding Trees in Recursive Circulants.
Discrete Applied Mathematics 69(1-2): 83-99 (1996) |
1995 |
3 | EE | Sung-Ho Kim,
Jung-Heum Park,
Seung-Hak Choi,
Sung Yong Shin,
Kyung-Yong Chwa:
An Optimal Algorithm for Finding the Edge Visibility Polygon under Limited Visibility.
Inf. Process. Lett. 53(6): 359-365 (1995) |
1994 |
2 | | Jung-Heum Park,
Kyung-Yong Chwa:
On the Construction of Regular Minimal Broadcast Digraphs.
Theor. Comput. Sci. 124(2): 329-342 (1994) |
1993 |
1 | | Jung-Heum Park,
Sung Yong Shin,
Kyung-Yong Chwa,
Tony C. Woo:
On the Number of Guard Edges of a Polygon.
Discrete & Computational Geometry 10: 447-462 (1993) |