Eun Jung Kim gave a talk on an approximation algorithm for the minimum weight vertex set to hit all bonds of size at least k at the Discrete Math Seminar

On August 24, 2021, Eun Jung Kim (김은정) from LAMSADE, CNRS gave a talk at the Discrete Math Seminar on an approximation algorithm for finding the minimum weight vertex set hitting all bonds of size at least k in a graph. The title of her talk was “A Constant-factor Approximation for Weighted Bond Cover“.

Linda Cook gave a talk on (1) the recognition algorithm for graphs with no long even holes and (2) the structure of graphs with no holes of length≠𝓁 at the Discrete Math Seminar

On August 17, 2021, Linda Cook from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on (1) a polynomial-time algorithm to detect long even holes and (2) a structure of graphs with no holes of length≠𝓁 for a fixed 𝓁≥7. The title of her talk was “Two results on graphs with holes of restricted lengths“.

Duksang Lee (이덕상) gave a talk on intertwining connectivities for vertex-minors and pivot-minors of graphs at the Discrete Math Seminar

On August 10, 2021, Duksang Lee (이덕상) from KAIST and IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar, showing that there are finitely many pivot-minor-minimal graphs preserving the rank connectivity between two fixed pairs of vertex sets. The title of his talk was “Intertwining connectivities for vertex-minors and pivot-minors“.