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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cea07b7d20d
DTSTART;TZID=America/Toronto:20230523T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230523T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/ura-seminar-
 ronen-wdowinski
SUMMARY:URA Seminar - Ronen Wdowinski
CLASS:PUBLIC
DESCRIPTION:TITLE: Bounded degree arboricity\n\nSpeaker:\n Ronan Wdowinski\
 n\nAffiliation:\n University of Waterloo\n\nLocation:\n MC 5479\n\nABSTRAC
 T: For a multigraph $G$ together with a positive weight $f(v)$\non every v
 ertex $v$\, we study the problem of covering the edge set of\n$G$ by the m
 inimum number of forests $F$ in which every vertex $v$ has\ndegree at most
  $f(v)$ in $F$.
DTSTAMP:20260402T165939Z
END:VEVENT
END:VCALENDAR