기초과학연구원 이산수학그룹
On February 10, 2026, Seonghun Park (박성훈) from KAIST gave a talk on formalizing the flag algebra introduced by Alexander Razborov in the lean theorem prover. The title of his talk was “Formalizing Flag Algebras in the Lean Theorem Prover“.
On February 3, 2026, Xiaofan Yuan from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the minimum color-degree condition for the existence of a rainbow path between any pair of vertices and its applications. The title of her talk was “Rainbow structures in edge colored graphs“.
On January 27, 2025, Daniel Dadush from CWI gave a talk at the Discrete Math Seminar on a strongly polynomial-time algorithm solve linear programming problems with at most two non-zero entries per each row or each column. The title of his talk was “A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column“.
On January 20, 2026, Tomáš Masařík from the University of Warsaw, Poland, gave a talk on a linear-time algorithm to find a balanced separator in an H-minor-free graph at the Discrete Math Seminar. The title of his talk was “Separator Theorem for Minor-free Graphs in Linear Time“.
On January 13, 2026, Ferdinand Ihringer from the Southern University of Science and Technology, China gave a talk on low-degree Boolean functions and appications of vector space Ramsey numbers at the Discrete Math Seminar. The title of his talk was “Boolean Functions Analysis in the Grassmann Graph“.
On January 6, 2026, Daniel Mock from RWTH Aachen gave a talk on an algorithmic framework for showing the fixed-parameter tractability of the dominating set problem and its generalizations at the Discrete Math Seminar. The title of his talk was “A Simple Algorithm for the Dominating Set Problem and More“.
On December 30, 2025, Yunbum Kook (국윤범) from the Georgia Institute of Technology gave a talk at the Discrete Math Seminar on a faster randomized algorithm for sampling points in a convex body. The title of his talk was “Sampling and volume computation“.
On December 26, 2025, Donggyu Kim (김동규) from the Georgia Institute of Technology gave a talk at the Discrete Math Seminar on defining orthogonal matroids (even delta-matroids) with coefficients in terms of Grassmann-Plücker functions. The title of his talk was “Grassmann-Plücker functions for orthogonal matroids“.
On December 16, 2025, Chi Hoi Yip from Georgia Institute of Technology gave a talk at the Discrete Math Seminar on the maximum size of a clique in Paley graphs and cyclotomic graphs. The title of his talk was “Cliques in Paley graphs and cyclotomic graphs“.
On December 9, 2025, Tuukka Korhonen from the University of Copenhagen gave a talk at the Discrete Math Seminar on a dynamic algorithm for maintaining a tree decomposition of a graph. The title of his talk was “Dynamic Treewidth in Logarithmic Time“.