November 2020

Meike Hatzel, Constant congestion bramble

Zoom ID: 869 4632 6610 (ibsdimag)

In this talk I will present a small result we achieved during a workshop in February this year. My coauthors on this are Marcin Pilipczuk, Paweł Komosa and Manuel Sorge. A bramble in an undirected graph $G$ is a family of connected subgraphs of $G$ such that for every two subgraphs $H_1$ and $H_2$ in the bramble either $V(H_1) \cap February 2023 Meike Hatzel, Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parametrised by the Size of the Cutset: Twin-Width Meets Flow-Augmentation Room B332 IBS (기초과학연구원) We show fixed-parameter tractability of the Directed Multicut problem with three terminal pairs (with a randomized algorithm). This problem, given a directed graph$G$, pairs of vertices (called terminals)$(s_1,t_1)$,$(s_2,t_2)$, and$(s_3,t_3)$, and an integer$k$, asks to find a set of at most$k$non-terminal vertices in$G$that intersect all$s_1t_1\$-paths, all

기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 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