This page presents my published papers (authors are sorted by alphabet order of their last names)

Single-source shortest path problem in weighted disk graphs.

Shinwoo An, Eunjin Oh, and Jie Xue.

Accepted to the 41st International Symposium on Computational Geometry (SoCG), 2025.

Approximation algorithms for the geometric multimatching problem.

Shinwoo An, Eunjin Oh, and Jie Xue.

Accepted to the 57th ACM Symposium on Theory of Computing (STOC), 2025.

Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs.

Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, and Hyeonjun Shin.

In the 39th AAAI Conference on Artificial Intelligence (AAAI), 2025.

Dynamic parameterized problems on unit disk graphs. 

Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin and Chanho Song.  

In the 35th International Symposium on Algorithms and Computation (ISAAC), 2024.

Sparse outerstring graphs have logarithmic treewidth.

Shinwoo An, Eunjin Oh and Jie Xue.

In the 32th Annual European Symposium on Algorithms (ESA), 2024. 

ETH-tight algorithm for cycle packing on unit disk graphs.

Shinwoo An and Eunjin Oh.

In the 40th International Symposium on Computational Geometry (SoCG), 2024.

Faster algorithms for cycle hitting problems on disk graphs.

Shinwoo An, Kyungjin Cho and Eunjin Oh.

In the 18th Algorithms and Data Structures Symposium (WADS), 2023.

Reachability problems for transmission graphs.

Shinwoo An and Eunjin Oh.

In the 17th Algorithms and Data Structures Symposium (WADS), 2021.

Full version in Algorithmica, 2022.

Feedback vertex set on geometric intersection graphs.

Shinwoo An and Eunjin Oh

In the 32nd International Symposium on Algorithms and Computation (ISAAC), 2021.