Sanjeeb Dash gave a talk on the integer programming approach to the interpretable machine learning at the discrete math seminar

On January 14, 2020, Sanjeeb Dash from IBM T. J. Watson Research presented a talk on the integer programming formulation for the problem arising from the interpretable machine learning. The title of his talk was “Boolean decision rules via column generation“. He is visiting IBS Discrete Mathematics Group until the end of this week.

Hong Liu gave a talk on the conjecture of Mader about the topological minors in C4-free graphs at the discrete math seminar

On December 12, 2019, Hong Liu from University of Warwick gave a talk on the resolution of the conjecture of Mader on the existence of a complete topological minor under the condition of average degree for C4-free graphs at the discrete math seminar held at KAIST. The title of his talk was “A proof of Mader’s conjecture on large clique subdivisions in $C_4$-free graphs“.

Pascal Gollin gave a talk on the existence of a decomposition of an infinite graph into spanning trees at the discrete math seminar

On October 29, 2019, Pascal Gollin from IBS discrete mathematics group gave a talk on the existence of a decomposition of an infinite graph into spanning trees in terms of the existence of packing and covering of spanning trees at the discrete math seminar. The title of his talk was “A Cantor-Bernstein-type theorem for spanning trees in infinite graphs“.