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)
Calendar of Events
S
Sun
|
M
Mon
|
T
Tue
|
W
Wed
|
T
Thu
|
F
Fri
|
S
Sat
|
---|---|---|---|---|---|---|
0 events,
|
0 events,
|
1 event,
-
|
1 event,
-
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 … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
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. |
1 event,
-
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 … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event,
Postponed
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) |
2 events,
-
Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether |
0 events,
|
0 events,
|
||
0 events,
|
0 events,
|
1 event,
-
Let |
1 event,
-
In 2007, Chepoi, Estellon, and Vaxès conjectured that there exists a universal constant |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
2 events,
Postponed
Date August 24, 2020 - August 28, 2020 Arrival: August 23 Sunday. Departure: August 29, Saturday Venue Institute for Basic Science, 55 Expo-ro, Yuseong-gu, Daejeon, South Korea Invited Speakers Julia Böttcher, London School of Economics Boris Bukh, Carnegie Mellon University Amin Coja-Oghlan, Goethe University David Conlon, Caltech Penny Haxell, University of Waterloo Hao Huang, Emory University Jeff Kahn, Rutgers University … 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 … |
2 events,
-
In the early 1980s, Beck proved that, if P is a set of n points in the real plane, and no more than g points of P lie on any single line, then there are |
2 events,
-
Maximum induced matching width, also known as mim-width, is a width parameter for graphs introduced by Vatshelle in 2012. This parameter can be defined over branch decompositions of a graph G, where the width of a vertex partition (X,Y) in G is the size of a maximum induced matching in the bipartite graph induced by … |
0 events,
|
||
0 events,
|
2 events,
-
I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. We review basic properties of stability and NIP. Finally, we aim to give several characterizations of stability and NIP of a given formula in terms of …
-
I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. We review basic properties of stability and NIP. Finally, we aim to give several characterizations of stability and NIP of a given formula in terms of … |
1 event,
-
I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. We review basic properties of stability and NIP. Finally, we aim to give several characterizations of stability and NIP of a given formula in terms of … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|