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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d32697e46ae
DTSTART;TZID=America/Toronto:20190621T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190621T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-michael-anastos
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Michael Anastos
CLASS:PUBLIC
DESCRIPTION:TITLE: Finding perfect matchings in random regular graphs in l
 inear\nexpected time\n\nSpeaker:\n Michael Anastos\n\nAffiliation:\n Carne
 gie Mellon University\n\nRoom:\n MC 5501\n\nABSTRACT:\n\nIn a seminal pape
 r on finding large matchings in sparse random graphs\,\nKarp and Sipser pr
 oposed two algorithms for this task. The second\nalgorithm has been intens
 ely studied\, but due to technical\ndifficulties\, the first algorithm has
  received less attention.\nEmpirical results suggest that the first algori
 thm is superior.
DTSTAMP:20260406T032055Z
END:VEVENT
END:VCALENDAR