Posted on

Robert Ganian gave a talk on structural approaches to the integer linear programming at the Virtual Discrete Math Colloquium

On August 5, 2020, Robert Ganian from Technische Universität Wien gave an online talk giving an overview of recent approaches to the integer linear programming based on the structural analysis of graphs associated with the instances at the Virtual Discrete Math Colloquium. The title of his talk was “Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions“.

Posted on

Eun Jung Kim (김은정) gave a talk on a new technique called the flow augmentation to design fixed-parameter algorithms for graph cut problems at the Discrete Math Seminar

On July 28, 2020, Eun Jung Kim (김은정) from CNRS, LAMSADE gave a talk on a new tool called the flow augmentation, that is useful to design fixed-parameter algorithms for various graph cut problems on undirected graphs. The title of her talk was “Solving hard cut problems via flow-augmentation“.

Posted on

We started the Virtual Discrete Math Colloquium from July 22; the first speaker was Paloma T. Lima.

Due to the COVID-19 pandemic, we decided to start a new series of talks given online under the name “Virtual Discrete Math Colloquium” so that we can invite speakers abroad online. On July 22, 2020, its first talk was given by Paloma T. Lima from University of Bergen, Norway. She talked about the problem of deciding whether a given input graph G is a square of some graph H with some restrictions on H. The title of her talk was “Graph Square Roots of Small Distance from Degree One Graphs“.

Posted on

Casey Tompkins gave a talk on inverse Turán problems at the Discrete Math Seminar

On July 14, 2020, Casey Tompkins from IBS Discrete Mathematics Group gave a talk on inverse Turán problems at the Discrete Math Seminar. The goal is for a fixed graph H and an integer k to find the minimum number of edges of a graph G such that that every subgraph of G with at least k edges has a subgraph isomorphic to H. The title of his talk is “Inverse Turán Problems“.

Posted on

Seog-jin Kim (김석진) gave a talk on the Online DP-coloring of graphs at the Discrete Math Seminar

On July 7, 2020, Seog-jin Kim (김석진) from Konkuk University presented his work on the online DP-coloring of graphs, a common generalization of the online coloring and the DP coloring, both generalizing the list coloring of graphs. The title of his talk was “Online DP-coloring of graphs“. He will stay at the IBS discrete mathematics group until the end of this week.