Skip to content
View unsik6's full-sized avatar
  • POSTECH

Block or report unsik6

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
unsik6/README.md

unsik6

  Hello, I'm unsik6 (Hyeonjun Shin). I am a graduate student in the Department of Computer Science and Engineering at POSTECH. I am interested in the connection between massively parallel algorithms and computational geometry. Recently, I've been studying probabilistic partitions/covers/decompositions of geometric and metric spaces and their applications to problems such as clustering in the Massively Parallel Computation model with sublinear local memory.

Here is my website.

📂 Main personal study and work

  • Study graph algorithms, computational geometric algorithms, and approximation algorithms in the Massively Parallel Computation model (MPC model).



📑 Publications and Conferences

< International >

  1. Eunjin Oh, and Hyeonjun Shin, "Fully Scalable MPC Algorithms for WSPD in Doubling and Euclidean Spaces", European Symposium on Algorithms 2026 (ESA 2026), 2026
  2. Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, Hyeonjun Shin, "Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs", the AAAI Conference on Artificial Intelligence (AAAI'25), 2025
  3. Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, and Chanho Song, "Dynamic Parameterized Problems on Unit Disk Graphs", 35th International Symposium on Algorithms and Computation (ISAAC'24), 2024

< Domestic >

  1. Hyeonjun Shin, Jeong Seop Sim, "A New Algorithm of Finding a Maximal Common Subsequence of Two Strings", Korea Software Congress 2022, Jeju, Korea (Dec. 2022) – Oral [In Korean]

  2. Hyeonjun Shin, Joong Chae Na, Jeong Seop Sim, "An Improved Algorithm of Finding a Maximal Common Subsequence", Journal of KIISE 50.9 (2023): 737 - 745 [In Korean]



🏃 Research Experience & Others

  1. Embedded CV application developer of Seeds, the developer club (2023.03. ~ 2023.10.)

  2. Summer research internship program of POSTECH. (2023.07.~2023.07.)

    • Study the algorithm solving problems of graph theory in hyperbolic random graphs.
  3. Undergraduate Researcher of Algorithm & Application Lab in INHA Univ. (2022.02.~2023.02.)

    • Performed research on maximal common subsequence algorithms.
    • Presented a paper on MCS at the KSC 2022 conference and submitted it to the Journal of KIISE.
    • Wrote the guidelines for Git Server practice.
    • Contributed to NLP project: managing the project, and researching on KoBART model and NLP metrics.
    • Provided tutoring for two lectures on problem-solving and data structures.
    • Presented data structures and algorithms at weekly lab seminars.



hyp3rflow's solved.ac stats

Pinned Loading

  1. BOJ_by_Cpp BOJ_by_Cpp Public

    Practice algorithm by BaekJoon Online Judge

    C++ 13

  2. Inha_Tutoring_DataStructure Inha_Tutoring_DataStructure Public

    인하대학교 22-1학기 자료구조 수업 인하 튜터링 실습 자료

    C++ 28 3

  3. Algorithms_Codes Algorithms_Codes Public

    Implementation of data structures and algorithms using C++

    C++ 13 4

  4. DSALGO_PYTHON DSALGO_PYTHON Public

    Practice implementing data structures and algorithms with BOJ, using Python

    Jupyter Notebook 17