O-joung Kwon (권오정), Graph minor theory and beyond
One of the important work in graph theory is the graph minor theory developed by Robertson and Seymour in 1980-2010. This provides a complete description of the class of graphs …
6 events found.
Colloquium
Events
-
-
Room 1501, Bldg. E6-1, KAIST
-
-
Xavier Goaoc, Order types and their symmetries
Room 1501, Bldg. E6-1, KAISTOrder types are a combinatorial classification of finite point sets used in discrete and computational geometry. This talk will give an introduction to these objects and their analogue for the …
-
Dabeen Lee (이다빈), Non-smooth and Hölder-smooth submodular optimization
Room 1501, Bldg. E6-1, KAISTWe study the problem of maximizing a continuous DR-submodular function that is not necessarily smooth. We prove that the continuous greedy algorithm achieves an guarantee when the function is monotone …
-
-
Rob Morris, Ramsey theory: searching for order in chaos
Room 1501, Bldg. E6-1, KAISTIn many different areas of mathematics (such as number theory, discrete geometry, and combinatorics), one is often presented with a large "unstructured" object, and asked to find a smaller "structured" …
-
-
Maria Chudnovsky, Induced subgraphs and tree decompositions
Room 1501, Bldg. E6-1, KAISTTree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the input graph is known to have a tree decomposition …
-
-
William Cook, The Traveling Salesman Problem: Amazon Deliveries, Pub Walks, and Astro Tours
Room 1501, Bldg. E2-2, KAISTAmazon drivers hit the road every day, each taking a Prime van in a traveling salesman problem tour through 150 or more customer stops. But even a whisper of the …