News

January 29, 2026January 29, 2026

Daniel Dadush gave a talk on a strongly polynomial-time algorithm to solve linear programming problems with at most two non-zero entries per each row or each column at the Discrete Math Seminar

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

January 20, 2026January 20, 2026

Tomáš Masařík gave a talk at the Discrete Math Seminar on finding a balanced separator in an H-minor-free graph in linear time

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

January 15, 2026January 15, 2026

Ferdinand Ihringer gave a talk at the Discrete Math Seminar on low-degree Boolean functions and applications of vector space Ramsey numbers

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

January 7, 2026January 7, 2026

Daniel Mock gave a talk at the Discrete Math Seminar on an algorithmic framework for showing the fixed-parameter tractability of the dominating set problem and its generalizations

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

January 2, 2026January 2, 2026

Welcome Eero Räty, Xiaofan Yuan, and Xin Wei, new members of IBS ECOPRO

The IBS Discrete Mathematics Group welcomes Dr. Eero Räty, Dr. Xiaofan Yuan, and Dr. Xin Wei, new research fellows at the IBS Extremal Combinatorics and Probability Group, starting January 1, 2026.

Dr. Eero Räty received his Ph.D. from the University of Cambridge under the supervision of Prof. Imre Leader. Until recently, he was a postdoctoral researcher at Umeå University, Sweden. He is interested in extremal and probabilistic combinatorics.

Dr. Xiaofan Yuan received her Ph.D. from the Georgia Institute of Technology under the supervision of Prof. Xingxing Yu. She is interested in graph theory and extremal combinatorics. Until recently, she was a postdoctoral researcher at Arizona State University.

Dr. Xin Wei received his Ph.D. from the University of Science and Technology of China under the supervision of Prof. Xiande Zhang. His research interests include combinatorics, coding theory, and graph theory and their interactions.

December 31, 2025December 31, 2025

Yunbum Kook (국윤범) gave a talk on a faster randomized algorithm for sampling points in a convex body at the Discrete Math Seminar

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

December 28, 2025December 28, 2025

Donggyu Kim (김동규) gave a talk on defining orthogonal matroids (even delta-matroids) with coefficients in terms of Grassmann-Plücker functions at the Discrete Math Seminar

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

December 17, 2025

Chi Hoi Yip gave a talk on the maximum size of a clique in Paley graphs and cyclotomic graphs

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

December 9, 2025

Tuukka Korhonen gave a talk on a dynamic algorithm for maintaining a tree decomposition of a graph at the Discrete Math Seminar

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

December 8, 2025December 8, 2025

Matthew Kwan gave a talk on the permanent of a random ±1-matrix at the Discrete Math Seminar

On December 8, 2025, Matthew Kwan from ISTA, Austria, gave a talk at the Discrete Math Seminar on the permanent of a random ±1-matrix. The title of his talk was “Exponential anticoncentration of the permanent“.