default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJung-Heum Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j41]Jung-Heum Park:
Unpaired disjoint path covers in bipartite torus-like graphs with edge faults. J. Supercomput. 81(1): 48 (2025)- 2023
- [j40]Jung-Heum Park
:
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults. Int. J. Found. Comput. Sci. 34(4): 429-441 (2023) - [j39]Jung-Heum Park, Hyeong-Seok Lim:
Characterization of interval graphs that are paired 2-disjoint path coverable. J. Supercomput. 79(3): 2783-2800 (2023) - 2022
- [j38]Jung-Heum Park:
Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements. IEEE Access 10: 127589-127600 (2022) - 2021
- [j37]Jung-Heum Park:
Torus-like graphs and their paired many-to-many disjoint path covers. Discret. Appl. Math. 289: 64-77 (2021) - [j36]Jung-Heum Park:
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs. J. Supercomput. 77(7): 6871-6888 (2021) - 2020
- [j35]Jung-Heum Park, Hyeong-Seok Lim:
Characterization of interval graphs that are unpaired 2-disjoint path coverable. Theor. Comput. Sci. 821: 71-86 (2020)
2010 – 2019
- 2019
- [j34]Jung-Heum Park, Insung Ihm:
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph. Inf. Process. Lett. 142: 57-63 (2019) - [j33]Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim:
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs. J. Comput. Syst. Sci. 105: 104-115 (2019) - [j32]Jung-Heum Park, Jae-Hoon Kim, Hyeong-Seok Lim:
Disjoint path covers joining prescribed source and sink sets in interval graphs. Theor. Comput. Sci. 776: 125-137 (2019) - 2018
- [j31]Jung-Heum Park:
Paired Many-to-Many 3-Disjoint Path Covers in Bipartite Toroidal Grids. J. Comput. Sci. Eng. 12(3): 115-126 (2018) - 2017
- [j30]Insung Ihm, Jung-Heum Park:
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph. Discret. Appl. Math. 218: 98-112 (2017) - [j29]Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim:
Disjoint path covers with path length constraints in restricted hypercube-like graphs. J. Comput. Syst. Sci. 89: 246-269 (2017) - 2016
- [j28]Jung-Heum Park, Joonsoo Choi, Hyeong-Seok Lim:
Algorithms for finding disjoint path covers in unit interval graphs. Discret. Appl. Math. 205: 132-149 (2016) - [j27]Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park:
Ore-type degree conditions for disjoint path covers in simple graphs. Discret. Math. 339(2): 770-779 (2016) - [j26]Jung-Heum Park:
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs. Theor. Comput. Sci. 617: 45-64 (2016) - [j25]Jung-Heum Park:
Paired many-to-many disjoint path covers in restricted hypercube-like graphs. Theor. Comput. Sci. 634: 24-34 (2016) - 2015
- [j24]Jung-Heum Park, Insung Ihm:
Many-to-many two-disjoint path covers in cylindrical and toroidal grids. Discret. Appl. Math. 185: 168-191 (2015) - [j23]Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim:
The bicube: an interconnection of two hypercubes. Int. J. Comput. Math. 92(1): 29-40 (2015) - 2014
- [j22]Jung-Heum Park, Insung Ihm:
Disjoint path covers in cubes of connected graphs. Discret. Math. 325: 65-73 (2014) - [j21]Sook-Yeon Kim, Jung-Heum Park:
Many-to-many two-disjoint path covers in restricted hypercube-like graphs. Theor. Comput. Sci. 531: 26-36 (2014) - [j20]Hee-Chul Kim, Hyeong-Seok Lim, Jung-Heum Park:
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks. Theor. Comput. Sci. 548: 98-116 (2014) - 2013
- [j19]Jung-Heum Park, Insung Ihm:
Strong matching preclusion under the conditional fault model. Discret. Appl. Math. 161(7-8): 1093-1105 (2013) - [j18]Jung-Heum Park, Insung Ihm:
Single-source three-disjoint path covers in cubes of connected graphs. Inf. Process. Lett. 113(14-16): 527-532 (2013) - [j17]Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa:
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs. Inf. Sci. 242: 103-112 (2013) - [j16]Sook-Yeon Kim, Jung-Heum Park:
Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m, 4))$. IEEE Trans. Computers 62(12): 2468-2475 (2013) - [j15]Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa:
Paired many-to-many disjoint path covers in faulty hypercubes. Theor. Comput. Sci. 513: 1-24 (2013) - 2012
- [j14]Jae-Ha Lee, Jung-Heum Park:
General-demand disjoint path covers in a graph with faulty elements. Int. J. Comput. Math. 89(5): 606-617 (2012) - 2011
- [j13]Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park:
Disjoint path covers in recursive circulants G(2m, 4) with faulty elements. Theor. Comput. Sci. 412(35): 4636-4649 (2011) - [j12]Jung-Heum Park, Insung Ihm:
Strong matching preclusion. Theor. Comput. Sci. 412(45): 6409-6419 (2011)
2000 – 2009
- 2009
- [j11]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) - [j10]Jung-Heum Park, Sang Hyuk Son:
Conditional matching preclusion for hypercube-like interconnection networks. Theor. Comput. Sci. 410(27-29): 2632-2640 (2009) - 2008
- [j9]Jung-Heum Park:
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m, 4). Theor. Comput. Sci. 390(1): 70-80 (2008) - [c11]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
- [j8]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
- [j7]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 Distributed Syst. 17(3): 227-240 (2006) - [c10]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 - [c9]Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim:
Embedding Starlike Trees into Hypercube-Like Interconnection Networks. ISPA Workshops 2006: 301-310 - 2005
- [c8]Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim:
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks. IPDPS 2005 - 2004
- [j6]Jung-Heum Park, Hee-Chul Kim:
Longest paths and cycles in faulty star graphs. J. Parallel Distributed Comput. 64(11): 1286-1296 (2004) - [c7]Jung-Heum Park:
One-to-Many Disjoint Path Covers in a Graph with Faulty Elements. COCOON 2004: 392-401 - [c6]Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim:
Fault Hamiltonicity of Meshes with Two Wraparound Edges. COCOON 2004: 412-421 - [c5]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 - 2003
- [c4]Jung-Heum Park, Hee-Chul Kim:
Fault-Hamiltonicity of Product Graph of Path and Cycle. COCOON 2003: 319-328 - 2000
- [j5]Jung-Heum Park, Kyung-Yong Chwa:
Recursive circulants and their embeddings among hypercubes. Theor. Comput. Sci. 244(1-2): 35-62 (2000)
1990 – 1999
- 1999
- [c3]Jung-Heum Park, Hee-Chul Kim:
Dihamiltonian Decomposition of Regular Graphs with Degree Three. WG 1999: 240-249 - 1998
- [c2]Jung-Heum Park:
Hamiltonian Decomposition of Recursive Circulants. ISAAC 1998: 297-306 - 1996
- [j4]Hyeong-Seok Lim, Jung-Heum Park, Kyung-Yong Chwa:
Embedding Trees in Recursive Circulants. Discret. Appl. Math. 69(1-2): 83-99 (1996) - 1995
- [j3]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
- [j2]Jung-Heum Park, Kyung-Yong Chwa:
On the Construction of Regular Minimal Broadcast Digraphs. Theor. Comput. Sci. 124(2): 329-342 (1994) - [c1]Jung-Heum Park, Kyung-Yong Chwa:
Recursive circulant: a new topology for multicomputer networks (extended abstract). ISPAN 1994: 73-80 - 1993
- [j1]Jung-Heum Park, Sung Yong Shin, Kyung-Yong Chwa, Tony C. Woo:
On the Number of Guard Edges of a Polygon. Discret. Comput. Geom. 10: 447-462 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
