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:20260804T163000
DTEND;TZID=Asia/Seoul:20260804T173000
DTSTAMP:20260725T124528Z
CREATED:20260617T111737Z
LAST-MODIFIED:20260725T124528Z
UID:12779-1785861000-1785864600@dimag.ibs.re.kr
SUMMARY:Tomohiro Koana\, A Single-Exponential FPT Algorithm for 2-Vertex-Connectivity Augmentation
DESCRIPTION:We study restricted-link augmentation to 2-vertex-connectivity. An instance consists of a graph $G$\, possibly disconnected\, a set $L$ of admissible links on its vertices\, integer link costs in $\{1\, \ldots\, W\}$\, and an integer $k$; the task is to add at most $k$ links of minimum total cost so that the resulting multigraph is 2-vertex-connected. Recent work gives $O^*(k^{O(k)})$-time algorithms for unweighted λ-vertex-connectivity augmentation for every λ ≤ 4 [Carmesin and Ramanujan\, SODA 2026]\, and an $O^*((k + λ)^{O(k)})$-time algorithm for arbitrary λ [Korhonen and Thorup\, FOCS 2026]. We give a deterministic algorithm with running time $O^*(36^k W)$. Thus\, for λ = 2\, the unweighted running time improves from $O^*(k^{O(k)})$ to $O^*(36^k)$\, and the algorithm also handles link costs with pseudo-polynomial dependence on $W$. \nWe reduce the problem to a boundary-pair variant of 2-vertex-connected spanning subgraph\, where each vertex is assigned a pair of incident edges with an associated pair cost. We solve this variant using a cancellation identity\, inspired by Cut&Count [Cygan et al.\, TALG 2022]\, obtained by applying Möbius inversion to decompositions along cut vertices: the identity cancels every connected spanning graph with more than one block and keeps exactly the 2-vertex-connected spanning graphs.
URL:https://dimag.ibs.re.kr/event/2026-08-04/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260805T163000
DTEND;TZID=Asia/Seoul:20260805T173000
DTSTAMP:20260725T142224Z
CREATED:20260520T141609Z
LAST-MODIFIED:20260725T142224Z
UID:12683-1785947400-1785951000@dimag.ibs.re.kr
SUMMARY:Meike Hatzel\, Directed tree-cutwidth and immersions
DESCRIPTION:The first major step towards the graph minor structure theorem by Robertson and Seymour was the grid theorem\, a result describing that every graph of large treewidth contains a grid as minor. In 2014 Wollan gave a definition for a tree-like decomposition and a width parameter tree-cutwidth with respect to immersions\, a different graph containment relation. He provided results linking this parameter to immersions of large walls. This talk presents a version of this parameter for directed graphs\, the directed tree-cutwidth. The main result is a grid theorem for directed tree-cutwidth establishing that it is linked to directed immersions of large cylindrical walls. \nThe presented work is joined with Marcin Briański\, Karolina Okrasa\, and Michał Pilipczuk.
URL:https://dimag.ibs.re.kr/event/2026-08-05/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20260810
DTEND;VALUE=DATE:20260815
DTSTAMP:20260522T224718Z
CREATED:20260522T224718Z
LAST-MODIFIED:20260522T224718Z
UID:12688-1786320000-1786751999@dimag.ibs.re.kr
SUMMARY:2026 Summer School on Combinatorics and Algorithms (2026 조합론 및 알고리즘 여름학교)
DESCRIPTION:The 2026 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. \nWebsite: https://combialgo.dimag.kr/2026/ \nLecturers and Topics\n\nDaniel Dadush\, CWI\, Amsterdam\n\nAlgorithms & Geometry of Linear Programming\n\n\nMagnus Wahlström\, Royal Holloway\, University of London\n\nMatroids\, delta-matroids\, and applications\n\n\n\nSchedule\n\nStart on 10 August 2026 Monday\, 2 PM\nEnd on 14 August 2025 Friday\, 5 PM
URL:https://dimag.ibs.re.kr/event/2026-08-10/
LOCATION:Bldg. E11\, KAIST
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260818T163000
DTEND;TZID=Asia/Seoul:20260818T173000
DTSTAMP:20260326T020259Z
CREATED:20260326T020259Z
LAST-MODIFIED:20260326T020259Z
UID:12486-1787070600-1787074200@dimag.ibs.re.kr
SUMMARY:Jinyoung Park (박진영)\, TBA
DESCRIPTION:
URL:https://dimag.ibs.re.kr/event/2026-08-18/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260922T163000
DTEND;TZID=Asia/Seoul:20260922T173000
DTSTAMP:20260717T080520Z
CREATED:20260717T080520Z
LAST-MODIFIED:20260717T080520Z
UID:12910-1790094600-1790098200@dimag.ibs.re.kr
SUMMARY:David Wood\, TBA
DESCRIPTION:
URL:https://dimag.ibs.re.kr/event/2026-09-22/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20261020
DTEND;VALUE=DATE:20261023
DTSTAMP:20260702T064849Z
CREATED:20260611T134208Z
LAST-MODIFIED:20260702T064849Z
UID:12748-1792454400-1792713599@dimag.ibs.re.kr
SUMMARY:2026 Combinatorics Workshop (2026 조합론 학술대회)
DESCRIPTION:Combinatorics Workshop (조합론 학술대회) is an annual conference for researchers in combinatorics and related areas in Korea. It was started in 2004 by the Yonsei University BK21 Research Group. Since 2013\, this workshop has been advised by the committee of discrete mathematics of the Korean Mathematical Society. \nWebsite: https://cw2026.combinatorics.kr/en/ \nVenue\nKonjiam Resort\, EW Village\, B2\, Meeting Room OPUS2 \n(278\, Docheogwit-Ro\, Docheok-Myeon\, Gwangju-Si\, Gyeonggi-Do\, Korea) \n\nTravel Instructions\n\nDates\nOctober 20 to 22\, 2026 \nPlenary Speaker\nAlexander V. Kostochka (UIUC) \nInvited Speakers\n\nCheolwon Heo (SUNY Korea)\nTony Huynh (IBS DIMAG)\nDabeen Lee (Seoul National University)\nJongbaek Song (Pusan National University)\n\nContributed Talks\nEach contributed talk will be about 20 minutes\, including questions. Please note that we may stop accepting contributed talk applications before the deadline if all available slots are filled. \nIf you are interested in giving a contributed talk at the workshop\, please submit an abstract by August 31\, 2026. \nTo apply for a contributed talk\, go to Call for Abstracts on Indico and click “Submit new abstract.” You may need to create an IBS Indico account. \nRegistration\nRegistration link \nThe registration deadline is August 31\, 2026. \nOrganizing Committee\n\nIlkyoo Choi (최일규)\, Hankuk University of Foreign Studies\, IBS Discrete Mathematics Group\, KIAS\nSang-il Oum (엄상일)\, IBS Discrete Mathematics Group\nBoram Park (박보람)\, Seoul National University\n\nAdvisory Committee\nCommittee of Discrete Mathematics\, The Korean Mathematical Society (Chair: Sang-il Oum) \nSponsors\n\nIBS Discrete Mathematics Group\nKorean Mathematical Society\nSeoul National University\nHankuk University of Foreign Studies
URL:https://dimag.ibs.re.kr/event/2026-combinatorics-workshop/
LOCATION:Konjiam Resort\, EW Village\, B2\, Meeting Room OPUS2
CATEGORIES:Workshops and Conferences
END:VEVENT
END:VCALENDAR