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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260106T163000
DTEND;TZID=Asia/Seoul:20260106T173000
DTSTAMP:20260415T174022
CREATED:20251030T130957Z
LAST-MODIFIED:20251226T132814Z
UID:11793-1767717000-1767720600@dimag.ibs.re.kr
SUMMARY:Daniel Mock\, A Simple Algorithm for the Dominating Set Problem and More
DESCRIPTION:In [1]\, Fabianski et. al. developed a simple\, yet surprisingly powerful algorithmic framework to develop efficient parameterized graph algorithms. Notably they derive a simple parameterized algorithm for the dominating set problem on a variety of graph classes\, including powers of nowhere dense classes and biclique-free classes. These results encompass a wide range of previously known results and often improve the best known running times. Similar results follow for the distance-r variation of dominating set and for independent set. The running time of the algorithm is closely tied to model-theoretic properties\, i.e. stability and the Helly property. \nWe build upon these results and develop a similar algorithm which only relies on the strong Helly property and does not need stability. For the dominating set problem\, we get a parameterized algorithm that works (additionally to biclique-free classes and powers of nowhere dense classes) weakly gamma-closed classes while being simpler and faster than previously known results. \nIn this talk\, we introduce the basic framework\, results by Fabianski et. al and connections to other areas. We discuss our new insights and possible research directions. \n[1] Grzegorz Fabianski\, Michal Pilipczuk\, Sebastian Siebertz\, Szymon Torunczyk: Progressive Algorithms for Domination and Independence. STACS 2019
URL:https://dimag.ibs.re.kr/event/2026-01-06/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR