BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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;TZID=Asia/Seoul:20240730T163000
DTEND;TZID=Asia/Seoul:20240730T173000
DTSTAMP:20260422T182800
CREATED:20240417T003214Z
LAST-MODIFIED:20240705T153017Z
UID:8532-1722357000-1722360600@dimag.ibs.re.kr
SUMMARY:Euiwoong Lee (이의웅)\, Parameterized Approximability of F-Deletion Problems
DESCRIPTION:For a family F of graphs\, the F-Deletion Problem asks to remove the minimum number of vertices from a given graph G to ensure that G belongs to F. One of the most common ways to obtain an interesting family F is to fix another family H of graphs and let F be the set of graphs that do not contain any graph H as some notion of a subgraph\, including (standard) subgraph\, induced subgraph\, and minor. This framework captures numerous basic graph problems\, including Vertex Cover\, Feedback Vertex Set\, and Treewidth Deletion\, and provides an interesting forum where ideas from approximation and parameterized algorithms influence each other. In this talk\, I will give a brief survey on the state of the art on the F-Deletion Problems for the above three notions of subgraphs\, and talk about a recent result on Weighted Bond Deletion.
URL:https://dimag.ibs.re.kr/event/2024-07-30/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR