Loading Events

« All Events

  • This event has passed.

Eunjin Oh (오은진), Parameterized algorithms for the planar disjoint paths problem

Tuesday, March 7, 2023 @ 4:30 PM - 5:30 PM KST

Room B332, IBS (기초과학연구원)


Eunjin Oh (오은진)
Dept. of Computer Science and Engineering, POSTECH

Given an undirected planar graph $G$ with $n$ vertices and a set $T$ of $k$ pairs $(s_i,t_i)_{i=1}^k$ of vertices, the goal of the planar disjoint paths problem is to find a set $\mathcal P$ of $k$ pairwise vertex-disjoint paths connecting $s_i$ and $t_i$ for all indices $i\in\{1,\ldots,k\}$. This problem has been studied extensively due to its numerous applications such as VLSI layout and circuit routing. However, this problem is NP-complete even for grid graphs. This motivates the study of this problem from the viewpoint of parameterized algorithms.

In this talk, I will present a $2^{O(k^2)}n$-time algorithm for the planar disjoint paths problem. This improves the two previously best-known algorithms: $2^{2^{O(k)}}n$-time algorithm [Discrete Applied Mathematics 1995] and $2^{O(k^2)}n^6$-time algorithm [STOC 2020].

This is joint work with Kyungjin Cho and Seunghyeok Oh.


Tuesday, March 7, 2023
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:


Room B332
IBS (기초과학연구원) + Google Map


Sang-il Oum (엄상일)
View Organizer Website
IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.