default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHa-Myung Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Hyun Seok Park, Ha-Myung Park:
Enhancing Heterophilic Graph Neural Network Performance Through Label Propagation in K-Nearest Neighbor Graphs. BigComp 2024: 337-344- [c11]Abdulhakin Mohamud Ismail, Ha-Myung Park:
Latent Representation Generation for Efficient Content-Based Image Retrieval in Weather Satellite Images Using Self-Supervised Segmentation. BigComp 2024: 379-380 - [c10]Changhun Han, Suji Kim, Ha-Myung Park:
Efficient Proximity Search in Time-accumulating High-dimensional Data using Multi-level Block Indexing. EDBT 2024: 547-558 - [c9]Chaeeun Kim, Changhun Han, Ha-Myung Park:
BTS: Load-Balanced Distributed Union-Find for Finding Connected Components with Balanced Tree Structures. ICDE 2024: 1090-1102 - 2023
- [c8]Sang-Hong Kim
, Ha-Myung Park:
Efficient Distributed Approximate k-Nearest Neighbor Graph Construction by Multiway Random Division Forest. KDD 2023: 1097-1106 - 2021
- [j3]Jinhong Jung, Woojeong Jin, Ha-Myung Park, U Kang:
Accurate relational reasoning in edge-labeled graphs by multi-labeled random walk with restart. World Wide Web 24(4): 1369-1393 (2021) - 2020
- [c7]Jinhong Jung, Ha-Myung Park, U Kang:
BalanSiNG: Fast and Scalable Generation of Realistic Signed Networks. EDBT 2020: 193-204
2010 – 2019
- 2018
- [j2]Ha-Myung Park, Francesco Silvestri, Rasmus Pagh, Chin-Wan Chung, Sung-Hyon Myaeng, U Kang:
Enumerating Trillion Subgraphs On Distributed Systems. ACM Trans. Knowl. Discov. Data 12(6): 71:1-71:30 (2018) - [c6]Ha-Myung Park, Chiwan Park, U Kang:
PegasusN: A Scalable and Versatile Graph Mining System. AAAI 2018: 8214-8215 - 2017
- [c5]Kyung-Min Kim, Jinhong Jung, Jihee Ryu, Ha-Myung Park, Joseph P. Joohee, Seokwoo Jeong, U Kang, Sung-Hyon Myaeng:
A New Question Answering Approach with Conceptual Graphs. CORIA 2017: 218-234 - [i1]Chiwan Park, Ha-Myung Park, Minji Yoon, U Kang:
PMV: Pre-partitioned Generalized Matrix-Vector Multiplication for Scalable Graph Mining. CoRR abs/1709.09099 (2017) - 2016
- [j1]Min-Joong Lee, Dong-Wan Choi, Sangyeon Kim, Ha-Myung Park, Sunghee Choi, Chin-Wan Chung:
The direction-constrained k nearest neighbor query - Dealing with spatio-directional objects. GeoInformatica 20(3): 471-502 (2016) - [c4]Ha-Myung Park, Namyong Park, Sung-Hyon Myaeng, U Kang:
Partition Aware Connected Component Computation in Distributed Systems. ICDM 2016: 420-429 - [c3]Ha-Myung Park, Sung-Hyon Myaeng, U Kang:
PTE: Enumerating Trillion Triangles On Distributed Systems. KDD 2016: 1115-1124 - 2014
- [c2]Ha-Myung Park, Francesco Silvestri, U Kang, Rasmus Pagh:
MapReduce Triangle Enumeration With Guarantees. CIKM 2014: 1739-1748 - 2013
- [c1]Ha-Myung Park, Chin-Wan Chung:
An efficient MapReduce algorithm for counting triangles in a very large graph. CIKM 2013: 539-548
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-11-07 21:33 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:
