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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230201T163000
DTEND;TZID=Asia/Seoul:20230201T173000
DTSTAMP:20260418T192417
CREATED:20230115T151551Z
LAST-MODIFIED:20240705T170041Z
UID:6664-1675269000-1675272600@dimag.ibs.re.kr
SUMMARY:Benjamin Bergougnoux\, Tight Lower Bounds for Problems Parameterized by Rank-width
DESCRIPTION:We show that there is no $2^{o(k^2)} n^{O(1)}$ time algorithm for Independent Set on $n$-vertex graphs with rank-width $k$\, unless the Exponential Time Hypothesis (ETH) fails. Our lower bound matches the $2^{O(k^2)} n^{O(1)}$ time algorithm given by Bui-Xuan\, Telle\, and Vatshelle [Discret. Appl. Math.\, 2010] and it answers the open question of Bergougnoux and Kanté [SIAM J. Discret. Math.\, 2021]. We also show that the known $2^{O(k^2)} n^{O(1)}$ time algorithms for Weighted Dominating Set\, Maximum Induced Matching and Feedback Vertex Set parameterized by rank-width $k$ are optimal assuming ETH. Our results are the first tight ETH lower bounds parameterized by rank-width that do not follow directly from lower bounds for $n$-vertex graphs. \nThis is a joint work with Tuukka Korhonen and Jesper Nederlof.\nAccepted to STACS 2023 and available on arXiv https://arxiv.org/abs/2210.02117
URL:https://dimag.ibs.re.kr/event/2023-02-01/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR