Home » News » seminar » Eun Jung Kim gave a talk on her recent work on the parametrized complexity on January 4

January 4, 2019May 16, 2019 by DIMAG

Eun Jung Kim gave a talk on her recent work on the parametrized complexity on January 4

Name: MATRIX-IBS Workshop: Structural Graph Theory Downunder II
Start: 2022-03-20T00:00:00+09:00
End: 2022-03-27T23:59:59+09:00
Location: MATRIX, Australia

Eun Jung Kim (김은정) from LAMSADE, CNRS, Paris gave a talk at Discrete Math Seminar on January 4, 2019. The title of her talk was “New algorithm for multiway cut guided by strong min-max duality”.

Eun Jung Kim gave a talk on her recent work on the parametrized complexity on January 4

Kevin Hendrey, A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups

Debsoumya Chakraborti, Some classical problems in graph saturation

Casey Tompkins, TBA

Yixin Cao (操宜新), Recognizing (unit) interval graphs by zigzag graph searches

Édouard Bonnet, Twin-width and ordered binary structures

Sophie Spirkl, TBA

Seymour is Seventy

MATRIX-IBS Workshop: Structural Graph Theory Downunder II