News

September 7, 2021July 6, 2024

Dabeen Lee (이다빈) gave a talk characterizing the submodular structure in the mixed-integer program arising from joint linear chance-constrained programs at the Discrete Math Seminar

On September 7, 2021, Dabeen Lee (이다빈) from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar characterizing the submodular structure in the mixed-integer program arising from joint linear chance-constrained programs with random right-hand sides and finite sample space. The title of his talk is “Mixing sets, submodularity, and chance-constrained optimization“.

September 1, 2021July 6, 2024

Cheolwon Heo (허철원) gave a talk on even-cycle matroids at the Discrete Math Seminar

On August 31, 2021, Cheolwon Heo (허철원) gave a talk on representations of even-cycle matroids at the Discrete Math Seminar. He finished his Ph.D. recently from the University of Waterloo and begins his postdoc position at the Applied Algebra and Optimization Research Center (AORC) of Sungkyunkwan University on September 1, 2021. The title of his talk is “Representations of even-cycle matroids”.

August 24, 2021June 26, 2025

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“.

August 18, 2021July 6, 2024

Petr Hliněný gave an online talk on bounding the twin-width of a partially ordered set in terms of the poset width at the Virtual Discrete Math Colloquium

On August 18, 2021, Petr Hliněný from the Masaryk University, Czech gave an online talk at the Virtual Discrete Math Colloquium on a linear upper bound of the twin-width of a partially ordered set in terms of the poset width. The title of his talk is “Twin-width is linear in the poset width“.

August 17, 2021July 6, 2024

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“.

August 12, 2021July 6, 2024

Welcome Linda Cook, a new member of IBS Discrete Mathematics Group

The IBS discrete mathematics group welcomes Dr. Linda Cook, a new research fellow at the IBS discrete mathematics group from August 1, 2021. She received her Ph.D. from the Program in Applied and Computational Mathematics at Princeton University under the supervision of Prof. Paul Seymour. She is interested in structural graph theory and its algorithmic applications.

August 10, 2021July 6, 2024

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“.

August 1, 2021July 6, 2024

Pascal Gollin has been appointed as the Young Scientist Fellow (YSF) of IBS

Pascal Gollin from the IBS Discrete Mathematics Group has been appointed as the IBS Young Scientist Fellow as of August 1, 2021. The title of his research proposal was “Structural questions for infinite graphs, digraphs, and matroids“. Congratulations!

July 30, 2021July 6, 2024

Maria Chudnovsky gave an online talk on structural aspects of tree-width of graphs in terms of induced subgraphs at the Virtual Discrete Math Colloquium

On July 28, 2021, Maria Chudnovsky from Princeton University gave an online talk at the Virtual Discrete Math Colloquium on structural aspects of graphs of large tree-width in terms of induced subgraphs. The title of her talk was “Induced subgraphs and tree decompositions“.

July 28, 2021July 7, 2024

Euiwoong Lee (이의웅) gave a talk on the minimum k-cut problem at the Discrete Math Seminar

On July 27, 2021, Euiwoong Lee (이의웅) from the University of Michigan gave a talk at the Discrete Math Seminar on the proof that the Karger-Stein algorithm finds the minimum k-cuts with the probability $\Omega(n^{-k})$, which is tight and improves previous bounds. The title of his talk was “The Karger-Stein algorithm is optimal for k-cut“.