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:683a5260c27fc
DTSTART;TZID=America/Toronto:20190621T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190621T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-michael-anastos
SUMMARY:Tutte Colloquium - Michael Anastos
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Finding perfect matchings in random regular
  graphs in linear\nexpected time\n\nSpeaker:\n Michael Anastos\n\nAffiliat
 ion:\n Carnegie Mellon University\n\nRoom:\n MC 5501\n\nABSTRACT:\n\nIn a 
 seminal paper on finding large matchings in sparse random graphs\,\nKarp a
 nd Sipser proposed two algorithms for this task. The second\nalgorithm has
  been intensely studied\, but due to technical\ndifficulties\, the first a
 lgorithm has received less attention.\nEmpirical results suggest that the 
 first algorithm is superior.\n 
DTSTAMP:20250531T005040Z
END:VEVENT
END:VCALENDAR