Stefan Weltge gave an online talk at the Virtual Discrete Math Colloquium on a strongly polynomial-time algorithm for the integer linear program with bounded subdeterminants and two nonzeros per row

On July 14, 2021, Stefan Weltge from the Technical University of Munich gave an online talk at the Virtual Discrete Math Colloquium on an efficient algorithm to solve the Integer Linear Program defined by an integer matrix whose subdeterminants are bounded by a constant and that contains at most two nonzero entries in each row. The title of his talk was “Integer programs with bounded subdeterminants and two nonzeros per row“.

Suil O (오수일) gave a talk on the existence of even and odd [a,b]-factors in h-edge-connected r-regular graphs in terms of eigenvalues at the Discrete Math Seminar

On July 6, 2021, Suil O (오수일) from SUNY Korea gave a talk at the Discrete Math Seminar on upper bounds of certain eigenvalues to guarantee the existence of an even or odd [a,b]-factor in h-edge-connected r-regular graphs. The title of his talk was “Eigenvalues and [a, b]-factors in regular graphs“.

Florian Gut and Attila Joó gave an online talk on the existence of a large vertex flame in every rooted directed graph of size ℵ_1 at the Virtual Discrete Math Colloquium

On June 30, 2021, Florian Gut and Attila Joó (University of Hamburg) gave an online talk at the Virtual Discrete Math Colloquium on their new result proving that every rooted directed graph of size 1 has a large vertex flame. The title of their talk was “Large vertex-flames in uncountable digraphs“.

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

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.