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:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d1ccfadc5db
DTSTART;TZID=America/Toronto:20240209T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240209T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-janani-sundaresan
SUMMARY:C&O Reading Group - Janani Sundaresan
CLASS:PUBLIC
DESCRIPTION:TITLE: Online Edge Coloring with Tree Recurrences\n\nSPEAKER:\n
  Janani Sundaresan\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n
  MC 6029\n\nABSTRACT: We will talk about online edge coloring in the edge 
 arrival\nmodel. The vertex set V is known\, and each edge arrives one by o
 ne\,\nwhere it has to be colored irrevocably immediately. I will present t
 he\nresults from Kulkarni\, Liu\, Sah\, Sawhney and Tarnawski [STOC 2022]\
 nwhich gives an algorithm that colors the graph with (e/e-1 +\no(1))\\delt
 a colors.
DTSTAMP:20260405T024618Z
END:VEVENT
END:VCALENDAR