BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240722
DTEND;VALUE=DATE:20240727
DTSTAMP:20260417T234123
CREATED:20240410T044447Z
LAST-MODIFIED:20240705T153024Z
UID:8506-1721606400-1722038399@dimag.ibs.re.kr
SUMMARY:2024 Summer School on Combinatorics and Algorithms (2024 조합론 및 알고리즘 여름학교)
DESCRIPTION:The 2024 Summer School on Combinatorics and Algorithms is a venue for students and early-career researchers to learn selected topics in theoretical computer science and discrete mathematics. It will be a great opportunity for young and aspiring researchers to study topics which are important but not covered during the lectures in the university classes. This summer\, two lecture series\, combinatorial optimization and grid minor theorem\, will be given by two leading experts on the subjects. There will be exercise sessions where you form a team and solve challenging questions related to the lecture subjects. \nWebsite: https://combialgo.dimag.kr/ \nLecturers and Topics\n\nChien-Chung Huang (ENS Paris\, France): Combinatorial Optimization\n\nThis lecture (12.5h) will cover essential topics in combinatorial optimization including: Berge’s theorem\, Konig’s theorem\, Egervary’s theorem\, Karger’s min-cut algorithm and Gomory-Hu trees\, Edmonds’ blossom algorithm for maximum matching\, matroid 101\, multi-commodity flow and k-coverage problems. \n\nSebastian Wiederrecht (DIMAG-IBS\, Korea): From treewidth to grid minor theorem\n\nThis lecture (6h) will present the notion of tree decomposition\, treewidth and graph minor\, and introduce the grid minor theorem by Robertson and Seymour. Grid minor theory is deemed as one of the most important theory in modern graph theory and has many applications in algorithms design\, data structure\, logic\, etc.
URL:https://dimag.ibs.re.kr/event/2024-07-22/
LOCATION:Bldg. N1\, KAIST
CATEGORIES:Workshops and Conferences
ORGANIZER;CN="Eunjung Kim (%EA%B9%80%EC%9D%80%EC%A0%95)":MAILTO:eunjungkim78@gmail.com
END:VEVENT
END:VCALENDAR