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:69d0d13e9ae38
DTSTART;TZID=America/Toronto:20231020T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231020T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-sepehr-assadi
SUMMARY:Tutte Colloquium - Sepehr Assadi
CLASS:PUBLIC
DESCRIPTION:TITLE: A Simple Sparsification Algorithm for Maximum Matching 
 with\nApplications to Graph Streams \n\nSpeaker:\n Sepehr Assadi\n\nAffil
 iation:\n University of Waterloo\n\nLocation:\n MC 5501\n\nABSTRACT: In t
 his talk\, we present a simple algorithm that\nreduces approximating the 
 maximum weight matching problem in\narbitrary graphs to few adaptively cho
 sen instances of the same\nproblem on sparse graphs.
DTSTAMP:20260404T085214Z
END:VEVENT
END:VCALENDAR