Paloma T. Lima, Graph Square Roots of Small Distance from Degree One Graphs
Zoom ID: 869 4632 6610 (ibsdimag)Given a graph class
Given a graph class
We present a new technique for designing fixed-parameter algorithms for graph cut problems in undirected graphs, which we call flow augmentation. Our technique is applicable to problems that can be phrased as a search for an (edge)
Given a graph G and an integer k, the Interval Vertex Deletion (IVD) problem asks whether there exists a vertex subset S of size at most k, such that G-S is an interval graph. A polynomial kernel for a parameterized problem is a polynomial time preprocessing algorithm that outputs an equivalent instance of the problem whose size is bounded by …
I will introduce Kazhdan-Lusztig polynomials of matroids and survey combinatorial and geometric theories built around them. The focus will be on the conjecture of Gedeon, Proudfoot, and Young that all zeros of the Kazhdan-Lusztig polynomial of a matroid lie on the negative real axis.
Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science. ILP is NP-complete, and until recently we have lacked a systematic study of the complexity of ILP through the lens of variable-constraint interactions. This changed drastically in recent years thanks to a series of results that together lay out a …
Program Summer School @ KAIST (August 4-7, 2020) Discussion Weekend (August 8-9, 2020) Workshop @ IBS Science Culture Center (August 10-13, 2020) Website: https://dimag.ibs.re.kr/home/nonlinear/ Organizing Committee Insong Choe (Konkuk U.) Kangjin Han (DGIST) David Hyeon (SNU) Sijong Kwak (KAIST) Yongnam Lee (KAIST) Anton Leykin (Georgia Tech) Sang-il Oum (IBS & KAIST) Frank Sottile (TAMU)
Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether
Let
In 2007, Chepoi, Estellon, and Vaxès conjectured that there exists a universal constant
Combinatorics Workshop (조합론 학술대회) is the biggest annual conference in combinatorics in Korea. It was firstly held in 2004 by the Yonsei University BK21 Research Group. It has been advised by the committee of discrete mathematics of the Korean Mathematical Society since 2013. The aim of this workshop is to bring active researchers with different …