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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf73f8ed82f
DTSTART;TZID=America/Toronto:20180615T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180615T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-marthe-bonamy-0
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Marthe Bonamy
CLASS:PUBLIC
DESCRIPTION:TITLE: Distributed coloring in planar graphs\n\nSpeaker:\n Mar
 the Bonamy\n\nAffiliation:\n University of Bordeaux\n\nRoom:\n MC 5501\n\n
 ABSTRACT:\n\nWe are concerned with efficiently coloring sparse graphs in t
 he\ndistributed setting with as few colors as possible. According to the\n
 celebrated Four Color Theorem\, planar graphs can be colored with at\nmost
  4 colors\, and the proof gives a (sequential) quadratic algorithm\nfindin
 g such a coloring.
DTSTAMP:20260403T080200Z
END:VEVENT
END:VCALENDAR