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:68276fd7e5f10
DTSTART;TZID=America/Toronto:20231020T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231020T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-sepehr-assadi
SUMMARY:Tutte Colloquium - Sepehr Assadi
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: A Simple Sparsification Algorithm for Maxim
 um Matching with\nApplications to Graph Streams \n\nSpeaker:\n Sepehr Ass
 adi\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nLocation:\n MC 5501\n\nABS
 TRACT: In this talk\, we present a simple algorithm that\nreduces approx
 imating the maximum weight matching problem in\narbitrary graphs to few ad
 aptively chosen instances of the same\nproblem on sparse graphs.\n 
DTSTAMP:20250516T170319Z
END:VEVENT
END:VCALENDAR