This map shows the geographic impact of Kunsoo 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 Kunsoo Park with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kunsoo Park more than expected).
This network shows the impact of papers produced by Kunsoo 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 Kunsoo Park. The network helps show where Kunsoo Park may publish in the future.
Co-authorship network of co-authors of Kunsoo Park
This figure shows the co-authorship network connecting the top 25 collaborators of Kunsoo Park.
A scholar is included among the top collaborators of Kunsoo 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 Kunsoo Park. Kunsoo Park is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Park, Kunsoo, et al.. (2008). An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph. Fundamenta Informaticae. 84(1). 81–97.2 indexed citations
Apostolico, Alberto, Maxime Crochemore, & Kunsoo Park. (2005). Proceedings of the 16th annual conference on Combinatorial Pattern Matching.
10.
Christodoulakis, Manolis, Costas S. Iliopoulos, Kunsoo Park, & Jeong Seop Sim. (2005). Approximate Seeds of Strings. Research Portal (King's College London). 25–36.5 indexed citations
Park, Kunsoo, et al.. (1999). Linear-Time Construction of Two-Dimensional Suffix Trees. International Colloquium on Automata, Languages and Programming. 463–472.7 indexed citations
17.
Park, Kunsoo, et al.. (1998). An Efficient Convex Hull Algorithm on the Reconfigurable Mesh. 3(3). 281–285.1 indexed citations
18.
Lim, Si‐Keun, et al.. (1995). An Accurate Worst Case Timing Analysis for RISC Processors.6 indexed citations
Amir, Amihood, Martı́n Farach-Colton, Zvi Galil, Raffaele Giancarlo, & Kunsoo Park. (1994). Dynamic dictionary matching. Journal of Computer and System Sciences. 49(2). 208–222.45 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.