Get started
Author

Ha-Myung Park

Observed names: Hamyung Park, Park, Ha-Myung
Institution: Kookmin University
ORCID: 0000-0002-6421-8880
Observed ORCID: 0000-0002-6421-8880
OpenAlex ID: A5075939069
An efficient MapReduce algorithm for counting triangles in a very large graph
2013 · Ha-Myung Park, Chin-Wan Chung · ACM International Conference on Information and Knowledge Management (CIKM) · 96
MapReduce Triangle Enumeration With Guarantees
2014 · Ha-Myung Park, Francesco Silvestri, et al. · ACM International Conference on Information and Knowledge Management (CIKM) · 89
PTE: Enumerating Trillion Triangles On Distributed Systems
2016 · Ha-Myung Park, Sung-Hyon Myaeng, et al. · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · 59
Enumerating Trillion Subgraphs On Distributed Systems
2018 · Ha-Myung Park, Francesco Silvestri, et al. · ACM Transactions on Knowledge Discovery from Data · 17
The direction-constrained k nearest neighbor query: Dealing with spatio-directional objects
2016 · Min-Joong Lee, Dong-Wan Choi, et al. · GeoInformatica · 13
Partition Aware Connected Component Computation in Distributed Systems
2016 · Ha-Myung Park, Namyong Park, et al. · Proceedings · 11
PACC: Large scale connected component computation on Hadoop and Spark
2020 · Ha-Myung Park, Namyong Park, et al. · PLoS ONE · 8
PDF
SkySearch: Satellite Video Search at Scale
2025 · Minyoung Choe, Geon Lee, et al. · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · 6
Efficient Distributed Approximate k-Nearest Neighbor Graph Construction by Multiway Random Division Forest
2023 · Sang-Hong Kim, Ha-Myung Park · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · 6
PDF
Enhancing Heterophilic Graph Neural Network Performance Through Label Propagation in K-Nearest Neighbor Graphs
2024 · Hyun Seok Park, Ha-Myung Park · IEEE International Conference on Big Data and Smart Computing (BigComp) · 5
Latent Representation Generation for Efficient Content-Based Image Retrieval in Weather Satellite Images Using Self-Supervised Segmentation
2024 · Abdulhakin Mohamud Ismail, Ha-Myung Park · IEEE International Conference on Big Data and Smart Computing (BigComp) · 4
PMV: Pre-partitioned Generalized Matrix-Vector Multiplication for Scalable Graph Mining
2017 · Park, Chiwan, Park, Ha-Myung, et al. · arXiv (Cornell University) · 3
PDF
BTS: Load-Balanced Distributed Union-Find for Finding Connected Components with Balanced Tree Structures
2024 · Chaeeun Kim, Changhun Han, et al. · IEEE International Conference on Data Engineering (ICDE) · 2
Efficient Subgraph Matching on Large Networks
2016 · Dongmin Seo, Ha-Myung Park, et al. · 한국콘텐츠학회 ICCC 논문집 · 2
Efficient Time-Restricted k NN Search in High-Dimensional Data Using Multi-Level Block Indexing, with Extensions to Multi-Attribute Filtering
2026 · Jisoo Kang, Changhun Han, et al. · ACM Transactions on Knowledge Discovery from Data · 1
S 3 -Prompt: Resolving Activity Cliffs via Structure-Disentangled Molecular Graph-Text Alignment
2026 · Wooseong Syz Cho, Ha-Myung Park · ACM International Conference on Information and Knowledge Management (CIKM)
EPTQ: Fast and Accurate 2-bit Post-Training Quantization via Factored E 8 Lattice
2026 · Ha-Myung Park, Jungeun Park, et al. · ACM International Conference on Information and Knowledge Management (CIKM)
COSMO: Contrastive Satellite Image Embedding Techniques Reflecting Expert Weather Bulletins
2026 · Min-Hyoung Kim, Ha-Myung Park · IEEE Access
Efficient Reconstruction of Masked Image Embeddings for Region-Specific Satellite Image Retrieval
2026 · Youngjun Lee, Hamyung Park · IEEE Access
UniCon: A unified star-operation to efficiently find connected components on a cluster of commodity hardware
2022 · Chaeeun Kim, Changhun Han, et al. · PLoS ONE
PDF
A New Question Answering Approach with Conceptual Graphs.
2017 · Kim, Kyung-Min, Jung, Jinhong, et al. · Association en Recherche d’Information et Applications
Efficient counting of triangles in a very large graph with mapreduce = 대용량 그래프에서 삼각형의 수를 계산하는 맵리듀스 알고리즘
2013 · Ha-Myung Park, 박하명
Works count: 22
Citation count: 322
H-index: 7
I10-index: 6
Year
Topic
Type