Research Interests

Design and Analysis of Algorithms

Graph Theory and Algorithms

Theory of Computation

Selected Papers

Written in English [DBLP]

- Jung-Heum Park, "Paired 3-disjoint path covers in bipartite torus-like graphs with edge faults,"
*International Journal of Foundations of Computer Science*(to appear). [pdf] - Jung-Heum Park and Hyeong-Seok Lim, "Characterization of interval graphs that are paired 2-disjoint path coverable,"
*The Journal of Supercomputing***79(3)**, pp. 2783-2800, Feb. 2023. [pdf] - Jung-Heum Park, "Unpaired many-to-many disjoint path covers in nonbipartite torus-like graphs with faulty elements,"
*IEEE Access***10**, pp. 127589-127600, Dec. 2022. [pdf] - Jung-Heum Park, "A sufficient condition for the unpaired k-disjoint path coverability of interval graphs,"
*The Journal of Supercomputing***77(7)**, pp. 6871-6888, July 2021. [pdf] - Jung-Heum Park, "Torus-like graphs and their paired many-to-many disjoint path covers,"
*Discrete Applied Mathematics***289**, pp. 64-77, Jan. 2021. [pdf] - Jung-Heum Park and Hyeong-Seok Lim, "Characterization of interval graphs that are unpaired 2-disjoint path coverable,"
*Theoretical Computer Science***821**, pp. 71-86, June 2020. [pdf] - Jung-Heum Park, Hyeong-Seok Lim, and Hee-Chul Kim, "Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs,"
*Journal of Computer and System Sciences***105**, pp. 104-115, Nov. 2019. [pdf] - Jung-Heum Park, Jae-Hoon Kim, and Hyeong-Seok Lim, "Disjoint path covers joining prescribed source and sink sets in interval graphs,"
*Theoretical Computer Science***776**, pp. 125-137, July 2019. [pdf] - Jung-Heum Park and Insung Ihm, "A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph,"
*Information Processing Letters***142**, pp. 57-63, Feb. 2019. [pdf] - Jung-Heum Park, "Paired many-to-many 3-disjoint path covers in bipartite toroidal grids,"
*Journal of Computing Science and Engineering***12(3)**, pp. 115-126, Sep. 2018. [pdf] - Jung-Heum Park, Hee-Chul Kim, and Hyeong-Seok Lim, "Disjoint path covers with path length constraints in restricted hypercube-like graphs,"
*Journal of Computer and System Sciences***89**, pp. 246-269, Nov. 2017. [pdf] - Insung Ihm and Jung-Heum Park, "A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph,"
*Discrete Applied Mathematics***218**, pp. 98-112, Feb. 2017. [pdf] - Jung-Heum Park, "Paired many-to-many disjoint path covers in restricted hypercube-like graphs,"
*Theoretical Computer Science***634**, pp. 24-34, June 2016. [pdf] - Jung-Heum Park, Joonsoo Choi, and Hyeong-Seok Lim, "Algorithms for finding disjoint path covers in unit interval graphs,"
*Discrete Applied Mathematics***205**, pp. 132-149, May 2016. [pdf] - Jung-Heum Park, "Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs,"
*Theoretical Computer Science***617**, pp. 45-64, Feb. 2016. [pdf] - Hyeong-Seok Lim, Hee-Chul Kim, and Jung-Heum Park, "Ore-type degree conditions for disjoint path covers in simple graphs,"
*Discrete Mathematics***339**, pp. 770-779, Feb. 2016. [pdf] - Jung-Heum Park and Insung Ihm, "Many-to-many two-disjoint path covers in cylindrical and toroidal grids,"
*Discrete Applied Mathematics***185**, pp. 168-191, Apr. 2015. [pdf] - Hyeong-Seok Lim, Jung-Heum Park, and Hee-Chul Kim, "The bicube: an interconnection of two hypercubes,"
*International Journal of Computer Mathematics***92(1)**, pp. 29-40, Jan. 2015. [pdf] - Hee-Chul Kim, Hyeong-Seok Lim, and Jung-Heum Park, "An approach to conditional diagnosability analysis under the PMC model and its application to torus networks,"
*Theoretical Computer Science***548**, pp. 98-116, Sep. 2014. [pdf] - Jung-Heum Park and Insung Ihm, "Disjoint path covers in cubes of connected graphs,"
*Discrete Mathematics***325**, pp. 65-73, June 2014. [pdf] - Sook-Yeon Kim and Jung-Heum Park, "Many-to-many two-disjoint path covers in restricted hypercube-like graphs,"
*Theoretical Computer Science***531**, pp. 26-36, Apr. 2014. [pdf] - Sook-Yeon Kim and Jung-Heum Park, "Paired many-to-many disjoint path covers in recursive circulants
*G(2*,"^{m},4)*IEEE Transactions on Computers***62(12)**, pp. 2468-2475, Dec. 2013. [pdf] - Shinhaeng Jo, Jung-Heum Park, and Kyung-Yong Chwa, "Paired many-to-many disjoint path covers in faulty hypercubes,"
*Theoretical Computer Science***513**, pp. 1-24, Nov. 2013. [pdf] - Shinhaeng Jo, Jung-Heum Park, and Kyung-Yong Chwa, "Paired 2-disjoint path covers and strongly hamiltonian laceability of bipartite hypercube-like graphs,"
*Information Sciences***242**, pp. 103-112, Sep. 2013. [pdf] - Jung-Heum Park and Insung Ihm, "Single-source three-disjoint path covers in cubes of connected graphs,"
*Information Processing Letters***113(14-16)**, pp. 527-532, July-Aug. 2013. [pdf] - Jung-Heum Park and Insung Ihm, "Strong matching preclusion under the conditional fault model,"
*Discrete Applied Mathematics***161(7-8)**, pp. 1093-1105, May 2013. [pdf] - Jae-Ha Lee and Jung-Heum Park, "General-demand disjoint path covers in a graph with faulty elements,"
*International Journal of Computer Mathematics***89(5)**, pp. 606-617, 2012. [pdf] - Jung-Heum Park and Insung Ihm, "Strong matching preclusion,"
*Theoretical Computer Science***412(45)**, pp. 6409-6419, 2011. [pdf] - Sook-Yeon Kim, Jae-Ha Lee, and Jung-Heum Park, "Disjoint path covers in recursive circulants
*G(2*with faulty elements,"^{m},4)*Theoretical Computer Science***412(35)**, pp. 4636-4649, 2011. [pdf] - Shinhaeng Jo, Jung-Heum Park, and Kyung-Yong Chwa, "Paired many-to-many Bi-DPC's on hypercubes,"
in
*Proc. of Workshop on Algorithms and Computation WAAC2011*, Busan, Korea, July 2011. - Jung-Heum Park, Hee-Chul Kim, and Hyeong-Seok Lim, "Many-to-many disjoint path covers in the presence of faulty elements,"
*IEEE Transactions on Computers***58(4)**, pp. 528-540, Apr. 2009. [pdf] - Jung-Heum Park and Sang Hyuk Son, "Conditional matching preclusion for hypercube-like interconnection networks,"
*Theoretical Computer Science***410(27-29)**, pp. 2632-2640, 2009. [pdf] - Jung-Heum Park, Hee-Chul Kim, and Hyeong-Seok Lim, "On the construction of paired many-to-many disjoint path covers
in hypercube-like interconnection networks with faulty elements,"
in
*Proc. of Workshop on Advances in Parallel and Distributed Computational Models*, Miami, Florida, Apr. 2008. [pdf]
[program]
- Jung-Heum Park, "Panconnectivity and edge-pancyclicity of faulty recursive circulant
*G(2*,"^{m},4)*Theoretical Computer Science***390(1)**, pp. 70-80, 2008. [pdf] - Jung-Heum Park, Hyeong-Seok Lim, and Hee-Chul Kim, "Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements,"
*Theoretical Computer Science***377(1-3)**, pp. 170-180, 2007. [pdf] - Jung-Heum Park, Hyeong-Seok Lim, and Hee-Chul Kim, "Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements,"
in
*Proc. of ISPA Workshops 2006 (LNCS #4331)*, Sorrento, Italy, pp. 291-300, Dec. 2006. [pdf] - Jung-Heum Park, Hyeong-Seok Lim, and Hee-Chul Kim, "Embedding starlike trees into hypercube-like interconnection networks,"
in
*Proc. of ISPA Workshops 2006 (LNCS #4331)*, Sorrento, Italy, pp. 301-310, Dec. 2006. [pdf] - Jung-Heum Park, Hyeong-Seok Lim, and Hee-Chul Kim, "Every starlike tree spans restricted HL-graphs,"
in
*Proc. of Workshop on Algorithms and Computation WAAC2006*, Sapporo, Japan, July 2006. - Jung-Heum Park, Hee-Chul Kim, and Hyeong-Seok Lim, "Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements,"
*IEEE Transactions on Parallel and Distributed Systems***17(3)**, pp. 227-240, Mar. 2006.[pdf] [supplemental material] - Hyeong-Seok Lim, Hee-Chul Kim, and Jung-Heum Park, "Hypohamiltonian-connectedness and pancyclicity of hypercube-like interconnection networks with faulty elements,"
in
*Proc. of Workshop on Algorithms and Computation WAAC2005*, Seoul, Korea, Aug. 2005. - Jung-Heum Park, Hee-Chul Kim, and Hyeong-Seok Lim, "Fault-hamiltonicity of hypercube-like interconnection networks,"
in
*Proc. of IEEE International Parallel & Distributed Processing Symposium IPDPS2005*, Denver, Colorado, Apr. 2005. [pdf] - Jung-Heum Park and Hee-Chul Kim, "Longest paths and cycles in faulty star graphs,"
*J. Parallel Distrib. Comput.***64(11)**, pp. 1286-1296, 2004.[pdf] - Jung-Heum Park and Hee-Chul Kim, and Hyeong-Seok Lim, "Many-to-many disjoint path covers in a graph with faulty elements,"
in
*Proc. of the International Symposium on Algorithms and Computation ISAAC 2004 (LNCS #3341)*, pp. 742-753, Dec. 2004.[pdf] - Jung-Heum Park, "One-to-many disjoint path covers in a graph with faulty elements,"
in
*Proc. of the International Computing and Combinatorics Conference COCOON 2004 (LNCS #3106)*, pp. 392-401, Aug. 2004.[pdf] - Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, and Hee-Chul Kim, "Fault hamiltonicity of meshes with two wraparound edges,"
in
*Proc. of the International Computing and Combinatorics Conference COCOON 2004 (LNCS #3106)*, pp. 412-421, Aug. 2004.[pdf] - Jung-Heum Park and Hee-Chul Kim, "Fault-hamiltonicity of product graph of path and cycle,"
in
*Proc. of the International Computing and Combinatorics Conference COCOON 2003 (LNCS #2697)*, pp. 319-328, July 2003.[pdf] -
Hee-Chul Kim and Jung-Heum Park, "Paths and cycles in
*d*-dimensional tori with faults,"*Workshop on Algorithms and Computation WAAC'01*, Pusan, Korea, pp. 67-74, June 2001. [postscript] [pdf] -
Jung-Heum Park and Kyung-Yong Chwa, "Recursive circulants and their embeddings
among hypercubes,"
*Theoretical Computer Science***244**, pp. 35-62, Aug. 2000. [postscript] [pdf] -
Hee-Chul Kim and Jung-Heum Park, "Fault hamiltonicity of two-dimensional torus networks,"
*Workshop on Algorithms and Computation WAAC'00*, Tokyo, Japan, pp. 110-117, July 2000. [postscript] [pdf] -
Jung-Heum Park and Hee-Chul Kim, "Dihamiltonian decomposition of regular
graphs with degree three,"
*International Workshop on Graph-Theoretic Concepts in Computer Science WG'99 (LNCS #1665)*, Ascona, Switzerland, pp. 240-249, June 1999. [postscript] [pdf] -
Jung-Heum Park, "Hamiltonian decomposition of recursive circulants,"
*International Symposium on Algorithms and Computation ISAAC'98 (LNCS #1533)*, Taejon, Korea, pp. 297-306, Dec. 1998. [postscript] [pdf] -
Hyeong-Seok Lim, Jung-Heum Park, and Kyung-Yong Chwa, "Embedding trees
into recursive circulants,"
*Discrete Applied Mathematics***69**, pp. 83-99, 1996. -
Sung-Ho Kim, Jung-Heum Park, Seung-Hak Choi, Sung Yong Shin, and Kyung-Yong
Chwa, "An optimal algorithm for finding edge visibility polygon under limited
visibility,"
*Information Processing Letters***53**, pp. 359-365, 1995. -
Jung-Heum Park and Kyung-Yong Chwa, "On the construction of regular minimal
broadcast digraphs,"
*Theoretical Computer Science***124**, pp. 329-342, 1994. -
Jung-Heum Park and Kyung-Yong Chwa, "Recursive circulant: a new topology
of multicomputer networks,"
*IEEE International Symposium on Parallel Architectures, Algorithms and Networks ISPAN'94*, Kanazawa, Japan, Dec. 1994. -
Jung-Heum Park, Sung Yong Shin, Kyung-Yong Chwa, and Tony C. Woo, "On the
number of guard edges of a polygon,"
*Discrete and Computational Geometry***10**, pp. 447-462, 1993. [pdf]

- Ho-Dong Kim and Jung-Heum Park, "Many-to-many disjoint path covers in two-dimensional bipartite tori with a single vertex fault,"
*Journal of KIISE***39(5)**, pp. 333-342, Oct. 2012. [pdf] - Jung-Heum Park, "Many-to-many disjoint path covers in two-dimensional tori,"
*Journal of KIISE***38(1)**, pp. 42-48, Feb. 2011. [pdf] - Eusang Kim and Jung-Heum Park, "Paired many-to-many disjoint path covers in recursive circulants and tori,"
*Journal of KIISE***36(1)**, pp. 40-51, Feb. 2009. [pdf] - Jung-Heum Park, "Matching preclusion problem in restricted HL-graphs and recursive circulant
*G(2*,"^{m},4)*Journal of KISS***35(2)**, pp. 60-65, Feb. 2008. [pdf] - Jung-Heum Park, "Conditions for disjoint path coverability in proper interval graphs,"
*Journal of KISS***34(10)**, pp. 539-544, Oct. 2007. [pdf] - Hee-Chul Kim, Do-Bin Im, and Jung-Heum Park, "Fault diameter and mutually disjoint paths in multidimensional torus networks,"
*Journal of KISS***34(5)**, pp. 176-186, May 2007. - Jung-Heum Park, "Unpaired many-to-many disjoint path covers in hypercube-like interconnection networks,"
*Journal of KISS***33(10)**, pp. 789-796, Oct. 2006. [pdf] - Jung-Heum Park, "Many-to-many disjoint path covers in double loop networks,"
*Journal of KISS***32(8)**, pp. 426-431, Aug. 2005. [pdf] - Jung-Heum Park, "Cycle embedding of faulty recursive circulants,"
*Journal of KISS***31(2)**, pp. 86-94, Feb. 2004. [pdf] - Jung-Heum Park, "Fault-hamiltonicity of bipartite double loop networks,"
*Journal of KISS***31(1)**, pp. 19-26, Jan. 2004. [pdf] - Jung-Heum Park, "One-to-one disjoint path covers in recursive circulants,"
*Journal of KISS***30(12)**, pp. 691-698, Dec. 2003. [pdf] - Hee-Chul Kim, Hoyoung Jung, and Jung-Heum Park, "Fault diameter of recursive circulant
*G(2*,"^{m},2^{k})*Journal of KISS***29(12)**, pp. 665-679, Dec. 2002. [pdf] -
Jung-Heum Park and Hee-Chul Kim, "Deterministic measures of fault-tolerance in recursive circulants and hypercubes,"
*Journal of KISS***29(9)**, pp. 493-502, Oct. 2002. [pdf] -
Hoyoung Jung, Hee-Chul Kim, and Jung-Heum Park, "Fault diameter of recursive circulants
*G(2*,"^{m},2^{k})*KISS Fall Conference***28(2)**, Oct. 2001. [pdf] -
Jung-Heum Park, "Strong hamiltonicity of recursive circulants,"
*Journal of KISS***28(8)**, pp. 399-405, Aug. 2001. [pdf] -
Jung-Heum Park and Hee-Chul Kim, "Longest Paths and Cycles in Faulty Star Graphs,"
*KISS Spring Conference***28(1)**, pp. 742-744, April 2001. [pdf] -
Jung-Heum Park and Hee-Chul Kim, "Fault hamiltonicity of double loop networks
*G(mn;1,m)*with even*m*and*n*,"*Journal of KISS***27(10)**, pp. 868-879, Oct. 2000. [pdf] -
Jung-Heum Park and Hee-Chul Kim, "Fault hamiltonicity of double loop networks
*G(mn;1,m)*with even*m*and*n*,"*KISS Spring Conference***27(1)**, April 2000. [postscript] [pdf] -
Jung-Heum Park and Kyung-Yong Chwa, "Topological properties of recursive
circulants: disjoint cycles and graph invariants,"
*Journal of KISS***26(8)**, pp. 999-1008, Aug. 1999. [pdf] -
Jung-Heum Park and Kyung-Yong Chwa, "Topological properties of recursive
circulants: disjoint paths,"
*Journal of KISS***26(8)**, pp. 1009-1023, Aug. 1999. [pdf] -
Jung-Heum Park, "Disjoint cycles in recursive circulants
*G(2*,"^{m},2^{k})*KISS Fall Conference***25(2)**, pp. 664-666, Oct. 1998. [postscript] [pdf] -
Jung-Heum Park and Kyung-Yong Chwa, "Disjoint paths of bounded length in
recursive circulants G(2
^{m},2^{k}),"*KISS Spring Conference***25(1)**, pp. 685-687, Apr. 1998. [postscript] [pdf] -
Jung-Heum Park and Hee-Chul Kim, "Hamiltonian decomposition of symmetric
3-regular digraphs and its applications,"
*Journal of KISS***25(7)**, pp. 695-701, 1998. [pdf] -
Sang-Min Park, Sook-Yeon Kim, Jung-Heum Park, and Kyung-Yong Chwa, "Embedding
complete binary trees and meshes of trees into recursive circulants G(2
^{m},4),"*Journal of KISS***24(4)**, pp. 369-378, 1997. -
Jung-Heum Park and Kyung-Yong Chwa, "Embeddings among recursive circulants
and hypercubes,"
*Journal of KISS***22(12)**, pp. 1736-1741, 1995. -
Jung-Heum Park and Kyung-Yong Chwa, "A study on two-step fault diagnosable
systems,"
*Journal of KISS***14(4)**, pp. 308-319, 1987.