On January 25, 2022, O-joung Kwon (권오정) from the Incheon National University / IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on upper bounds of the twin-width and reduced-bandwidth of planar graphs and H-minor-free graphs at the Discrete Math Seminar. The title of his talk was “Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)“.

## O-joung Kwon (권오정) gave a talk on classes of intersection digraphs and their bi-min-width at the Discrete Math Seminar as a part of the “Round the World Relay in Combinatorics”

The “Round the World Relay in Combinatorics” was held from 11 am KST of June 8 to 9 am KST of June 9. O-joung Kwon (권오정) from the Incheon National University and the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar organized as a part of the “Round the World Relay in Combinatorics” at 3 pm KST. His talk was about classes of intersection digraphs and their bi-min-width. The title of his talk was “Classes of intersection digraphs with good algorithmic properties“.

## O-joung Kwon (권오정) gave a talk on generalizing tangles and tangle-tree decompositions to directed graphs at the Discrete Math Seminar

On January 5, 2021, O-joung Kwon (권오정) from Incheon National University and IBS Discrete Mathematics Group presented his recent work with Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and Qiqin Xie on generalizing tangles and tangle-tree decompositions to directed graphs at the Discrete Math Seminar. The title of his talk was “Directed tangles and applications“.

## O-joung Kwon (권오정) gave a survey talk on the MIM-width of graphs at the Discrete Math Seminar

On May 19, 2020, O-joung Kwon (권오정) from Incheon National University and IBS Discrete Mathematics Group presented a survey talk on the MIM-width of graphs. The title of his talk was “Mim-width: a width parameter beyond rank-width“.

Note added on June 2020After I presented the talk, Benjamin Bergougnoux commented me that the claim of (Boyaci, Ekim, Shalom 17) at 1:02:40 was recently disproved by Kratochvíl, Masařík, and Novotná (https://arxiv.org/abs/2002.08311). I would like to thank Benjamin for the comment. Whether or not there is a polynomial-time algorithm for Max Cut on proper interval graphs is still open.