BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.17.1//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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20260727
DTEND;VALUE=DATE:20260801
DTSTAMP:20260415T104353Z
CREATED:20260415T104353Z
LAST-MODIFIED:20260415T104353Z
UID:12545-1785110400-1785542399@dimag.ibs.re.kr
SUMMARY:2026 Korean Student Combinatorics Workshop
DESCRIPTION:Website: https://kscw.combinatorics.kr/
URL:https://dimag.ibs.re.kr/event/2026-07-27/
LOCATION:Gongju Hanok Village\, Gongju
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260728T163000
DTEND;TZID=Asia/Seoul:20260728T173000
DTSTAMP:20260717T125139Z
CREATED:20260616T000638Z
LAST-MODIFIED:20260717T125139Z
UID:12768-1785256200-1785259800@dimag.ibs.re.kr
SUMMARY:Stephan Kreutzer\, Disjoint Paths in Graphs and Digraphs
DESCRIPTION:One of the important algorithmic consequences of Robertson and Seymour’s Graph Minor Project is their proof that the k-Vertex-Disjoint Paths problem is fixed-parameter tractable on the class of all undirected graphs\, that is\, solvable in time $f(k) \cdot n^c$\, for some function $f$ and constant $c$. \nFor directed graphs the problem is significantly harder: the k-Disjoint-Paths problem it is NP-complete already for $k=2$. While this indicates that the Directed-k-Disjoint Paths problem is unlikely to be fixed-parameter tractable in general\, it is nevertheless interesting to investigate which of the techniques used to solve the problem on undirected graphs fail for digraphs and why and whether some of them can be made to work in a more restricted setting. \nIn this talk I will speak about recent results on disjoint directed paths including positive solutions for special graph classes such as Eulerian digraphs but also recently obtained further hardness results.
URL:https://dimag.ibs.re.kr/event/2026-07-28/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR