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

Room B332 IBS (기초과학연구원)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 …