Junghoon Kim

Orcid: 0000-0002-4905-2704

Affiliations:
  • Ulsan National Institute of Science and Technology, Department of Computer Science and Engineering, Ulsan, South Korea
  • Nanyang Technological University, Singapore (PhD)


According to our database1, Junghoon Kim authored at least 21 papers between 2016 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Uncovering high-order cohesive structures: Efficient (k, g)-core computation and decomposition for large hypergraphs.
Knowl. Based Syst., 2026

Label-based graph augmentation with metapath for graph anomaly detection.
Expert Syst. Appl., 2026

Efficient Locality-based Indexing for Cohesive Subgraphs Discovery in Hypergraphs.
Proceedings of the Proceedings 29th International Conference on Extending Database Technology, 2026

2025
Cohesive Subgraph Discovery in Hypergraphs: A Locality-Driven Indexing Framework.
CoRR, February, 2025

Budgeted Strong Community Search in Heterogeneous Graphs.
Proc. ACM Manag. Data, 2025

Beyond trivial edges: A fractional approach to cohesive subgraph detection in hypergraphs.
Knowl. Based Syst., 2025

When User Engagement Meets Structural Cohesiveness: A Decay-Driven Approach to Hypergraph Cores.
Proceedings of the 34th ACM International Conference on Information and Knowledge Management, 2025

From Bicliques to BiFlexi Cliques: A New Era of Bipartite Subgraph Discovery.
Proceedings of the 34th ACM International Conference on Information and Knowledge Management, 2025

2024
Experimental analysis and evaluation of cohesive subgraph discovery.
Inf. Sci., 2024

Flexi-clique: Exploring Flexible and Sub-linear Clique Structures.
Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

2023
Effective and efficient core computation in signed networks.
Inf. Sci., July, 2023

Deep Semi-supervised Anomaly Detection with Metapath-based Context Knowledge.
CoRR, 2023

Exploring Cohesive Subgraphs in Hypergraphs: The (k, g)-core Approach.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

2022
ABC: Attributed Bipartite Co-clustering.
Proc. VLDB Endow., 2022

LUEM : Local User Engagement Maximization in Networks.
Knowl. Based Syst., 2022

OCSM : Finding overlapping cohesive subgraphs with minimum degree.
Inf. Sci., 2022

Effective and Efficient Core Decomposition in Signed Networks.
CoRR, 2022

DMCS : Density Modularity based Community Search.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

(p, n)-core: Core Decomposition in Signed Networks.
Proceedings of the Database Systems for Advanced Applications, 2022

2020
Densely Connected User Community and Location Cluster Search in Location-Based Social Networks.
Proceedings of the 2020 International Conference on Management of Data, 2020

2016
BlackHole: Robust community detection inspired by graph drawing.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016


  Loading...