BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//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:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240806T163000
DTEND;TZID=Asia/Seoul:20240806T173000
DTSTAMP:20260417T234126
CREATED:20240530T224927Z
LAST-MODIFIED:20240710T060308Z
UID:8733-1722961800-1722965400@dimag.ibs.re.kr
SUMMARY:Daniel Král'\, Matroid depth and width parameters
DESCRIPTION:Depth and width parameters of graphs\, e.g.\, tree-width\, path-width and tree-depth\, play a crucial role in algorithmic and structural graph theory. These notions are of fundamental importance in the theory of graph minors\, fixed parameter complexity and the theory of sparsity. \nIn this talk\, we will survey structural and algorithmic results that concern width and depth parameters of matroids. We will particularly focus on matroid depth parameters and discuss the relation of the presented concepts to discrete optimization. As an application\, we will present matroid based algorithms that uncover a hidden Dantzig-Wolfe-like structure of an input instance (if such structure is present) and transform instances of integer programming to equivalent ones\, which are amenable to the existing tools in integer programming. \nThe most recent results presented in the talk are based on joint work with Marcin Briański\, Jacob Cooper\, Timothy F. N. Chan\, Martin Koutecký\, Ander Lamaison\, Kristýna Pekárková and Felix Schröder.
URL:https://dimag.ibs.re.kr/event/2024-08-06/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR