seminar Archives - Page 25 of 31 - Discrete Mathematics Group

September 1, 2020July 6, 2024

Junguk Lee (이정욱) from KAIST gave an intensive lecture on the stability and NIP in the model theory at the Discrete Math Seminar for two days

On August 31 and September 1, 2020, Junguk Lee (이정욱) from KAIST gave a 6-hour-long talk on the model theory with the focus on the stability, NIP, and the VC dimension at the Discrete Math Seminar. The title of his talk was “a quick introduction to stability and NIP”. The part 1 “basics” and the part 2 “stability” were coved on August 31, for 1.5 hours each, and the part 3 “NIP” was covered on September 1 for 3 hours (10:30-11:30, 3:00-4:00, 4:10-5:10).

August 25, 2020July 6, 2024

Ben Lund gave a talk on the generalization of Beck’s theorem on the number of incidences between points and lines at the Discrete Math Seminar

On August 25, 2020, Ben Lund from IBS Discrete Mathematics Group presented a talk on his generalization of Beck’s theorem resulting lower bounds on the number of planes spanned by a set of points and its various applications. The title of his talk was “Point-plane incidence bounds“.

August 18, 2020July 6, 2024

Tuan Tran gave a talk on the anti-concentration phenomena at the Discrete Math Seminar

On August 18, 2020, Tuan Tran from IBS Discrete Mathematics Group gave a talk on the anti-concentration phenomena and its consequences to the random matrix theory. The title of his talk is “Anti-concentration phenomena”.

August 12, 2020July 6, 2024

Yunbum Kook (국윤범) gave a talk on finding a small equivalence instance for the minimum edge-cut problem at the Discrete Math Seminar

On August 11, 2020, Yunbum Kook (국윤범) from KAIST presented his work on the existence of a connectivity-c mimicking network, which is a graph preserving the size of all minimum edge-cuts between any partition of a given set of terminals up to a constant c and an efficient algorithm to find one. The title of his talk was “Vertex Sparsification for Edge Connectivity“.

August 5, 2020July 6, 2024

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

August 4, 2020July 6, 2024

June Huh (허준이) gave a talk on Kazhdan-Lusztig polynomials of graphs and matroids at the Discrete Math Seminar

On August 4, 2020, June Huh (허준이) from Institute of Advanced Study presented several conjectures on Kazhdan-Lusztig polynomials of graphs and matroids and recent progress towards them at the Discrete Math Seminar. The title of his talk was “Kazhdan-Lusztig polynomials of graphs and matroids“.

July 29, 2020July 6, 2024

Akanksha Agrawal gave a talk on the polynomial kernel for interval vertex deletion at the Virtual Discrete Math Colloquium

On July 29, 2020, Akanksha Agrawal from Ben-Gurion University of the Negev gave the second talk of the online seminar series called the Virtual Discrete Math Colloquium. The title of her talk was “Polynomial Kernel for Interval Vertex Deletion“.

July 29, 2020July 6, 2024

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

July 22, 2020July 6, 2024

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

July 21, 2020July 6, 2024

Ilkyoo Choi (최일규) gave a talk on the flexibility of planar graphs related to a problem of extending a precoloring at the Discrete Math Seminar

On July 21, 2020, Ilkyoo Choi (최일규) from Hankuk University of Foreign Studies gave a talk on the flexibility of planar graphs, a concept related to extending a a precoloring at the Discrete Math Seminar. The title of his talk was “Flexibility of Planar Graphs“.

Category: seminar