Jung-Heum Park

1.3k total citations
56 papers, 928 citations indexed

About

Jung-Heum Park is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Jung-Heum Park has authored 56 papers receiving a total of 928 indexed citations (citations by other indexed papers that have themselves been cited), including 43 papers in Computer Networks and Communications, 39 papers in Computational Theory and Mathematics and 20 papers in Electrical and Electronic Engineering. Recurrent topics in Jung-Heum Park's work include Interconnection Networks and Systems (41 papers), Advanced Graph Theory Research (39 papers) and Advanced Optical Network Technologies (14 papers). Jung-Heum Park is often cited by papers focused on Interconnection Networks and Systems (41 papers), Advanced Graph Theory Research (39 papers) and Advanced Optical Network Technologies (14 papers). Jung-Heum Park collaborates with scholars based in South Korea and United States. Jung-Heum Park's co-authors include Hyeong-Seok Lim, Hee‐Chul Kim, Kyung‐Yong Chwa, Insung Ihm, Sang H. Son, Jaeha Lee, Sangjin Lee, Jaehoon Kim, Wang‐Cheol Song and Jin-Kook Kim and has published in prestigious journals such as IEEE Access, Information Sciences and IEEE Transactions on Computers.

In The Last Decade

Jung-Heum Park

55 papers receiving 898 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jung-Heum Park South Korea	18	840	588	467	103	79	56	928
Zhizhang Shen United States	13	454 0.5×	158 0.3×	198 0.4×	47 0.5×	127 1.6×	66	513
Hyeong-Seok Lim South Korea	8	368 0.4×	221 0.4×	235 0.5×	33 0.3×	31 0.4×	31	431
Marc J. Lipman United States	14	462 0.6×	269 0.5×	128 0.3×	104 1.0×	118 1.5×	33	556
Rong‐Xia Hao China	20	1.1k 1.4×	495 0.8×	537 1.1×	91 0.9×	278 3.5×	125	1.3k
Balakrishnan Krishnamurthy United States	10	592 0.7×	311 0.5×	403 0.9×	76 0.7×	60 0.8×	16	870
Qian‐Ping Gu Canada	13	338 0.4×	194 0.3×	233 0.5×	19 0.2×	23 0.3×	60	533
J. Fàbrega Spain	11	589 0.7×	339 0.6×	214 0.5×	41 0.4×	194 2.5×	26	671
Jinn‐Shyong Yang Taiwan	17	625 0.7×	265 0.5×	391 0.8×	41 0.4×	58 0.7×	32	652
Chin-Wen Ho Taiwan	10	348 0.4×	230 0.4×	146 0.3×	39 0.4×	23 0.3×	26	451
Pao-Lien Lai Taiwan	10	596 0.7×	150 0.3×	267 0.6×	38 0.4×	125 1.6×	23	622

Countries citing papers authored by Jung-Heum Park

Since Specialization

Citations

This map shows the geographic impact of Jung-Heum Park's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jung-Heum Park with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jung-Heum Park more than expected).

Fields of papers citing papers by Jung-Heum Park

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jung-Heum Park. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jung-Heum Park. The network helps show where Jung-Heum Park may publish in the future.

Co-authorship network of co-authors of Jung-Heum Park

This figure shows the co-authorship network connecting the top 25 collaborators of Jung-Heum Park. A scholar is included among the top collaborators of Jung-Heum Park based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jung-Heum Park. Jung-Heum Park is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Park, Jung-Heum & Hyeong-Seok Lim. (2020). Characterization of interval graphs that are unpaired 2-disjoint path coverable. Theoretical Computer Science. 821. 71–86. 3 indexed citations

Park, Jung-Heum. (2018). Paired Many-to-Many 3-Disjoint Path Covers in Bipartite Toroidal Grids. Journal of Computing Science and Engineering. 12(3). 115–126. 5 indexed citations

Park, Jung-Heum, Hee‐Chul Kim, & Hyeong-Seok Lim. (2017). Disjoint path covers with path length constraints in restricted hypercube-like graphs. Journal of Computer and System Sciences. 89. 246–269. 3 indexed citations

Park, Jung-Heum, et al.. (2016). Algorithms for finding disjoint path covers in unit interval graphs. Discrete Applied Mathematics. 205. 132–149. 5 indexed citations

Park, Jung-Heum & Insung Ihm. (2015). Many-to-many two-disjoint path covers in cylindrical and toroidal grids. Discrete Applied Mathematics. 185. 168–191. 18 indexed citations

Lim, Hyeong-Seok, Hee‐Chul Kim, & Jung-Heum Park. (2015). Ore-type degree conditions for disjoint path covers in simple graphs. Discrete Mathematics. 339(2). 770–779. 14 indexed citations

Kim, Hee‐Chul, Hyeong-Seok Lim, & Jung-Heum Park. (2014). An approach to conditional diagnosability analysis under the PMC model and its application to torus networks. Theoretical Computer Science. 548. 98–116. 9 indexed citations

Park, Jung-Heum & Insung Ihm. (2014). Disjoint path covers in cubes of connected graphs. Discrete Mathematics. 325. 65–73. 12 indexed citations

Park, Jung-Heum, et al.. (2012). Many-to-Many Disjoint Path Covers in Two-Dimensional Bipartite Tori with a Single Vertex Fault. 39(5). 333–342. 1 indexed citations

10.

Park, Jung-Heum & Insung Ihm. (2012). Strong matching preclusion under the conditional fault model. Discrete Applied Mathematics. 161(7-8). 1093–1105. 15 indexed citations

11.

Park, Jung-Heum, et al.. (2011). Digital Forensic Methodology of IaaS Cloud Computing Service. Information Security and Cryptology. 21(6). 55–65. 1 indexed citations

12.

Kim, Jin-Kook, Jung-Heum Park, & Sangjin Lee. (2010). A Framework for Data Recovery and Analysis from Digital Forensics Point of View. 17C(5). 391–398. 2 indexed citations

13.

Park, Jung-Heum. (2009). Many-to-Many Disjoint Path Covers in Two-Dimensional Tori. 38(1). 42–48. 8 indexed citations

14.

Park, Jung-Heum, et al.. (2009). Paired Many-to-Many Disjoint Path Covers in Recursive Circulants and Tori. 36(1). 40–51. 5 indexed citations

15.

Park, Bora, Jung-Heum Park, & Sangjin Lee. (2008). Information Hiding and Detection in MS Office 2007 file. Information Security and Cryptology. 18(3). 143–154. 1 indexed citations

16.

Park, Jung-Heum. (2008). Matching Preclusion Problem in Restricted HL-graphs and Recursive Circulant $G(2^m,4)$. 35(2). 60–65. 35 indexed citations

17.

Park, Jung-Heum. (2007). Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4). Theoretical Computer Science. 390(1). 70–80. 28 indexed citations

18.

Park, Jung-Heum. (2007). Conditions for Disjoint Path Coverability in Proper Interval Graphs. 34(10). 539–554. 1 indexed citations

19.

Park, Jung-Heum. (2006). Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks. 33(10). 789–796. 18 indexed citations

20.

Park, Jung-Heum. (2005). Many-to-Many Disjoint Path Covers in Double Loop Networks. 32(8). 426–431. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact