Casey Tompkins, Inverse Turán Problems
Room B232 IBS (기초과학연구원)For given graphs
10 events found.
Ilkyoo Choi (최일규), Flexibility of Planar Graphs
Room B232 IBS (기초과학연구원)Oftentimes in chromatic graph theory, precoloring techniques are utilized in order to obtain the desired coloring result. For example, Thomassen's proof for 5-choosability of planar graphs actually shows that two adjacent vertices on the same face can be precolored. In this vein, we investigate a precoloring extension problem formalized by Dvorak, Norin, and Postle named flexibility. Given a …
Paloma T. Lima, Graph Square Roots of Small Distance from Degree One Graphs
Zoom ID: 869 4632 6610 (ibsdimag)Given a graph class
Eun Jung Kim (김은정), Solving hard cut problems via flow-augmentation
Room B232 IBS (기초과학연구원)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)
Akanksha Agrawal, Polynomial Kernel for Interval Vertex Deletion
Zoom ID: 869 4632 6610 (ibsdimag)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 …
June Huh (허준이), Kazhdan-Lusztig polynomials of graphs and matroids
Room B232 IBS (기초과학연구원)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.
Robert Ganian, Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions
Zoom ID: 869 4632 6610 (ibsdimag)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 …
Postponed
Nonlinear Algebra in Daejeon (Postponed)
IBS Science Culture CenterProgram 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)
Yunbum Kook (국윤범), Vertex Sparsification for Edge Connectivity
Room B232 IBS (기초과학연구원)Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether
Tuan Tran, Anti-concentration phenomena
Room B232 IBS (기초과학연구원)Let