BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ead4ba7d333
DTSTART;TZID=America/Toronto:20260209T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260209T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-eunjung-kim-brief-introduction-twin
SUMMARY:Graphs and Matroids - Eunjung Kim-A brief introduction to twin-widt
 h.
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Eunjung Kim\n\nAFFILIATION:\n KAIST\n\nROOM:\n MC 54
 79\n\nABSTRACT:Twin-width is a notion introduced in 2020 by Bonnet\, Kim\,
 \nThomassé and Watrigant  which provides a unified perspective on a\nran
 ge of important graph classes\, encompassing both sparse and dense\nclasse
 s. Many graph classes ranging from planar graphs\, H-minor-free\ngraphs to
  proper interval graphs and graphs of bounded cliquewidth\nhave bounded tw
 in-width. This new perspective also allows us to\nestablish powerful prope
 rties such as tractability of First-Order\nmodel checking on many graph cl
 asses and (polynomial) χ-boundedness\nin a unified way. Twin-width is now
  considered an important part of\nthe toolbox for structural graph theory\
 , algorithms design\, logic on\nfinite graphs and data structure.
DTSTAMP:20260424T022602Z
END:VEVENT
END:VCALENDAR