2019 IBS Summer Research Program on Algorithms and Complexity in Discrete Structures

Website: https://dimag.ibs.re.kr/event/2019-ibs-summer-research-program/

## July 21 Sunday – August 10 Saturday

## Schedule

### July 22 Monday

10:00-11:00 Introduction

11:00-12:00 Open Problems

### July 23 Tuesday

11:00-10:30 **Stefan Kratsch**, Humboldt-Universität zu Berlin, Germany

*Elimination Distances, Blocking Sets, and Kernels for Vertex Cover*

10:45-11:15 **Benjamin Bergougnoux**, University Clermont Auvergne, France

*More applications of the d-neighbor equivalence*

11:30-12:00 **Yixin Cao**, Hong Kong Polytechnic University, China

*Enumerating Maximal Induced Subgraphs*

### July 24 Wednesday

(We will go to KAIST for June Huh‘s two talks 15:00-16:00, 16:30-17:30.)

### July 25 Thursday

10:00-11:00 **Nick Brettell**, Eindhoven University of Technology, Netherlands

*Recent work on characterising matroids representable over finite fields*

11:30-12:00 **Mamadou M. Kanté**, University Clermont Auvergne, France

*On recognising k-letter graphs*

### July 26 Friday

10:00-11:00 **O-joung Kwon (권오정)**, Incheon National University, Korea

*The grid theorem for vertex-minors*

11:00-12:00 **Progress Report**

### July 27 Saturday

8:30 Excursion to Damyang (departure from the accommodation)

### July 29 Monday

10:00-11:00 **Archontia Giannopoulou**, National and Kapodistrian University of Athens, Greece

*The directed flat wall theorem*

11:30-12:00 **Eunjung Kim (김은정)**, LAMSADE-CNRS, France

*Subcubic even-hole-free graphs have a constant treewidth*

### July 30 Tuesday

10:00-11:00 **Pierre Aboulker**, ENS Ulm, France

*Generalizations of the geometric de Bruijn Erdős Theorem*

11:30-12:00 **Michael Dobbins**, Binghamton University, USA

*Barycenters of points in polytope skeleta*

### July 31 Wednesday

10:00-11:00 **Magnus Wahlström**, Royal Holloway, University of London, UK

*T.B.A.*

11:30-12:00 **Édouard Bonnet**, ENS Lyon, France

*The FPT/W[1]-hard dichotomy of Max Independent Set in H-free graphs*

### August 1 Thursday

10:00-11:00 **Euiwoong Lee (이의웅)**, NYU, USA

* Losing treewidth by separating subsets*

11:30-12:00 **Sang-il Oum (엄상일)**, IBS Discrete Mathematics Group and KAIST, Korea

*Branch-depth: Generalizing tree-depth of graphs*

### August 2 Friday

10:00-11:00 **Dabeen Lee (이다빈)**, IBS Discrete Mathematics Group, Korea

*t-perfect graphs and the stable set problem*

11:00-12:00 **Progress Report**

*August 5-9: Free Discussions / Research Collaborations / Progress Report*

*Tea time: Every weekday 3:30pm*